Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables
- 7 May 2012
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 41 (3) , 334-364
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- NSF grant (DMS0753472)
This publication has 18 references indexed in Scilit:
- Finite size scaling for the core of large random hypergraphsThe Annals of Applied Probability, 2008
- Cores in random hypergraphs and Boolean formulasRandom Structures & Algorithms, 2005
- The cores of random hypergraphs with a given degree sequenceRandom Structures & Algorithms, 2004
- Cuckoo hashingJournal of Algorithms, 2004
- Existence of a perfect matching in a random (1+e−1)—out bipartite graphJournal of Combinatorial Theory, Series B, 2003
- Cuckoo hashing: Further analysisInformation Processing Letters, 2003
- The 3-XORSAT thresholdComptes Rendus Mathematique, 2002
- Efficient erasure correcting codesIEEE Transactions on Information Theory, 2001
- A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular GraphsEuropean Journal of Combinatorics, 1980
- Matchings in random regular bipartite digraphsDiscrete Mathematics, 1980