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

Cached

Download Links

by Peter Bro Miltersen
Citations:17 - 2 self

Active Bibliography

19 Static Dictionaries on AC^0 RAMs: Query time Θ(,/log n / log log n) is necessary and sufficient – Arne Andersson, Peter Bro Miltersen, et al. - 1996
63 Optimal Bounds for the Predecessor Problem – Paul Beame, Faith E. Fich
7 Lower bounds for static dictionaries on RAMs with bit operations but no multiplication – Peter Bro Miltersen - 1996
3 Improved Data Structures for Predecessor Queries in Integer Sets – Rajeev Raman - 1996
18 Membership in Constant Time and Minimum Space – Andrej Brodnik, J. Ian Munro - 1994
21 Almost Random Graphs with Simple Hash Functions – Martin Dietzfelbinger, Philipp Woelfel - 2003
86 Sorting in Linear Time? – Arne Andersson, Torben Hagerup, Stefan Nilsson, Rajeev Raman - 1995
Arne Andersson – Arne Andersson, Torben Hagerup, Stefan Nilsson
26 Dynamic Ordered Sets with Exponential Search Trees – Arne Andersson, Mikkel Thorup - 2001
4 Simple Fast Parallel Hashing by Oblivious Execution – Joseph Gil, Yossi Matias - 1994
9 Linear Hash Functions – Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos - 1999
7 A Trade-Off For Worst-Case Efficient Dictionaries – Rasmus Pagh
14 Tables Should Be Sorted (on Random Access Machines) – Faith Fich, Peter Bro Miltersen - 1995
Implementation and Performance Analysis of Exponential Tree Sorting – Ajit Singh, Dr. Deepak Garg
Tabulation Based 5-independent Hashing with Applications to Linear Probing and Second Moment Estimation ∗ – Mikkel Thorup, Yin Zhang
27 Integer Priority Queues with Decrease Key in . . . – Mikkel Thorup - 2003
unknown title – Ulrich Meyer - 2001
49 Undirected Single Source Shortest Paths in Linear Time – Mikkel Thorup - 1997
6 Persistent Predecessor Search and Orthogonal Point Location on the Word RAM – Timothy M. Chan