Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
Sudden emergence of a giant k-core in a random graph
Journal of Combinatorial Theory Series B
A critical point for random graphs with a given degree sequence
Random Graphs 93 Proceedings of the sixth international seminar on Random graphs and probabilistic methods in combinatorics and computer science
SIAM Journal on Computing
Randomized allocation processes
Random Structures & Algorithms
Random Graphs, Random Walks, Differential Equations and the Probabilistic Analysis of Algorithms
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
Combinatorics, Probability and Computing
The pure literal rule threshold and cores in random hypergraphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Journal of Algorithms
Efficient hashing with lookups in two memory accesses
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The cores of random hypergraphs with a given degree sequence
Random Structures & Algorithms
Two-way hashing with separate chaining and linear probing
Two-way hashing with separate chaining and linear probing
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Balanced allocation and dictionaries with tightly packed constant size bins
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Load balancing and orientability thresholds for random hypergraphs
Proceedings of the forty-second ACM symposium on Theory of computing
Tight thresholds for cuckoo hashing via XORSAT
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Orientability of random hypergraphs and the power of multiple choices
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
A new approach to the orientation of random hypergraphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
The multiple-orientability thresholds for random hypergraphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The rigidity transition in random graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Sharp load thresholds for cuckoo hashing
Random Structures & Algorithms
Hi-index | 0.00 |
We prove that, for k ≥ 2, the k-orientability threshold for the random graph Gn, p coincides with the threshold at which the (k + 1)-core has average degree 2k. The proof involves the analysis of a heuristic algorithm that attempts to find a k-orientation of the random graph. The k-orientation threshold has several applications including offline balanced allocation with a limit of k on maximum bin-size, perfect hashing with a limit of k on maximum chain-length, and concurrent access to parallel memories through redundancy,