Estimating Rarity and Similarity over Data Stream Windows
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
On restricted min-wise independence of permutations
Random Structures & Algorithms
A simple proof that finding a maximal independent set in a graph is in NC
Information Processing Letters
Optimal approximations of the frequency moments of data streams
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Space efficient mining of multigraph streams
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Data streams: algorithms and applications
Foundations and Trends® in Theoretical Computer Science
A near-optimal algorithm for computing the entropy of a stream
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On (ε,k)-min-wise independent permutations
Random Structures & Algorithms
A Sketch Algorithm for Estimating Two-Way and Multi-Way Associations
Computational Linguistics
SpotSigs: robust and efficient near duplicate detection in large web collections
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
Construction of Yet Another Forward Secure Signature Scheme Using Bilinear Maps
ProvSec '08 Proceedings of the 2nd International Conference on Provable Security
Entity resolution with iterative blocking
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Disjoint bases in a polymatroid
Random Structures & Algorithms
Sketching techniques for collaborative filtering
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A simple proof that finding a maximal independent set in a graph is in NC
Information Processing Letters
Proceedings of the 19th international conference on World wide web
A near-optimal algorithm for estimating the entropy of a stream
ACM Transactions on Algorithms (TALG)
On the k-independence required by linear probing and minwise independence
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Entity resolution with evolving rules
Proceedings of the VLDB Endowment
Fingerprinting ratings for collaborative filtering: theoretical and empirical analysis
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Exponential time improvement for min-wise based algorithms
Information and Computation
Theory and applications of b-bit minwise hashing
Communications of the ACM
The power of simple tabulation hashing
Proceedings of the forty-third annual ACM symposium on Theory of computing
The Power of Simple Tabulation Hashing
Journal of the ACM (JACM)
Sketching for big data recommender systems using fast pseudo-random fingerprints
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Efficient sampling of non-strict turnstile data streams
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
b-bit minwise hashing in practice
Proceedings of the 5th Asia-Pacific Symposium on Internetware
Incremental entity resolution on rules and data
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.02 |