The k-orientability thresholds for Gn, p

63 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation (2009, background): “For further and improved analysis see also [6], [12], [13], [20], [22], [24], [25], [34].”
Tight Thresholds for Cuckoo Hashing via XORSAT (2009, background): “The following tables contain numerical values of c k;‘ for ‘= 2;:::;7 and k= 2;:::;7. Some of these numbers are found or referred to in other works, such as [6, Sect. 5], [19, Sect.4.4], [20, p.423], [9], and [4]. 3 Equality of thresholds for random k-XORSAT and k-ary cuckoo hashing We now recall th”
The random graph threshold for k-orientiability and a fast algorithm for optimal multiple-choice allocation (2007, methodology): “We have also implemented and tested the EDR algorithm from [12].”
Balls into Bins Made Faster (2013, background): “Fernholz and Ramachandran [3] and Cain, Sanders, and Wormald [2] gave linear time algorithms for computing an optimal allocation (asymptotically almost surely).”