In the balanced allocations framework, there are m jobs (balls) to be
al...
We introduce a new class of balanced allocation processes which bias tow...
In balanced allocations, the goal is to place m balls into n bins, so as...
We consider the allocation of m balls (jobs) into n bins (servers). In
t...
We consider the allocation of m balls (jobs) into n bins (servers). In
t...
It is well known that if m balls (jobs) are placed sequentially into n
b...
We consider the allocation of m balls (jobs) into n bins (servers). In
t...
We study the repeated balls-into-bins process introduced by Becchetti,
C...
We consider the sequential allocation of m balls (jobs) into n bins
(ser...
We consider the problem of allocating m balls into n bins with incomplet...
Random walks on graphs are an essential primitive for many randomised
al...
A random walk is a basic stochastic process on graphs and a key primitiv...
We study the biased random walk where at each step of a random walk a
"c...
We apply the power-of-two-choices paradigm to random walk on a graph: ra...
We establish and generalise several bounds for various random walk quant...
We study two random processes on an n-vertex graph inspired by the inter...