1. Ajtai, M., Jayram, T.S., Kumar, R., Sivakumar, D.: Approximate counting of inversions in a data stream. In: Reif, J.H. (ed.) Proceedings of 34th Annual ACM Symposium on Theory of Computing, Montréal, Québec, Canada, 19–21 May 2002, pp. 370–379. ACM (2002)
2. Alon, N., Duffield, N., Lund, C., Thorup, M.: Estimating arbitrary subset sums with few probes. In: ACM (ed.) Proceedings of the Twenty-Fourth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems: PODS 2005, Baltimore, Maryland, 13–15 June 2005, pp. 317–325. ACM Press (2005)
3. Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58(1), 137–147 (1999)
4. Babaioff, M., Immorlica, N., Kleinberg, R.: Matroids, secretary problems, and online mechanisms. In: Bansal, N., Pruhs, K., Stein, C. (eds.) SODA, pp. 434–443. SIAM (2007)
5. Bateni, M., Hajiaghayi, M., Zadimoghaddam, M.: Submodular secretary problem and extensions. ACM Trans. Algorithms 9(4), Art. 32, 23 (2013)