The following pages link to Randomized allocation processes (Q2746211):
Displaying 13 items.
- Tight bounds for parallel randomized load balancing (Q287991) (← links)
- A generalization of multiple choice balls-into-bins: tight bounds (Q524374) (← links)
- On the \(k\)-orientability of random graphs (Q1024456) (← links)
- Self-stabilizing repeated balls-into-bins (Q1733393) (← links)
- Self-stabilizing balls and bins in batches. The power of leaky bins (Q1799218) (← links)
- Group service system with three queues and load balancing (Q2081002) (← links)
- Dynamic averaging load balancing on cycles (Q2118388) (← links)
- A faster algorithm for cuckoo insertion and bipartite matching in large graphs (Q2319642) (← links)
- Graphical balanced allocations and the (1 + β)-choice process (Q3460518) (← links)
- Multiple choice tries and distributed hash tables (Q3633017) (← links)
- Two-way chaining for non-uniform distributions (Q5852152) (← links)
- Balanced Allocation: Patience Is Not a Virtue (Q5885582) (← links)
- The Power of Filling in Balanced Allocations (Q6188516) (← links)
