The following pages link to (Q4788604):
Displaying 47 items.
- Tight bounds for parallel randomized load balancing (Q287991) (← links)
- On a doubly dynamically controlled supermarket model with impatient customers (Q337408) (← links)
- Balls into bins with related random choices (Q433413) (← links)
- Chains-into-bins processes (Q450541) (← links)
- Balanced allocation: memory performance tradeoffs (Q453251) (← links)
- The cook-book approach to the differential equation method (Q465658) (← links)
- A mean field model for a class of garbage collection algorithms in flash-based solid state drives (Q475106) (← links)
- The mean-field computation in a supermarket model with server multiple vacations (Q481355) (← links)
- Block-structured supermarket models (Q503021) (← links)
- A geometric Achlioptas process (Q894807) (← links)
- Choice-memory tradeoff in allocations (Q990388) (← links)
- Cuckoo hashing: Further analysis (Q1007604) (← links)
- On the \(k\)-orientability of random graphs (Q1024456) (← links)
- Airplane boarding meets express line queues (Q1719647) (← links)
- The supermarket model with bounded queue lengths in equilibrium (Q1756560) (← links)
- Dynamic routing in a distributed parallel many-server service system: the effect of \(\xi \)-choice (Q2031092) (← links)
- The power of thinning in balanced allocation (Q2064870) (← links)
- Singletons for simpletons revisiting windowed backoff with Chernoff bounds (Q2078614) (← links)
- Group service system with three queues and load balancing (Q2081002) (← links)
- Interval fragmentations with choice: equidistribution and the evolution of tagged fragments (Q2094574) (← links)
- Dynamic averaging load balancing on cycles (Q2118388) (← links)
- Near equilibrium fluctuations for supermarket models with growing choices (Q2170372) (← links)
- Balanced routing of random calls (Q2346072) (← links)
- Balanced allocation and dictionaries with tightly packed constant size bins (Q2373735) (← links)
- On weighted balls-into-bins games (Q2378532) (← links)
- On the maximum queue length in the supermarket model (Q2496955) (← links)
- Approximation schemes for scheduling and covering on unrelated machines (Q2503309) (← links)
- On the power of two choices: balls and bins in continuous time (Q2572391) (← links)
- Analysis of large urn models with local mean-field interactions (Q2631872) (← links)
- The loss of serving in the dark (Q2680226) (← links)
- Generalized cuckoo hashing with a stash, revisited (Q2681400) (← links)
- Balanced Allocation on Graphs: A Random Walk Approach (Q2817876) (← links)
- Chains-into-Bins Processes (Q3000519) (← links)
- Serving in the Dark should be done Non-Uniformly (Q3448776) (← links)
- Impartial Selection and the Power of up to Two Choices (Q3460784) (← links)
- Randomization helps to perform independent tasks reliably (Q4446875) (← links)
- Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses (Q4687247) (← links)
- (Q5002669) (← links)
- Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations (Q5157397) (← links)
- (Q5168850) (← links)
- Orientability Thresholds for Random Hypergraphs (Q5364256) (← links)
- Balanced allocation on dynamic hypergraphs (Q6084354) (← links)
- Power of \(k\) choices in the semi-random graph process (Q6117415) (← links)
- Long-term balanced allocation via thinning (Q6126120) (← links)
- Balanced allocation on hypergraphs (Q6133644) (← links)
- Given enough choice, simple local rules percolate discontinuously (Q6176887) (← links)
- The Power of Filling in Balanced Allocations (Q6188516) (← links)
