Balanced Allocations
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Cuckoo hashing: Further analysis
- On the k-orientability of random graphs
- A balancing strategy
- Strongly balanced selections
- Random allocation of jobs with weights and precedence
- Balanced allocation through random walk
- Balanced allocations and global clock in population protocols: an accurate analysis
- Self-stabilizing repeated balls-into-bins
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
- Cascade equilibrium strategies in a two-server queueing system with inspection cost
- Testing hypergraph colorability
- Self-stabilizing balls and bins in batches. The power of leaky bins
- On the drift of short schedules.
- Optimization of allocation of funds to support interethnic harmony
- The CNN problem and other k-server variants
- Throughput and delay optimality of power-of-\(d\) choices in inhomogeneous load balancing systems
- The power of thinning in balanced allocation
- Range minimum queries in minimal space
- Singletons for simpletons revisiting windowed backoff with Chernoff bounds
- Group service system with three queues and load balancing
- Power-of-two sampling in redundancy systems: the impact of assignment constraints
- Dynamic averaging load balancing on cycles
- A lower bound on the queueing delay in resource constrained load balancing
- Thresholds for extreme orientability
- Load balancing under \(d\)-thinning
- Balanced routing of random calls
- D2B: A de Bruijn based content-addressable network
- Balanced allocation and dictionaries with tightly packed constant size bins
- Practical load balancing for content requests in peer-to-peer networks
- Fast flooding over Manhattan
- On weighted balls-into-bins games
- The power of online thinning in reducing discrepancy
- Analysis of randomized protocols for conflict-free distributed access
- On the power of two choices: balls and bins in continuous time
- New techniques and tighter bounds for local computation algorithms
- Choices and intervals
- Analysis of large urn models with local mean-field interactions
- MDS coding is better than replication for job completion times
- The loss of serving in the dark
- Balanced varieties
- Efficient set intersection with simulation-based security
- Randomized allocation processes
- Rumor spreading in random evolving graphs
- Balanced allocations (extended abstract)
- Delaying satisfiability for random 2SAT
- Tight bounds for parallel randomized load balancing
- Getting a directed Hamilton cycle two times faster
- Multidimensional balanced allocations
- Paths to Stable Allocations
- A power-of-two-choices unbalanced allocation process
- Chains-into-Bins Processes
- scientific article; zbMATH DE number 2089215 (Why is no real title available?)
- Hamiltonicity thresholds in Achlioptas processes
- A generalized coupon collector problem
- Multiple-choice balanced allocation in (almost) parallel
- Sharp load thresholds for cuckoo hashing
- Maximum matchings in random bipartite graphs and the space utilization of cuckoo hash tables
- Choice-driven phase transition in complex networks
- Succinct oblivious RAM
- Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process
- Power-of-d-Choices with Memory: Fluid Limit and Optimality
- Revisiting Randomized Parallel Load Balancing Algorithms
- Serving in the dark should be done non-uniformly
- Graphical balanced allocations and the (1+ )-choice process
- NON-BACKTRACKING RANDOM WALKS MIX FASTER
- Anonymity and k-Choice Identities
- Multiple choice tries and distributed hash tables
- Decentralized list scheduling
- Decay of tails at equilibrium for FIFO join the shortest queue networks
- scientific article; zbMATH DE number 4085056 (Why is no real title available?)
- Asymptotic independence of queues under randomized load balancing
- scientific article; zbMATH DE number 1301967 (Why is no real title available?)
- Balls into bins with related random choices
- Efficient set operations in the presence of malicious adversaries
- Revisiting randomized parallel load balancing algorithms
- scientific article; zbMATH DE number 2016893 (Why is no real title available?)
- Chains-into-bins processes
- Balanced allocation: memory performance tradeoffs
- A novel robust on-line protocol for load-balancing in structured peer-to-peer systems
- The power of two choices with simple tabulation
- Consistent hashing with bounded loads
- Balancing sums of random vectors
- Contention resolution with constant throughput and log-logstar channel accesses
- A mean field model for a class of garbage collection algorithms in flash-based solid state drives
- scientific article; zbMATH DE number 1857645 (Why is no real title available?)
- scientific article; zbMATH DE number 911856 (Why is no real title available?)
- Studying Balanced Allocations with Differential Equations
- Power of \(d\) choices with simple tabulation
- On the power of choice for Boolean functions
- Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations
- Balanced allocations: a simple proof for the heavily loaded case
- Optimal ball recycling
- A generalization of multiple choice balls-into-bins: tight bounds
- scientific article; zbMATH DE number 247092 (Why is no real title available?)
- Parallel randomized load balancing: a lower bound for a more general model
- Orientability Thresholds for Random Hypergraphs
- Convergence of Achlioptas processes via differential equations with unique solutions
- The \((1 + {\beta})\)-choice process and weighted balls-into-bins
- Balanced Allocations: The Heavily Loaded Case
- Automata, Languages and Programming
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)
