Simplicial Reaction Networks and Dynamics on Graphs
Rachel Lawrence [2023]

Approximate counting, phase transitions and geometry of polynomials
Jingcheng Liu [2019]

Stochastic Local Search and the Lovasz Local Lemma
Fotios Iliopoulos [2019]

Random-cluster dynamics
Antonio Blanca-Pimentel [2016]

Counting and Correlation Decay in Spin Systems
Piyush Srivastava [2014]

Structural and Algorithmic Properties of Static and Mobile Random Geometric Graphs
Alexandre Stauffer [2011]

Mixing in Time and Space for Discrete Spin Systems
Dror Weitz [2004]

On Determinant-Based Algorithms for Counting Perfect Matching in Graphs
Steve S.-T. Chien [2003]

Embedddings of Finite Metrics
Anupam Gupta [2000]

Sampling from Gibbs Distributions
Eric Joseph Vigoda [1999]

On Approximating the Permanent and Other #P-Complete Problems
Lars E. Rasmussen [1998]

The Power of Two Choices in Randomized Load Balancing
Michael D. Mitzenmacher [1996]

Topics in Black-Box Combinatorial Optimization
Ari Juels [1996]

Counting in Lattices: Combinatorial Problems from Statistical Mechanics
Dana J. Randall [1994]