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

669 Universal classes of hash functions – L Carter, M Wegman - 1979
222 Storing a sparse table with O(1) worst case access time – M L Fredman, J Komlós, E Szemerédi - 1984
47 Multilevel Adaptive Hashing – A Broder, A Karlin - 1990
1707 The probabilistic method – N Alon, J Spencer
145 Certificate Revocation and Certificate Update – Moni Naor, Kobbi Nissim - 1998
164 Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees – Niko Baric, Birgit Pfitzmann - 1997
114 One-way accumulators: A decentralized alternative to digital signatures – Josh Benaloh, Michael De Mare - 1993
203 Design and implementation of an efficient priority queue – P van Emde Boas, R Kaas, E Zijlstra - 1977
696 Art of Computer Programming Volume 3: Sorting and Searching – D E Knuth - 1998
84 auf der Heide, “Efficient PRAM Simulation on a Distributed Memory – R M Karp, M Luby, F Meyer - 1992
79 The Art of Computer Programming, Vol. I: Fundamental Algorithms – D E Knuth - 1973
5 Is linear hashing good – N Alon, M Dietzfelbinger, P B Miltersen, E Petrank, G Tardos - 1997
412 Syntactic Clustering of the Web – A Broder, S Glassman, M Manasse, G Zweig - 1997
338 On the Resemblance and Containment of Documents – Andrei Z. Broder - 1997
403 Introduction to Analytic Number Theory – T M Apostol - 1976
288 World-Wide Web – Tim Berners-Lee, Robert Cailliau - 1992
8 Efficient Accumulators Without Trapdoor – Tomas Sander - 1999
8 Commutativity in Cryptography – K Nyberg - 1996
8 Secure and Efficient Time-Stamping Systems – Helger Lipmaa - 1999