Mixing of random walks and other diffusions on a graph

Chip-Firing and the Critical Group of a Graph

Journal of Algebraic Combinatorics: An International Journal

The Tutte Polynomial as a Growth Function

Journal of Algebraic Combinatorics: An International Journal

Algorithmic Aspects of a Chip-Firing Game

Combinatorics, Probability and Computing

Reversal of Markov Chains and the Forget Time

Combinatorics, Probability and Computing

Efficiency and nash equilibria in a scrip system for P2P networks

EC '06 Proceedings of the 7th ACM conference on Electronic commerce

Sandpile transience on the grid is polynomially bounded

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms

The evolution of the mixing rate of a simple random walk on the giant component of a random graph

Random Structures & Algorithms

Dobrushin conditions and systematic scan

Combinatorics, Probability and Computing

Near-perfect load balancing by randomized rounding

Proceedings of the forty-first annual ACM symposium on Theory of computing

Biased random walks on resource network graphs for load balancing

The Journal of Supercomputing

Discrete load balancing is (almost) as easy as continuous load balancing

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing

Exit frequency matrices for finite markov chains

Combinatorics, Probability and Computing

Quasirandom load balancing

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms

Randomized diffusion for indivisible loads

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms

Dobrushin conditions and systematic scan

APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation

Control of limit states in absorbing resource networks

Automation and Remote Control