Stability of binary exponential backoff
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
The space complexity of approximating the frequency moments
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A fast, highly reliable data compression chip and algorithm for storage systems
IBM Journal of Research and Development
New sampling-based summary statistics for improving approximate query answers
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Approximate counting of inversions in a data stream
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Runs of geometrically distributed random variables: a probabilistic analysis
Journal of Computational and Applied Mathematics - Special issue: Probabilistic methods in combinatorics and combinatorial optimization
Frequency Estimation of Internet Packet Streams with Limited Space
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis
Theoretical Computer Science
Markov Processes Involving q-Stirling Numbers
Combinatorics, Probability and Computing
An overview of the basic principles of the Q-Coder adaptive binary arithmetic coder
IBM Journal of Research and Development - Q-Coder adaptive binary arithmetic coder
Monotone runs of uniformly distributed integer random variables: a probabilistic analysis
Theoretical Computer Science - In memoriam: Alberto Del Lungo (1965-2003)
An algorithm for approximate counting using limited memory resources
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Generalized approximate counting revisited
Theoretical Computer Science
Random Subsets of the Interval and P2P Protocols
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Approximate shared-memory counting despite a strong adversary
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Probabilistic counting with randomized storage
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Approximate shared-memory counting despite a strong adversary
ACM Transactions on Algorithms (TALG)
Dispersion estimates for telecommunications fraud
IPMU'10 Proceedings of the Computational intelligence for knowledge-based systems design, and 13th international conference on Information processing and management of uncertainty
Approximate counting with a floating-point counter
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Proceedings of the 15th Symposium on International Database Engineering & Applications
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
A randomized algorithm for finding frequent elements in streams using o(loglogn) space
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Approximate counting with m counters: A detailed analysis
Theoretical Computer Science
Sketching and streaming algorithms for processing massive data
XRDS: Crossroads, The ACM Magazine for Students - Big Data
Streaming analysis of discourse participants
EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
Efficient data stream classification via probabilistic adaptive windows
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.00 |