Not all keys can be hashed in constant time
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A trade-off for worst-case efficient dictionaries
Nordic Journal of Computing
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Efficient Minimal Perfect Hashing in Nearly Minimal Space
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
Uniform hashing in constant time and linear space
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Cuckoo hashing: further analysis
Information Processing Letters
Journal of Algorithms
Efficient hashing with lookups in two memory accesses
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Applications of a Splitting Trick
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Low-contention data structures
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners
ACM Transactions on Algorithms (TALG)
De dictionariis dynamicis pauco spatio utentibus
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Low-contention data structures
Journal of Parallel and Distributed Computing
Time-Space trade-offs for longest common extensions
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Design strategies for minimal perfect hash functions
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
Various improvements to text fingerprinting
Journal of Discrete Algorithms
Time-space trade-offs for longest common extensions
Journal of Discrete Algorithms
| Hi-index | 0.00 |