Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
Surpassing the information theoretic bound with fusion trees
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Dynamic Perfect Hashing: Upper and Lower Bounds
SIAM Journal on Computing
Optimal bounds for the predecessor problem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Fast deterministic construction of static dictionaries
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Communications of the ACM
Priority Queues: Small, Monotone and Trans-dichotomous
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Polynomial Hash Functions Are Reliable (Extended Abstract)
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Faster deterministic sorting and searching in linear space
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Roundtrip spanners and roundtrip routing in directed graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Nearest common ancestors: a survey and a new distributed algorithm
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Optimal bounds for the predecessor problem and related problems
Journal of Computer and System Sciences - STOC 1999
A trade-off for worst-case efficient dictionaries
Nordic Journal of Computing
A New Trade-Off for Deterministic Dictionaries
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Roundtrip spanners and roundtrip routing in directed graphs
ACM Transactions on Algorithms (TALG)
Note: Fast set intersection and two-patterns matching
Theoretical Computer Science
| Hi-index | 0.00 |