Almost Random Graphs with Simple Hash Functions

Almost Random Graphs with Simple Hash Functions (2003)

Cached

Download Links

[www.cpsc.ucalgary.ca]
[www.cpsc.ucalgary.ca]

Other Repositories/Bibliography

DBLP

by Martin Dietzfelbinger , Philipp Woelfel

Venue:	STOC'03
Citations:	15 - 1 self

BibTeX

@MISC{Dietzfelbinger03almostrandom,
    author = {Martin Dietzfelbinger and Philipp Woelfel},
    title = {Almost Random Graphs with Simple Hash Functions},
    year = {2003}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

1493	Random Graphs - Bollobas - 2001
590	Universal classes of hash functions - Carter, Wegman - 1979
514	Graph Theory - Diestel - 2000
123	Dynamic perfect hashing: Upper and lower bounds - Dietzfelbinger, Karlin, et al. - 1994
86	Cuckoo Hashing - Pagh, Rodler - 2001
81	auf der Heide. Efficient PRAM simulation on a distributed memory machine - Karp, Luby, et al. - 1992
55	A reliable randomized algorithm for the closest-pair problem - Dietzfelbinger, Hagerup, et al. - 1993
39	On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications - Siegel - 1989
37	Practical minimal perfect hash functions for large databases - Fox, Heath, et al. - 1992
35	Universal hashing and k-wise independent random variables via integer arithmetic without primes - Dietzfelbinger - 1996
34	Space efficient hash tables with worst case constant access time - Fotakis, Pagh, et al. - 2005
21	A family of perfect hashing methods - Majewski, Wormald, et al. - 1996
20	Polynomial Hash Functions are Reliable - Dietzfelbinger, Gil, et al. - 1992
19	New classes and applications of hash functions - Wegman, Carter - 1979
18	On universal classes of extremely random constant-time hash functions - Siegel
17	The analysis of closed hashing under limited randomness (extended abstract - Schmidt, Siegel - 1990
15	Uniform Hashing in Constant Time and Linear Space - stlin, Pagh
12	auf der Heide, Dynamic hashing in real time, in - Dietzfelbinger, Meyer - 1992
12	On the cell probe complexity of membership and perfect hashing - Pagh - 2001
11	More Analysis of Double Hashing - Lueker, Molodowitch - 1988
8	and displace: Efficient evaluation of minimal perfect hash functions - Hash - 1999
6	Closed hashing is computable and optimally randomizable with universal hash functions - Siegel, Schmidt - 1995
5	Uniform hashing in constant time and optimal space - Pagh, Pagh
1	Exploiting storage redundancy to speed up shared memory simulations. Theoret - Heide, Scheideler, et al. - 1996