Randomized allocation processes

How researchers see this paper

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

PIR with Compressed Queries and Amortized Query Processing (2018, background): “Optimal solutions for this problem can be computed in polynomial time [25], and linear time approximations also exist [20, 30, 37].”
The k-orientability thresholds for Gn, p (2007, methodology): “The proof of Theorem 1.1 involves the analysis of an algorithm for computing an upper bound on the probability that a random graph with a speci.ed degree distribution is k-orientable.”
Balanced Allocations (1999, background): “The question they analyze is, what is the expected maximum load under a random order of insertion under the greedy strategy? More recent results, based on the balanced allocation paradigm, have appeared in [23, 24, 25, 12].”