On enumerating and selecting distances
Proceedings of the fourteenth annual symposium on Computational geometry
Journal of the ACM (JACM)
Closest pair queries in spatial databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Even strongly universal hashing is pretty fast
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Improved fast integer sorting in linear space
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Deterministic sorting in O(nlog log n) time and linear space
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Implementing database operations using SIMD instructions
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Improved fast interger sorting in linear space
Information and Computation
Optimal bounds for the predecessor problem and related problems
Journal of Computer and System Sciences - STOC 1999
Efficient Strongly Universal and Optimally Universal Hashing
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Translating a Planar Object to Maximize Point Containment
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Almost random graphs with simple hash functions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Deterministic sorting in O(nlog logn) time and linear space
Journal of Algorithms
Tabulation based 4-universal hashing with applications to second moment estimation
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Journal of Algorithms
Journal of the ACM (JACM)
Theoretical Computer Science
Theoretical Computer Science - Computing and combinatorics
Approximating Boolean functions by OBDDs
Discrete Applied Mathematics
Uniform deterministic dictionaries
ACM Transactions on Algorithms (TALG)
A dictionary implementation based on dynamic perfect hashing
Journal of Experimental Algorithmics (JEA)
String hashing for linear probing
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
On risks of using cuckoo hashing with simple universal hash classes
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Reversible Data Hiding in the VQ-Compressed Domain
IEICE - Transactions on Information and Systems
The design of a bloom filter hardware accelerator for ultra low power systems
Proceedings of the 14th ACM/IEEE international symposium on Low power electronics and design
Proceedings of the 19th international conference on World wide web
Maintaining external memory efficient hash tables
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
The wavelet trie: maintaining an indexed sequence of strings in compressed space
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
The Power of Simple Tabulation Hashing
Journal of the ACM (JACM)
SIAM Journal on Computing
Spatial query processing for fuzzy objects
The VLDB Journal — The International Journal on Very Large Data Bases
Explicit and efficient hash families suffice for cuckoo hashing with a stash
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Short-Output universal hash functions and their use in fast and secure data authentication
FSE'12 Proceedings of the 19th international conference on Fast Software Encryption
High throughput heavy hitter aggregation for modern SIMD processors
Proceedings of the Ninth International Workshop on Data Management on New Hardware
b-bit minwise hashing in practice
Proceedings of the 5th Asia-Pacific Symposium on Internetware
Reverse Authentication in Financial Transactions and Identity Management
Mobile Networks and Applications
| Hi-index | 0.01 |