The following pages link to Balanced Allocations (Q4268876):
Displaying 50 items.
- Efficient set intersection with simulation-based security (Q271588) (← links)
- Tight bounds for parallel randomized load balancing (Q287991) (← links)
- Decentralized list scheduling (Q367649) (← links)
- Decay of tails at equilibrium for FIFO join the shortest queue networks (Q373835) (← links)
- Asymptotic independence of queues under randomized load balancing (Q383265) (← links)
- Balls into bins with related random choices (Q433413) (← links)
- Efficient set operations in the presence of malicious adversaries (Q434343) (← links)
- Revisiting randomized parallel load balancing algorithms (Q442270) (← links)
- Chains-into-bins processes (Q450541) (← links)
- Balanced allocation: memory performance tradeoffs (Q453251) (← links)
- A novel robust on-line protocol for load-balancing in structured peer-to-peer systems (Q455942) (← links)
- A mean field model for a class of garbage collection algorithms in flash-based solid state drives (Q475106) (← links)
- A generalization of multiple choice balls-into-bins: tight bounds (Q524374) (← links)
- Parallel randomized load balancing: a lower bound for a more general model (Q533886) (← links)
- An improved version of cuckoo hashing: average case analysis of construction cost and search operations (Q626960) (← links)
- Stability of join the shortest queue networks (Q640066) (← links)
- Layered hashing algorithm for real-time systems (Q692912) (← links)
- A geometric Achlioptas process (Q894807) (← links)
- The power of choice in growing trees (Q978747) (← links)
- Choice-memory tradeoff in allocations (Q990388) (← links)
- Cuckoo hashing: Further analysis (Q1007604) (← links)
- On the \(k\)-orientability of random graphs (Q1024456) (← links)
- Random allocation of jobs with weights and precedence (Q1365938) (← links)
- Self-stabilizing repeated balls-into-bins (Q1733393) (← links)
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs (Q1753171) (← links)
- Cascade equilibrium strategies in a two-server queueing system with inspection cost (Q1754279) (← links)
- Testing hypergraph colorability (Q1770424) (← links)
- Self-stabilizing balls and bins in batches. The power of leaky bins (Q1799218) (← links)
- On the drift of short schedules. (Q1853539) (← links)
- The CNN problem and other \(k\)-server variants (Q1887095) (← links)
- Throughput and delay optimality of power-of-\(d\) choices in inhomogeneous load balancing systems (Q2060617) (← links)
- The power of thinning in balanced allocation (Q2064870) (← links)
- Range minimum queries in minimal space (Q2078612) (← links)
- Singletons for simpletons revisiting windowed backoff with Chernoff bounds (Q2078614) (← links)
- Group service system with three queues and load balancing (Q2081002) (← links)
- Power-of-two sampling in redundancy systems: the impact of assignment constraints (Q2102840) (← links)
- Dynamic averaging load balancing on cycles (Q2118388) (← links)
- A lower bound on the queueing delay in resource constrained load balancing (Q2192743) (← links)
- Thresholds for extreme orientability (Q2249738) (← links)
- Load balancing under \(d\)-thinning (Q2285765) (← links)
- Balanced routing of random calls (Q2346072) (← links)
- D2B: A de Bruijn based content-addressable network (Q2368967) (← links)
- Balanced allocation and dictionaries with tightly packed constant size bins (Q2373735) (← links)
- Practical load balancing for content requests in peer-to-peer networks (Q2375306) (← links)
- Fast flooding over Manhattan (Q2375821) (← links)
- On weighted balls-into-bins games (Q2378532) (← links)
- The power of online thinning in reducing discrepancy (Q2416548) (← links)
- Analysis of randomized protocols for conflict-free distributed access (Q2461541) (← links)
- On the power of two choices: balls and bins in continuous time (Q2572391) (← links)
- New techniques and tighter bounds for local computation algorithms (Q2628795) (← links)
