Dynamic Perfect Hashing: Upper and Lower Bounds (1990)

Cached

Download Links

by Martin Dietzfelbinger , Anna Karlin , Kurt Mehlhorn , Friedhelm Meyer auf der Heide , Hans Rohnert , Robert E. Tarjan
Citations:127 - 13 self

Documents Related by Co-Citation

674 Universal Classes of Hash Functions – L Carter, M Wegman - 1979
218 Storing a sparse table with O(1) worst case access time – M L Fredman, J Komlós, E Szemerédi - 1984
200 E.: Design and implementation of an efficient priority queue – van Emde Boas, P Kaas, R Zijlstra - 1977
46 Multilevel adaptive hashing – A Broder, A Karlin - 1990
163 Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees – Niko Baric, Birgit Pfitzmann - 1997
144 Certificate Revocation and Certificate Update – Moni Naor, Kobbi Nissim - 1998
115 One-way accumulators: A decentralized alternative to digital signatures – Josh Benaloh, Michael De Mare - 1993
699 The Art of Computer Programming, volume 3: Sorting and Searching – D E Knuth - 1973
690 Algorithms in Combinatorial Geometry – H Edelsbrunner - 1987
86 auf der Heide. Efficient PRAM simulation on a distributed memory machine – R Karp, M Luby, F Meyer - 1992
5 Is linear hashing good – N Alon, M Dietzfelbinger, P B Miltersen, E Petrank, G Tardos - 1997
290 World-Wide Web – Tim Berners-Lee, Robert Cailliau - 1992
80 The Art of Computer Programming, Vol. I: Fundamental Algorithms – D E Knuth - 1968
414 Syntactic clustering of the web – A BRODER, S GLASSMAN, M MANASSE, G ZWEIG - 1997
345 On the Resemblance and Containment of Documents – Andrei Z. Broder - 1997
430 Introduction to Analytic Number Theory – Tom M Apostol - 1976
1695 The probabilistic method – N Alon, J Spencer - 2000
140 On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles, Discrete and Computational Geometry 1 – K Kedem, R Livne, J Pach, M Sharir - 1986
60 Fat triangles determine linearly many holes – J Matousek, J Pach, M Sharir, S Sifrony, E Welzl - 1994