Conductance and the Rapid Mixing Property for Markov Chains: the Approximation of the Permanent Resolved (Preliminary Version) - Mark Jerrum; Alistair Sinclair (STOC, 1988)

Approximating the Permanent. - Mark Jerrum; Alistair Sinclair (SIAM J. Comput., 1989)

Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains - Alistair Sinclair; Mark Jerrum (Inf. Comput., 1989)

Polynomial-Time Approximation Algorithms for Ising Model (Extended Abstract). - Mark Jerrum; Alistair Sinclair (ICALP, 1990)

Fast Uniform Generation of Regular Graphs. - Mark Jerrum; Alistair Sinclair (Theor. Comput. Sci., 1990)

Quadratic Dynamical Systems (Preliminary Version) - Yuri Rabinovich; Alistair Sinclair; Avi Wigderson (FOCS, 1992)

Improved Bounds for Mixing Rates of Marked Chains and Multicommodity Flow. - Alistair Sinclair (LATIN, 1992)

Improved Bounds for Mixing Rates of Marcov Chains and Multicommodity Flow. - Alistair Sinclair (Comb. Probab. Comput., 1992)

Algorithms for random generation and counting - a Markov chain approach. - Alistair Sinclair (Birkhäuser, 1993)

Matchings in lattice graphs. - Claire Kenyon; Dana Randall; Alistair Sinclair (STOC, 1993)

Optimal Speedup of Las Vegas Algorithms. - Michael Luby; Alistair Sinclair; David Zuckerman (Inf. Process. Lett., 1993)

Polynomial-Time Approximation Algorithms for the Ising Model. - Mark Jerrum; Alistair Sinclair (SIAM J. Comput., 1993)

Testable Algorithms for Self-Avoiding Walks. - Dana Randall; Alistair Sinclair (SODA, 1994)

Markov Chain Algorithms for Planar Lattice Structures (Extended Abstract). - Michael Luby; Dana Randall; Alistair Sinclair (FOCS, 1995)

Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing (Preliminary Version). - Claire Kenyon; Yuval Rabani; Alistair Sinclair (SODA, 1996)

Local Divergence of Markov Chains and the Analysis of Iterative Load Balancing Schemes. - Yuval Rabani; Alistair Sinclair; Rolf Wanka (FOCS, 1998)

Spatial Codes and the Hardness of String Folding Problems (Extended Abstract). - Ashwin Nayak 001; Alistair Sinclair; Uri Zwick (SODA, 1998)

Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing. - Claire Kenyon; Yuval Rabani; Alistair Sinclair (J. Algorithms, 1998)

A computational view of population genetics. - Yuval Rabani; Yuri Rabinovich; Alistair Sinclair (Random Struct. Algorithms, 1998)

Spatial Codes and the Hardness of String Folding Problems. - Ashwin Nayak 001; Alistair Sinclair; Uri Zwick (J. Comput. Biol., 1999)

A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. - Mark Jerrum; Alistair Sinclair; Eric Vigoda (STOC, 2001)

Markov Chain Algorithms for Planar Lattice Structures. - Michael Luby; Dana Randall; Alistair Sinclair (SIAM J. Comput., 2001)

The Ising Model on Trees: Boundary Conditions and Mixing Time. - Fabio Martinelli; Alistair Sinclair; Dror Weitz (FOCS, 2003)

Embedding k-outerplanar graphs into l1. - Chandra Chekuri; Anupam Gupta 001; Ilan Newman; Yuri Rabinovich; Alistair Sinclair (SODA, 2003)

Clifford algebras and approximating the permanent. - Steve Chien; Lars Eilstrup Rasmussen; Alistair Sinclair (J. Comput. Syst. Sci., 2003)

Finding Points on Curves over Finite Fields. - Joachim von zur Gathen; Igor E. Shparlinski; Alistair Sinclair (SIAM J. Comput., 2003)

Shuffling by Semi-Random Transpositions. - Elchanan Mossel; Yuval Peres; Alistair Sinclair (FOCS, 2004)

Cuts, Trees and l1-Embeddings of Graphs. - Anupam Gupta 001; Ilan Newman; Yuri Rabinovich; Alistair Sinclair (Comb., 2004)

A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. - Mark Jerrum; Alistair Sinclair; Eric Vigoda (J. ACM, 2004)

Mixing in time and space for lattice spin systems: A combinatorial view. - Martin E. Dyer; Alistair Sinclair; Eric Vigoda; Dror Weitz (Random Struct. Algorithms, 2004)

Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions. - Ben Morris; Alistair Sinclair (SIAM J. Comput., 2004)

A general lower bound for mixing of single-site dynamics on graphs. - Thomas P. Hayes; Alistair Sinclair (FOCS, 2005)

Embedding k-Outerplanar Graphs into l 1. - Chandra Chekuri; Anupam Gupta 001; Ilan Newman; Yuri Rabinovich; Alistair Sinclair (SIAM J. Discret. Math., 2006)

Fast mixing for independent sets, colorings, and other models on trees. - Fabio Martinelli; Alistair Sinclair; Dror Weitz (Random Struct. Algorithms, 2007)

Algebras with Polynomial Identities and Computing the Determinant. - Steve Chien; Alistair Sinclair (SIAM J. Comput., 2007)

On the satisfiability threshold and clustering of solutions of random 3-SAT formulas. - Elitza N. Maneva; Alistair Sinclair (Theor. Comput. Sci., 2008)

Strong and Pareto Price of Anarchy in Congestion Games. - Steve Chien; Alistair Sinclair (ICALP (1), 2009)

The extended k-tree algorithm. - Lorenz Minder; Alistair Sinclair (SODA, 2009)

Mixing time for the solid-on-solid model. - Fabio Martinelli; Alistair Sinclair (STOC, 2009)

Sherali-adams relaxations of the matching polytope. - Claire Mathieu; Alistair Sinclair (STOC, 2009)

Low Distortion Maps Between Point Sets. - Claire Kenyon; Yuval Rabani; Alistair Sinclair (SIAM J. Comput., 2009)

Liftings of Tree-Structured Markov Chains - (Extended Abstract). - Thomas P. Hayes; Alistair Sinclair (APPROX-RANDOM, 2010)

Mobile Geometric Graphs, and Detection and Communication Problems in Mobile Wireless Networks - Alistair Sinclair; Alexandre Stauffer (CoRR, 2010)

Mobile Geometric Graphs: Detection, Coverage and Percolation. - Yuval Peres; Alistair Sinclair; Perla Sousi; Alexandre Stauffer (SODA, 2011)

Almost settling the hardness of noncommutative determinant. - Steve Chien; Prahladh Harsha; Alistair Sinclair; Srikanth Srinivasan 001 (STOC, 2011)

Convergence to approximate Nash equilibria in congestion games. - Steve Chien; Alistair Sinclair (Games Econ. Behav., 2011)

Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs. - Alistair Sinclair; Piyush Srivastava 001; Marc Thurley (SODA, 2012)

Negative Examples for Sequential Importance Sampling of Binary Contingency Tables. - Ivona Bezáková; Alistair Sinclair; Daniel Stefankovic; Eric Vigoda (Algorithmica, 2012)

The Extended k-tree Algorithm. - Lorenz Minder; Alistair Sinclair (J. Cryptol., 2012)

Spatial Mixing and Approximation Algorithms for Graphs with Bounded Connective Constant. - Alistair Sinclair; Piyush Srivastava 001; Yitong Yin (FOCS, 2013)

Random lattice triangulations: structure and algorithms. - Pietro Caputo; Fabio Martinelli; Alistair Sinclair; Alexandre Stauffer (STOC, 2013)

Lee-Yang theorems and the complexity of computing averages. - Alistair Sinclair; Piyush Srivastava 001 (STOC, 2013)

Delaying satisfiability for random 2SAT. - Alistair Sinclair; Dan Vilenchik (Random Struct. Algorithms, 2013)

Dynamics for the Mean-field Random-cluster Model. - Antonio Blanca; Alistair Sinclair (APPROX-RANDOM, 2015)

Symbolic Integration and the Complexity of Computing Averages. - Leonard J. Schulman; Alistair Sinclair; Piyush Srivastava 001 (FOCS, 2015)

Spatial mixing and the connective constant: Optimal bounds. - Alistair Sinclair; Piyush Srivastava 001; Daniel Stefankovic; Yitong Yin (SODA, 2015)

Dynamics of Lattice Triangulations on Thin Rectangles. - Pietro Caputo; Fabio Martinelli; Alistair Sinclair; Alexandre Stauffer (CoRR, 2015)

Random-Cluster Dynamics in ℤ2. - Antonio Blanca; Alistair Sinclair (SODA, 2016)

The Ising Partition Function: Zeros and Deterministic Approximation. - Jingcheng Liu 001; Alistair Sinclair; Piyush Srivastava 001 (FOCS, 2017)

Analysis of a Classical Matrix Preconditioning Algorithm. - Leonard J. Schulman; Alistair Sinclair (J. ACM, 2017)

Spatial Mixing and Non-local Markov chains. - Antonio Blanca; Pietro Caputo; Alistair Sinclair; Eric Vigoda (SODA, 2018)

A New Perspective on Stochastic Local Search and the Lovasz Local Lemma. - Dimitris Achlioptas; Fotis Iliopoulos; Alistair Sinclair (CoRR, 2018)

A Deterministic Algorithm for Counting Colorings with 2-Delta Colors. - Jingcheng Liu 001; Alistair Sinclair; Piyush Srivastava 001 (FOCS, 2019)

Beyond the Lovász Local Lemma: Point to Set Correlations and Their Algorithmic Applications. - Dimitris Achlioptas; Fotis Iliopoulos; Alistair Sinclair (FOCS, 2019)

Fisher Zeros and Correlation Decay in the Ising Model. - Jingcheng Liu 001; Alistair Sinclair; Piyush Srivastava 001 (ITCS, 2019)

A deterministic algorithm for counting colorings with 2Δ colors. - Jingcheng Liu 001; Alistair Sinclair; Piyush Srivastava 001 (CoRR, 2019)

Spatial mixing and nonlocal Markov chains. - Antonio Blanca; Pietro Caputo; Alistair Sinclair; Eric Vigoda (Random Struct. Algorithms, 2019)

Entropy decay in the Swendsen-Wang dynamics on ℤd. - Antonio Blanca; Pietro Caputo; Daniel Parisi; Alistair Sinclair; Eric Vigoda (STOC, 2021)

Low-temperature Ising dynamics with random initializations. - Reza Gheissari; Alistair Sinclair (STOC, 2022)

The critical mean-field Chayes-Machta dynamics. - Antonio Blanca; Alistair Sinclair; Xusheng Zhang (Comb. Probab. Comput., 2022)

Efficiently list-edge coloring multigraphs asymptotically optimally. - Fotis Iliopoulos; Alistair Sinclair (Random Struct. Algorithms, 2022)

Nonlinear Dynamics for the Ising Model. - Pietro Caputo; Alistair Sinclair (STOC, 2024)

Diversity in Evolutionary Dynamics. - Yuval Rabani; Leonard J. Schulman; Alistair Sinclair (CoRR, 2024)

Spatial mixing and the random-cluster dynamics on lattices. - Reza Gheissari; Alistair Sinclair (Random Struct. Algorithms, 2024)

Diversity in Evolutionary Dynamics (Extended Abstract). - Yuval Rabani; Leonard J. Schulman; Alistair Sinclair (ITCS, 2025)