Error Correcting Codes, Perfect Hashing Circuits, and Deterministic Dynamic Dictionaries (1997)

Cached

Download Links

by Peter Bro Miltersen
Citations:17 - 2 self

Documents Related by Co-Citation

27 Polynomial hash functions are reliable (extended abstract – M Dietzfelbinger, J Gil, Y Matias, N Pippenger
39 János Komlós, and Endre Szemerédi. Storing a sparse table with O(1) worst case access time – Michael L Fredman - 1984
43 Sorting and searching on the word RAM – T Hagerup - 1998
669 Universal classes of hash functions – L Carter, M Wegman - 1979
5 Fast deterministic construction of static dictionaries – Torben Hagerup - 1999
8 A lower bound on the cell probe complexity of the dictionary problem. Unpublished manuscript – R Sundar - 1993
63 Optimal Bounds for the Predecessor Problem – Paul Beame, Faith E. Fich
12 Surpassing the information-theoretic bound with fusion trees – M L Fredman, D E Willard - 1993
23 Mehlhorn, Friedhelm Meyer auf der – Martin Dietzfelbinger, Anna Karlin, Kurt - 1994
21 Endre Szemeredi. Storing a sparse table with O(1) worst case access time – Michael L Fredman, Janos Komlos - 1984
18 Endre Tarjan and Andrew Chi-Chih Yao. Storing a sparse table – Robert - 1979
1565 The Definition of Standard ML – Robin Milner, Mads Tofte - 1990
15 Friedhelm Meyer auf der Heide. A new universal class of hash functions and dynamic hashing in real time – Martin Dietzfelbinger - 1990
9 Faster Deterministic Dictionaries – Rasmus Pagh, Rasmus Pagh, Rasmus Pagh - 1999
14 deterministic sorting and searching in linear space – A Anderson, ”Faster - 1996
46 Priority queues: Small, monotone and trans-dichotomous – R Raman - 1996
21 Worst-case optimal insertion and deletion methods for decomposable searching problems – Mark H Overmars, Jan van Leeuwen - 1981
43 Tight(er) Worst-case Bounds on Dynamic Searching and Priority Queues – Arne Andersson, Mikkel Thorup - 2000
62 Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions – Noga Alon, Moni Naor - 1996