Deterministic Dictionaries
Top Cited Papers
- 31 October 2001
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 41 (1) , 69-85
- https://doi.org/10.1006/jagm.2001.1171
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Optimal Bounds for the Predecessor Problem and Related ProblemsJournal of Computer and System Sciences, 2002
- Tight(er) worst-case bounds on dynamic searching and priority queuesPublished by Association for Computing Machinery (ACM) ,2000
- Sorting in Linear Time?Journal of Computer and System Sciences, 1998
- Trans-Dichotomous Algorithms without Multiplication —some Upper and Lower BoundsBRICS Report Series, 1997
- Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functionsAlgorithmica, 1996
- Dynamic Perfect Hashing: Upper and Lower BoundsSIAM Journal on Computing, 1994
- Surpassing the information theoretic bound with fusion treesJournal of Computer and System Sciences, 1993
- Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memoriesActa Informatica, 1984
- Storing a Sparse Table with 0 (1) Worst Case Access TimeJournal of the ACM, 1984
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979