Alistair Sinclair

ORCID

Publication Activity (10 Years)

Years Active: 1987-2024
Publications (10 Years): 32

Top Venues

Publications

Yuval Rabani, Leonard J. Schulman, Alistair Sinclair
Diversity in Evolutionary Dynamics. CoRR (2024)
Reza Gheissari, Alistair Sinclair
Spatial mixing and the random-cluster dynamics on lattices. Random Struct. Algorithms 64 (2) (2024)
Pietro Caputo, Alistair Sinclair
Nonlinear Dynamics for the Ising Model. STOC (2024)
Reza Gheissari, Alistair Sinclair
Spatial mixing and the random-cluster dynamics on lattices. SODA (2023)
Reza Gheissari, Alistair Sinclair
Low-temperature Ising dynamics with random initializations. STOC (2022)
Antonio Blanca, Alistair Sinclair, Xusheng Zhang
The critical mean-field Chayes-Machta dynamics. Comb. Probab. Comput. 31 (6) (2022)
Fotis Iliopoulos, Alistair Sinclair
Efficiently list-edge coloring multigraphs asymptotically optimally. Random Struct. Algorithms 61 (4) (2022)
Antonio Blanca, Alistair Sinclair, Xusheng Zhang
The Critical Mean-Field Chayes-Machta Dynamics. APPROX-RANDOM (2021)
Antonio Blanca, Alistair Sinclair, Xusheng Zhang
The Critical Mean-field Chayes-Machta Dynamics. CoRR (2021)
Antonio Blanca, Pietro Caputo, Daniel Parisi, Alistair Sinclair, Eric Vigoda
. STOC (2021)
Fotis Iliopoulos, Alistair Sinclair
Efficiently list-edge coloring multigraphs asymptotically optimally. SODA (2020)
Jingcheng Liu, Alistair Sinclair, Piyush Srivastava
A Deterministic Algorithm for Counting Colorings with 2-Delta Colors. FOCS (2019)
Antonio Blanca, Pietro Caputo, Alistair Sinclair, Eric Vigoda
Spatial mixing and nonlocal Markov chains. Random Struct. Algorithms 55 (3) (2019)
Jingcheng Liu, Alistair Sinclair, Piyush Srivastava
Fisher Zeros and Correlation Decay in the Ising Model. ITCS (2019)
Jingcheng Liu, Alistair Sinclair, Piyush Srivastava
A deterministic algorithm for counting colorings with 2Δ colors. CoRR (2019)
Dimitris Achlioptas, Fotis Iliopoulos, Alistair Sinclair
Beyond the Lovász Local Lemma: Point to Set Correlations and Their Algorithmic Applications. FOCS (2019)
Antonio Blanca, Pietro Caputo, Alistair Sinclair, Eric Vigoda
Spatial Mixing and Non-local Markov chains. SODA (2018)
Jingcheng Liu, Alistair Sinclair, Piyush Srivastava
Fisher zeros and correlation decay in the Ising model. CoRR (2018)
Dimitris Achlioptas, Fotis Iliopoulos, Alistair Sinclair
A New Perspective on Stochastic Local Search and the Lovasz Local Lemma. CoRR (2018)
Fotis Iliopoulos, Alistair Sinclair
Efficiently list-edge coloring multigraphs asymptotically optimally. CoRR (2018)
Jingcheng Liu, Alistair Sinclair, Piyush Srivastava
The Ising Partition Function: Zeros and Deterministic Approximation. FOCS (2017)
Jingcheng Liu, Alistair Sinclair, Piyush Srivastava
The Ising Partition Function: Zeros and Deterministic Approximation. CoRR (2017)
Leonard J. Schulman, Alistair Sinclair
Analysis of a Classical Matrix Preconditioning Algorithm. J. ACM 64 (2) (2017)
Antonio Blanca, Pietro Caputo, Alistair Sinclair, Eric Vigoda
Spatial Mixing and Non-local Markov chains. CoRR (2017)
Antonio Blanca, Alistair Sinclair
. SODA (2016)
Antonio Blanca, Alistair Sinclair
Dynamics for the Mean-field Random-cluster Model. APPROX-RANDOM (2015)
Leonard J. Schulman, Alistair Sinclair, Piyush Srivastava
Symbolic Integration and the Complexity of Computing Averages. FOCS (2015)
Alistair Sinclair, Piyush Srivastava, Daniel Stefankovic, Yitong Yin
Spatial mixing and the connective constant: Optimal bounds. SODA (2015)
Leonard J. Schulman, Alistair Sinclair
Analysis of a Classical Matrix Preconditioning Algorithm. STOC (2015)
Antonio Blanca, Alistair Sinclair
. CoRR (2015)
Leonard J. Schulman, Alistair Sinclair
Analysis of a Classical Matrix Preconditioning Algorithm. CoRR (2015)
Pietro Caputo, Fabio Martinelli, Alistair Sinclair, Alexandre Stauffer
Dynamics of Lattice Triangulations on Thin Rectangles. CoRR (2015)
Alistair Sinclair, Piyush Srivastava, Daniel Stefankovic, Yitong Yin
Spatial mixing and the connective constant: Optimal bounds. CoRR (2014)
Pietro Caputo, Fabio Martinelli, Alistair Sinclair, Alexandre Stauffer
Random lattice triangulations: structure and algorithms. STOC (2013)
Alistair Sinclair, Dan Vilenchik
Delaying satisfiability for random 2SAT. Random Struct. Algorithms 43 (2) (2013)
Alistair Sinclair, Piyush Srivastava, Yitong Yin
Spatial mixing and approximation algorithms for graphs with bounded connective constant. CoRR (2013)
Alistair Sinclair, Piyush Srivastava, Yitong Yin
Spatial Mixing and Approximation Algorithms for Graphs with Bounded Connective Constant. FOCS (2013)
Alistair Sinclair, Piyush Srivastava
Lee-Yang theorems and the complexity of computing averages. STOC (2013)
Lorenz Minder, Alistair Sinclair
The Extended k-tree Algorithm. J. Cryptol. 25 (2) (2012)
Alistair Sinclair, Piyush Srivastava
Lee-Yang theorems and the complexity of computing averages CoRR (2012)
Ivona Bezáková, Alistair Sinclair, Daniel Stefankovic, Eric Vigoda
Negative Examples for Sequential Importance Sampling of Binary Contingency Tables. Algorithmica 64 (4) (2012)
Alistair Sinclair, Piyush Srivastava, Marc Thurley
Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs. SODA (2012)
Steve Chien, Alistair Sinclair
Convergence to approximate Nash equilibria in congestion games. Games Econ. Behav. 71 (2) (2011)
Steve Chien, Prahladh Harsha, Alistair Sinclair, Srikanth Srinivasan
Almost Settling the Hardness of Noncommutative Determinant CoRR (2011)
Alistair Sinclair, Piyush Srivastava, Marc Thurley
Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs CoRR (2011)
Steve Chien, Prahladh Harsha, Alistair Sinclair, Srikanth Srinivasan
Almost settling the hardness of noncommutative determinant. STOC (2011)
Yuval Peres, Alistair Sinclair, Perla Sousi, Alexandre Stauffer
Mobile Geometric Graphs: Detection, Coverage and Percolation. SODA (2011)
Fabio Martinelli, Alistair Sinclair
Mixing Time for the Solid-on-Solid Model CoRR (2010)
Alistair Sinclair, Alexandre Stauffer
Mobile Geometric Graphs, and Detection and Communication Problems in Mobile Wireless Networks CoRR (2010)
Thomas P. Hayes, Alistair Sinclair
Liftings of Tree-Structured Markov Chains - (Extended Abstract). APPROX-RANDOM (2010)
Yuval Peres, Alistair Sinclair, Perla Sousi, Alexandre Stauffer
Mobile Geometric Graphs: Detection, Coverage and Percolation CoRR (2010)
Alistair Sinclair, Dan Vilenchik
Delaying Satisfiability for Random 2SAT. APPROX-RANDOM (2010)
Claire Mathieu, Alistair Sinclair
Sherali-adams relaxations of the matching polytope. STOC (2009)
Lorenz Minder, Alistair Sinclair
-tree algorithm. SODA (2009)
Steve Chien, Alistair Sinclair
Strong and Pareto Price of Anarchy in Congestion Games. ICALP (1) (2009)
Fabio Martinelli, Alistair Sinclair
Mixing time for the solid-on-solid model. STOC (2009)
Claire Kenyon, Yuval Rabani, Alistair Sinclair
Low Distortion Maps Between Point Sets. SIAM J. Comput. 39 (4) (2009)
Elitza N. Maneva, Alistair Sinclair
On the satisfiability threshold and clustering of solutions of random 3-SAT formulas. Theor. Comput. Sci. 407 (1-3) (2008)
Steve Chien, Alistair Sinclair
Convergence to approximate Nash equilibria in congestion games. SODA (2007)
Elitza N. Maneva, Alistair Sinclair
On the Satisfiability Threshold and Clustering of Solutions of Random 3-SAT Formulas CoRR (2007)
Steve Chien, Alistair Sinclair
Algebras with Polynomial Identities and Computing the Determinant. SIAM J. Comput. 37 (1) (2007)
Fabio Martinelli, Alistair Sinclair, Dror Weitz
Fast mixing for independent sets, colorings, and other models on trees. Random Struct. Algorithms 31 (2) (2007)
Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair
. SIAM J. Discret. Math. 20 (1) (2006)
Ivona Bezáková, Alistair Sinclair, Daniel Stefankovic, Eric Vigoda
Negative Examples for Sequential Importance Sampling of Binary Contingency Tables. ESA (2006)
Thomas P. Hayes, Alistair Sinclair
A general lower bound for mixing of single-site dynamics on graphs. FOCS (2005)
Martin E. Dyer, Alistair Sinclair, Eric Vigoda, Dror Weitz
Mixing in time and space for lattice spin systems: A combinatorial view. Random Struct. Algorithms 24 (4) (2004)
Mark Jerrum, Alistair Sinclair, Eric Vigoda
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. J. ACM 51 (4) (2004)
Fabio Martinelli, Alistair Sinclair, Dror Weitz
Fast mixing for independent sets, colorings and other models on trees. SODA (2004)
Claire Kenyon, Yuval Rabani, Alistair Sinclair
Low distortion maps between point sets. STOC (2004)
Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair
-Embeddings of Graphs. Comb. 24 (2) (2004)
Elchanan Mossel, Yuval Peres, Alistair Sinclair
Shuffling by Semi-Random Transpositions. FOCS (2004)
Ben Morris, Alistair Sinclair
Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions. SIAM J. Comput. 34 (1) (2004)
Steve Chien, Alistair Sinclair
Algebras with Polynomial Identities and Computing the Determinant. FOCS (2004)
Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair
Embedding k-outerplanar graphs into l1. SODA (2003)
Steve Chien, Lars Eilstrup Rasmussen, Alistair Sinclair
Clifford algebras and approximating the permanent. J. Comput. Syst. Sci. 67 (2) (2003)
Joachim von zur Gathen, Igor E. Shparlinski, Alistair Sinclair
Finding Points on Curves over Finite Fields. SIAM J. Comput. 32 (6) (2003)
Fabio Martinelli, Alistair Sinclair, Dror Weitz
The Ising Model on Trees: Boundary Conditions and Mixing Time. FOCS (2003)
Steve Chien, Lars Eilstrup Rasmussen, Alistair Sinclair
Clifford algebras and approximating the permanent. STOC (2002)
Martin E. Dyer, Alistair Sinclair, Eric Vigoda, Dror Weitz
Mixing in Time and Space for Lattice Spin Systems: A Combinatorial View. RANDOM (2002)
Mark Jerrum, Alistair Sinclair, Eric Vigoda
A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. STOC (2001)
Michael Luby, Dana Randall, Alistair Sinclair
Markov Chain Algorithms for Planar Lattice Structures. SIAM J. Comput. 31 (1) (2001)
Ashwin Nayak, Alistair Sinclair, Uri Zwick
Spatial Codes and the Hardness of String Folding Problems. J. Comput. Biol. 6 (1) (1999)
Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair
-Embeddings of Graphs. FOCS (1999)
Ben Morris, Alistair Sinclair
Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions. FOCS (1999)
Yuval Rabani, Alistair Sinclair, Rolf Wanka
Local Divergence of Markov Chains and the Analysis of Iterative Load Balancing Schemes. FOCS (1998)
Claire Kenyon, Yuval Rabani, Alistair Sinclair
Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing. J. Algorithms 27 (2) (1998)
Yuval Rabani, Yuri Rabinovich, Alistair Sinclair
A computational view of population genetics. Random Struct. Algorithms 12 (4) (1998)
Ashwin Nayak, Alistair Sinclair, Uri Zwick
Spatial Codes and the Hardness of String Folding Problems (Extended Abstract). SODA (1998)
Claire Kenyon, Yuval Rabani, Alistair Sinclair
Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing (Preliminary Version). SODA (1996)
Michael Luby, Dana Randall, Alistair Sinclair
Markov Chain Algorithms for Planar Lattice Structures (Extended Abstract). FOCS (1995)
Yuval Rabani, Yuri Rabinovich, Alistair Sinclair
A computational view of population genetics. STOC (1995)
Dana Randall, Alistair Sinclair
Testable Algorithms for Self-Avoiding Walks. SODA (1994)
Claire Kenyon, Dana Randall, Alistair Sinclair
Matchings in lattice graphs. STOC (1993)
Mark Jerrum, Alistair Sinclair
Polynomial-Time Approximation Algorithms for the Ising Model. SIAM J. Comput. 22 (5) (1993)
Michael Luby, Alistair Sinclair, David Zuckerman
Optimal Speedup of Las Vegas Algorithms. ISTCS (1993)
Michael Luby, Alistair Sinclair, David Zuckerman
Optimal Speedup of Las Vegas Algorithms. Inf. Process. Lett. 47 (4) (1993)
Alistair Sinclair
Improved Bounds for Mixing Rates of Marked Chains and Multicommodity Flow. LATIN (1992)
Alistair Sinclair
Improved Bounds for Mixing Rates of Marcov Chains and Multicommodity Flow. Comb. Probab. Comput. 1 (1992)
Yuri Rabinovich, Alistair Sinclair, Avi Wigderson
Quadratic Dynamical Systems (Preliminary Version) FOCS (1992)
Mark Jerrum, Alistair Sinclair
Polynomial-Time Approximation Algorithms for Ising Model (Extended Abstract). ICALP (1990)

Alistair Sinclair.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Alistair Sinclair