Randomized allocation processes
From MaRDI portal
Recommendations
- Approximate random allocation mechanisms
- On the efficiency and optimality of random allocations
- On the maximum of random assignment process
- Stochastic Apportionment
- Derandomized Balanced Allocation
- Pricing randomized allocations
- On Bellman's allocation processes
- Random assignment problems
- scientific article; zbMATH DE number 2089215
Cites work
- A guided tour of Chernoff bounds
- Allocating weighted jobs in parallel
- Balanced Allocations
- Balls and bins: A study in negative dependence
- Efficient PRAM simulation on a distributed memory machine
- Fairness in Scheduling
- How useful is old information (extended abstract)?
- scientific article; zbMATH DE number 1003263 (Why is no real title available?)
- scientific article; zbMATH DE number 3548141 (Why is no real title available?)
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 1775423 (Why is no real title available?)
- scientific article; zbMATH DE number 873409 (Why is no real title available?)
- On contention resolution protocols and associated probabilistic phenomena
- On the Lambert \(w\) function
- Parallel randomized load balancing
- Probability approximations via the Poisson clumping heuristic
- Studying Balanced Allocations with Differential Equations
- Sudden emergence of a giant k-core in a random graph
Cited in
(45)- On the k-orientability of random graphs
- On the analysis of randomized load balancing schemes
- Self-stabilizing repeated balls-into-bins
- Self-stabilizing balls and bins in batches. The power of leaky bins
- The power of thinning in balanced allocation
- Group service system with three queues and load balancing
- Dynamic averaging load balancing on cycles
- Random assignments on sequentially dichotomous domains
- Load balancing under \(d\)-thinning
- A faster algorithm for cuckoo insertion and bipartite matching in large graphs
- Analysis of randomized protocols for conflict-free distributed access
- Aggregating randomized and vector valued allocations
- On the power of two choices: balls and bins in continuous time
- The loss of serving in the dark
- Balanced allocations (extended abstract)
- Balls into bins made faster
- Tight bounds for parallel randomized load balancing
- A power-of-two-choices unbalanced allocation process
- scientific article; zbMATH DE number 2089215 (Why is no real title available?)
- Multiple-choice balanced allocation in (almost) parallel
- Balanced allocations: the heavily loaded case
- Serving in the dark should be done non-uniformly
- How asymmetry helps load balancing
- Graphical balanced allocations and the (1+ )-choice process
- Multiple choice tries and distributed hash tables
- Balanced Allocations
- scientific article; zbMATH DE number 653254 (Why is no real title available?)
- Randomized load balancing by joining and splitting bins
- Chains-into-bins processes
- Randomized algorithms for online vector load balancing
- Derandomized Balanced Allocation
- A generalization of multiple choice balls-into-bins: tight bounds
- Randomly Reinforced Urn Designs with Prespecified Allocations
- Randomization with non-uniform allocations: fulfillment time distributions and bias properties
- The loss of serving in the dark
- scientific article; zbMATH DE number 2214057 (Why is no real title available?)
- Two-way chaining for non-uniform distributions
- Balanced Allocation: Patience Is Not a Virtue
- Perfectly balanced allocation
- Recovery time of dynamic allocation processes
- Long-term balanced allocation via thinning
- The Power of Filling in Balanced Allocations
- An improved drift theorem for balanced allocations
- Balanced allocations with the choice of noise
- Balls into non-uniform bins
This page was built for publication: Randomized allocation processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2746211)
