TWO-WAY CHAINING WITH REASSIGNMENT

TWO-WAY CHAINING WITH REASSIGNMENT

Cached

Download Links

[cg.scs.carleton.ca]

Other Repositories/Bibliography

DBLP

by Ketan Dalal , Luc Devroye , Ebrahim Malalla , Erin Mcleish

Citations:

3 - 1 self

BibTeX

@MISC{Dalal_two-waychaining,
    author = {Ketan Dalal and Luc Devroye and Ebrahim Malalla and Erin Mcleish},
    title = {TWO-WAY CHAINING WITH REASSIGNMENT},
    year = {}
}

Bookmark

OpenURL

Abstract

Abstract. We present an algorithm for hashing ⌊ αn ⌋ elements into a table with n separate chains that requires O(1) deterministic worst-case insert time, and O(1) expected worst-case search time for constant α. We exploit the connection between two-way chaining and random graph theory in our techniques.

Citations

1346	Renyi A: On the evolution of random graphs - Erdos - 1960
1128	Probability inequalities for sums of bounded random variables - Hoeffding - 1963
600	Random graphs - Janson, Luczak, et al. - 2000
231	Fast probabilistic algorithms for hamiltonian circuits and matchings - Angluin, Valiant - 1977
210	Balanced allocations - Azar, Broder, et al. - 1994
207	Storing a sparse table with O(1) worst case access time - Fredman, Komlós, et al. - 1984
123	Dynamic perfect hashing: Upper and lower bounds - Dietzfelbinger, Karlin, et al. - 1994
106	Some remarks on the theory of graphs - Erdös - 1947
90	The Probabilistic Method, 2nd Ed - Alon, Spencer - 2000
86	Cuckoo Hashing - Pagh, Rodler - 2001
79	The power of two random choices: A survey of techniques and results, Handbook of Randomized Computing 1 - Mitzenmacher, Richa, et al. - 2001
75	Simple Load Balancing for Distributed Hash Tables - Byers, Considine, et al. - 2003
71	How asymmetry helps load balancing - Vocking - 1999
70	Expected length of the longest probe sequence in hash code searching - Gonnet - 1981
61	Using multiple hash functions to improve IP lookups - Broder, Mitzenmacher - 2001
51	Balanced allocations: The heavily loaded case - Berenbrink, Czumaj, et al.
44	The birth of the giant component, Random Structures and Algorithms 4 - Janson, Knuth, et al. - 1993
37	Branching processes and their applications in the analysis of tree structures and tree algorithms. Probabilistic methods for algorithmic discrete mathematics - Devroye - 1998
35	auf der Heide. A New Universal Class of Hash Functions and Dynamic Hashing in Real Time - Dietzfelbinger, Meyer - 1990
22	Deques with heap order - Gajewska, Tarjan - 1986
18	The transitive closure of a random digraph - Karp - 1990
13	Cuckoo hashing: Further analysis - Devroye, Morin
12	On the cell probe complexity of membership and perfect hashing - Pagh - 2001
10	Balls into bins”—a simple and tight analysis - Raab, Steger - 1998
9	Contention Resolution in Hashing Based Shared Memory Simulations - Czumaj, Heide, et al. - 1995
8	Randomized allocation processes, Random Structures Algorithms - Czumaj, Stemann
3	Two-way hashing with separate chaining and linear probing - Malalla - 2004
1	auf der Heide, “High performance universal hashing, with applications to shared memory simulations - Dietzfelbinger, Meyer - 1992