Balanced Allocations
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- The power of choice in growing trees
- The power of thinning in balanced allocation
- The loss of serving in the dark
- Chains-into-Bins Processes
- Choice-driven phase transition in complex networks
- Testing hypergraph colorability
- Choice-memory tradeoff in allocations
- On the power of choice for Boolean functions
- Power-of-d-Choices with Memory: Fluid Limit and Optimality
- Cuckoo hashing: Further analysis
- Power of \(d\) choices with simple tabulation
- Balancing sums of random vectors
- Decentralized list scheduling
- A lower bound on the queueing delay in resource constrained load balancing
- Randomized allocation processes
- Singletons for simpletons revisiting windowed backoff with Chernoff bounds
- Group service system with three queues and load balancing
- The power of online thinning in reducing discrepancy
- Orientability Thresholds for Random Hypergraphs
- The average-value allocation problem
- On Accommodating Customer Flexibility in Service Systems
- The power of two choices for random walks
- A balancing strategy
- Practical load balancing for content requests in peer-to-peer networks
- Anonymity and k-Choice Identities
- Stability of join the shortest queue networks
- Revisiting Randomized Parallel Load Balancing Algorithms
- Balanced allocations and global clock in population protocols: an accurate analysis
- Balanced allocations (extended abstract)
- On the drift of short schedules.
- Long-term balanced allocation via thinning
- Succinct oblivious RAM
- Self-stabilizing repeated balls-into-bins
- Power-of-two sampling in redundancy systems: the impact of assignment constraints
- Given enough choice, simple local rules percolate discontinuously
- Scalable multi-party private set-intersection
- Multiple choice tries and distributed hash tables
- Choices and intervals
- Layered hashing algorithm for real-time systems
- Efficient set intersection with simulation-based security
- Two-way chaining for non-uniform distributions
- Balanced allocation on hypergraphs
- D2B: A de Bruijn based content-addressable network
- Convergence of Achlioptas processes via differential equations with unique solutions
- scientific article; zbMATH DE number 911856 (Why is no real title available?)
- Studying Balanced Allocations with Differential Equations
- Balance in stable categories
- Getting a directed Hamilton cycle two times faster
- Optimization of allocation of funds to support interethnic harmony
- Maximum matchings in random bipartite graphs and the space utilization of cuckoo hash tables
- Contention resolution with constant throughput and log-logstar channel accesses
- Balls into bins via local search: cover time and maximum load
- An asymptotically optimal algorithm for generating bin cardinalities
- Multidimensional balanced allocations
- Balanced routing of random calls
- scientific article; zbMATH DE number 2016893 (Why is no real title available?)
- Serving in the dark should be done non-uniformly
- Hamiltonicity thresholds in Achlioptas processes
- Tight bounds for parallel randomized load balancing
- A generalized coupon collector problem
- scientific article; zbMATH DE number 1857645 (Why is no real title available?)
- Balanced allocation on dynamic hypergraphs
- Multiple-choice balanced allocation in (almost) parallel
- Building Hamiltonian cycles in the semi-random graph process in less than 2n rounds
- Balls into bins with related random choices
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
- Cascade equilibrium strategies in a two-server queueing system with inspection cost
- Balanced allocations: a simple proof for the heavily loaded case
- Revisiting randomized parallel load balancing algorithms
- A power-of-two-choices unbalanced allocation process
- A generalization of multiple choice balls-into-bins: tight bounds
- Efficient set operations in the presence of malicious adversaries
- Rumor spreading in random evolving graphs
- Parallel randomized load balancing: a lower bound for a more general model
- Asymptotic independence of queues under randomized load balancing
- NON-BACKTRACKING RANDOM WALKS MIX FASTER
- Balanced allocation and dictionaries with tightly packed constant size bins
- The CNN problem and other k-server variants
- The power of two choices with simple tabulation
- Analysis of large urn models with local mean-field interactions
- Perfectly balanced allocation
- An improved drift theorem for balanced allocations
- Thresholds for extreme orientability
- On the power of two choices: balls and bins in continuous time
- Chains-into-bins processes
- Balanced allocation: memory performance tradeoffs
- Automata, Languages and Programming
- Balanced allocations with the choice of noise
- Consistent hashing with bounded loads
- Range minimum queries in minimal space
- Balanced Allocation: Patience Is Not a Virtue
- Balanced Allocations: The Heavily Loaded Case
- Dynamic averaging load balancing on cycles
- scientific article; zbMATH DE number 247092 (Why is no real title available?)
- Paths to Stable Allocations
- Strongly balanced selections
- Optimal ball recycling
- A novel robust on-line protocol for load-balancing in structured peer-to-peer systems
- New techniques and tighter bounds for local computation algorithms
- Fast construction on a restricted budget
This page was built for publication: Balanced Allocations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4268876)
