Closed Hashing is Computable and Optimally Randomizable with Universal Hash Functions (0)

Cached

Download Links

by Alan Siegel , Jeanette P. Schmidt
Citations:6 - 1 self

Active Bibliography

3 Double Hashing is Computable and Randomizable with Universal Hash Functions – Jeanette P. Schmidt, Alan Siegel
25 On Universal Classes of Extremely Random Constant Time Hash Functions and Their Time-Space Tradeoff – Alan Siegel
6 Toward a usable theory of Chernoff Bounds for heterogeneous and partially dependent random variables – Alan Siegel - 1992
1 Randomized Parallel Computation – Sanguthevar Rajasekaran, John H. Reif
On the statistical dependencies of coalesced hashing and their implications for both full and limited independence (Extended Abstract) – Alan Siegel
9 Algorithmic Chernoff-Hoeffding Inequalities in Integer Programming – Anand Srivastav, Peter Stangier - 1993
15 Linear probing with constant independence – Anna Pagh, Rasmus Pagh - 2007
64 Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms – Sanguthevar Rajasekaran, John H. Reif - 1989
13 On parallel integer sorting – Sanguthevar Rajasekaran, Sandeep Sen - 1992
104 Chernoff-Hoeffding Bounds for Applications with Limited Independence – Jeanette P. Schmidt, Alan Siegel, Aravind Srinivasan - 1993
32 Large deviations of combinatorial distributions II: Local limit theorems – Hsien-Kuei Hwang - 1997
3 Approximation Algorithms for Multiprocessor Scheduling under Uncertainty (Regular Submission) – Guolong Lin, Rajmohan Rajaraman
Parallel Randomized Algorithms for Selection, Sorting and Convex Hulls – Sanguthevar Rajasekaran, Sandeep Sen - 2000
3 Hashing, Randomness and Dictionaries – Rasmus Pagh - 2002
17 Cuckoo hashing: Further analysis – Luc Devroye, Pat Morin, Communicated F. Dehne - 2003
14 Hypercubic Sorting Networks – Tom Leighton, C. Greg Plaxton - 1998
3 A Practical Shortest Path Algorithm with Linear Expected Time – Andrew V. Goldberg - 2001
34 A Simple Shortest Path Algorithm with Linear Average Time – Andrew V. Goldberg
30 New Algorithmic Aspects Of The Local Lemma With Applications To Routing And Partitioning – Tom Leighton, Chi-Jen Lu, SATISH RAO, ARAVIND SRINIVASAN