scientific article; zbMATH DE number 1857645
From MaRDI portal
Publication:4788604
zbMath1056.68166MaRDI QIDQ4788604
Ramesh K. Sitaraman, Michael Mitzenmacher, Andréa W. Richa
Publication date: 2 June 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Tight bounds for parallel randomized load balancing ⋮ Serving in the Dark should be done Non-Uniformly ⋮ Balanced allocation and dictionaries with tightly packed constant size bins ⋮ Analysis of large urn models with local mean-field interactions ⋮ On weighted balls-into-bins games ⋮ Impartial Selection and the Power of up to Two Choices ⋮ On a doubly dynamically controlled supermarket model with impatient customers ⋮ Near equilibrium fluctuations for supermarket models with growing choices ⋮ The loss of serving in the dark ⋮ A geometric Achlioptas process ⋮ Generalized cuckoo hashing with a stash, revisited ⋮ Dynamic local searchable symmetric encryption ⋮ Power of \(k\) choices in the semi-random graph process ⋮ Long-term balanced allocation via thinning ⋮ Balanced allocation on hypergraphs ⋮ Cuckoo hashing in cryptography: optimal parameters, robustness and applications ⋮ Unnamed Item ⋮ Given enough choice, simple local rules percolate discontinuously ⋮ The Power of Filling in Balanced Allocations ⋮ Sparse Semi-Oblivious Routing: Few Random Paths Suffice ⋮ Orientability Thresholds for Random Hypergraphs ⋮ Balls into bins with related random choices ⋮ Chains-into-bins processes ⋮ Balanced allocation: memory performance tradeoffs ⋮ Airplane boarding meets express line queues ⋮ The cook-book approach to the differential equation method ⋮ A mean field model for a class of garbage collection algorithms in flash-based solid state drives ⋮ The mean-field computation in a supermarket model with server multiple vacations ⋮ Chains-into-Bins Processes ⋮ Block-structured supermarket models ⋮ Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations ⋮ Balanced allocation on dynamic hypergraphs ⋮ The supermarket model with bounded queue lengths in equilibrium ⋮ On the maximum queue length in the supermarket model ⋮ Approximation schemes for scheduling and covering on unrelated machines ⋮ Choice-memory tradeoff in allocations ⋮ Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses ⋮ Dynamic routing in a distributed parallel many-server service system: the effect of \(\xi \)-choice ⋮ Cuckoo hashing: Further analysis ⋮ Randomization helps to perform independent tasks reliably ⋮ Balanced Allocation on Graphs: A Random Walk Approach ⋮ On the \(k\)-orientability of random graphs ⋮ The power of thinning in balanced allocation ⋮ Singletons for simpletons revisiting windowed backoff with Chernoff bounds ⋮ Group service system with three queues and load balancing ⋮ On the power of two choices: balls and bins in continuous time ⋮ Interval fragmentations with choice: equidistribution and the evolution of tagged fragments ⋮ Balanced routing of random calls ⋮ Unnamed Item ⋮ Dynamic averaging load balancing on cycles
This page was built for publication:
