Correlation Decay and Partition Function Zeros: Algorithms and Phase Transitions.

Alistair Sinclair University of California, Berkeley, USA Gödel Prize http://www.cs.berkeley.edu/~sinclair/ https://dl.acm.org/profile/81100095026 https://zbmath.org/authors/?q=ai:sinclair.alistair https://mathscinet.ams.org/mathscinet/MRAuthorID/162735 https://mathgenealogy.org/id.php?id=24930 https://en.wikipedia.org/wiki/Alistair_Sinclair https://www.wikidata.org/entity/Q4306813 https://id.loc.gov/authorities/names/n92099861 https://d-nb.info/gnd/172600251 https://orcid.org/0009-0002-9210-268X

Jingcheng Liu 0001 Alistair Sinclair Piyush Srivastava 0001 Correlation Decay and Partition Function Zeros: Algorithms and Phase Transitions. S19-200 2025 54 SIAM J. Comput. 4 https://doi.org/10.1137/20m1317384 db/journals/siamcomp/siamcomp54.html#LiuSS25 streams/journals/siamcomp

Yuval Rabani Leonard J. Schulman Alistair Sinclair Diversity in Evolutionary Dynamics (Extended Abstract). 80:1-80:3 2025 ITCS https://doi.org/10.4230/LIPIcs.ITCS.2025.80 conf/innovations/2025 db/conf/innovations/innovations2025.html#RabaniSS25

Joao Basso Shirshendu Ganguly Alistair Sinclair Nikhil Srivastava Zachary Stier Thuy-Duong Vuong On quantum to classical comparison for Davies generators. 2025 October abs/2510.07267 CoRR https://doi.org/10.48550/arXiv.2510.07267 db/journals/corr/corr2510.html#abs-2510-07267 streams/journals/corr

Reza Gheissari Alistair Sinclair Spatial mixing and the random-cluster dynamics on lattices. 490-534 2024 March 64 Random Struct. Algorithms 2 https://doi.org/10.1002/rsa.21191 db/journals/rsa/rsa64.html#GheissariS24

Pietro Caputo Alistair Sinclair Nonlinear Dynamics for the Ising Model. 515-526 2024 STOC https://doi.org/10.1145/3618260.3649759 conf/stoc/2024 db/conf/stoc/stoc2024.html#CaputoS24

Yuval Rabani Leonard J. Schulman Alistair Sinclair Diversity in Evolutionary Dynamics. 2024 abs/2406.03938 CoRR https://doi.org/10.48550/arXiv.2406.03938 db/journals/corr/corr2406.html#abs-2406-03938 streams/journals/corr

Reza Gheissari Alistair Sinclair Spatial mixing and the random-cluster dynamics on lattices. 4606-4621 2023 SODA https://doi.org/10.1137/1.9781611977554.ch174 conf/soda/2023 db/conf/soda/soda2023.html#GheissariS23

Antonio Blanca Alistair Sinclair Xusheng Zhang The critical mean-field Chayes-Machta dynamics. 924-975 2022 31 Comb. Probab. Comput. 6 https://doi.org/10.1017/S0963548322000037 db/journals/cpc/cpc31.html#BlancaSZ22

Fotis Iliopoulos Alistair Sinclair Efficiently list-edge coloring multigraphs asymptotically optimally. 724-753 2022 61 Random Struct. Algorithms 4 https://doi.org/10.1002/rsa.21074 db/journals/rsa/rsa61.html#IliopoulosS22

Reza Gheissari Alistair Sinclair Low-temperature Ising dynamics with random initializations. 1445-1458 2022 STOC https://doi.org/10.1145/3519935.3519964 conf/stoc/2022 db/conf/stoc/stoc2022.html#GheissariS22 Antonio Blanca Alistair Sinclair Xusheng Zhang The Critical Mean-Field Chayes-Machta Dynamics. 47:1-47:15 2021 APPROX-RANDOM https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.47 conf/approx/2021 db/conf/approx/approx2021.html#BlancaSZ21 Antonio Blanca Pietro Caputo Daniel Parisi Alistair Sinclair Eric Vigoda Entropy decay in the Swendsen-Wang dynamics on ℤd. 1551-1564 2021 STOC https://doi.org/10.1145/3406325.3451095 conf/stoc/2021 db/conf/stoc/stoc2021.html#BlancaCPSV21

Antonio Blanca Alistair Sinclair Xusheng Zhang The Critical Mean-field Chayes-Machta Dynamics. 2021 abs/2102.03004 CoRR https://arxiv.org/abs/2102.03004 db/journals/corr/corr2102.html#abs-2102-03004

Fotis Iliopoulos Alistair Sinclair Efficiently list-edge coloring multigraphs asymptotically optimally. 2319-2336 2020 SODA https://doi.org/10.1137/1.9781611975994.142 conf/soda/2020 db/conf/soda/soda2020.html#IliopoulosS20

Antonio Blanca Pietro Caputo Alistair Sinclair Eric Vigoda Spatial mixing and nonlocal Markov chains. 584-614 2019 55 Random Struct. Algorithms 3 https://doi.org/10.1002/rsa.20844 https://www.wikidata.org/entity/Q128300357 db/journals/rsa/rsa55.html#BlancaCSV19

Dimitris Achlioptas Fotis Iliopoulos Alistair Sinclair Beyond the Lovász Local Lemma: Point to Set Correlations and Their Algorithmic Applications. 725-744 2019 FOCS https://doi.org/10.1109/FOCS.2019.00049 conf/focs/2019 db/conf/focs/focs2019.html#AchlioptasIS19 Jingcheng Liu 0001 Alistair Sinclair Piyush Srivastava 0001 A Deterministic Algorithm for Counting Colorings with 2-Delta Colors. 1380-1404 2019 FOCS https://doi.org/10.1109/FOCS.2019.00085 conf/focs/2019 db/conf/focs/focs2019.html#0001SS19 Jingcheng Liu 0001 Alistair Sinclair Piyush Srivastava 0001 Fisher Zeros and Correlation Decay in the Ising Model. 55:1-55:8 2019 ITCS https://doi.org/10.4230/LIPIcs.ITCS.2019.55 conf/innovations/2019 db/conf/innovations/innovations2019.html#0001SS19a

Jingcheng Liu 0001 Alistair Sinclair Piyush Srivastava 0001 A deterministic algorithm for counting colorings with 2Δ colors. 2019 abs/1906.01228 CoRR http://arxiv.org/abs/1906.01228 db/journals/corr/corr1906.html#abs-1906-01228

Antonio Blanca Pietro Caputo Alistair Sinclair Eric Vigoda Spatial Mixing and Non-local Markov chains. 1965-1980 2018 SODA https://doi.org/10.1137/1.9781611975031.128 conf/soda/2018 db/conf/soda/soda2018.html#BlancaCSV18

Dimitris Achlioptas Fotis Iliopoulos Alistair Sinclair A New Perspective on Stochastic Local Search and the Lovasz Local Lemma. 2018 abs/1805.02026 CoRR http://arxiv.org/abs/1805.02026 db/journals/corr/corr1805.html#abs-1805-02026

Jingcheng Liu 0001 Alistair Sinclair Piyush Srivastava 0001 Fisher zeros and correlation decay in the Ising model. 2018 abs/1807.06577 CoRR http://arxiv.org/abs/1807.06577 db/journals/corr/corr1807.html#abs-1807-06577

Fotis Iliopoulos Alistair Sinclair Efficiently list-edge coloring multigraphs asymptotically optimally. 2018 abs/1812.10309 CoRR http://arxiv.org/abs/1812.10309 db/journals/corr/corr1812.html#abs-1812-10309

Leonard J. Schulman Alistair Sinclair Analysis of a Classical Matrix Preconditioning Algorithm. 9:1-9:23 2017 64 J. ACM 2 https://doi.org/10.1145/2988227 db/journals/jacm/jacm64.html#SchulmanS17

Jingcheng Liu 0001 Alistair Sinclair Piyush Srivastava 0001 The Ising Partition Function: Zeros and Deterministic Approximation. 986-997 2017 FOCS https://doi.org/10.1109/FOCS.2017.95 https://doi.ieeecomputersociety.org/10.1109/FOCS.2017.95 conf/focs/2017 db/conf/focs/focs2017.html#0001SS17

Jingcheng Liu 0001 Alistair Sinclair Piyush Srivastava 0001 The Ising Partition Function: Zeros and Deterministic Approximation. 2017 abs/1704.06493 CoRR http://arxiv.org/abs/1704.06493 db/journals/corr/corr1704.html#LiuSS17

Antonio Blanca Pietro Caputo Alistair Sinclair Eric Vigoda Spatial Mixing and Non-local Markov chains. 2017 abs/1708.01513 CoRR http://arxiv.org/abs/1708.01513 db/journals/corr/corr1708.html#abs-1708-01513

Antonio Blanca Alistair Sinclair Random-Cluster Dynamics in ℤ2. 498-513 2016 SODA https://doi.org/10.1137/1.9781611974331.ch37 http://dl.acm.org/citation.cfm?id=2884472 conf/soda/2016 db/conf/soda/soda2016.html#BlancaS16 Antonio Blanca Alistair Sinclair Dynamics for the Mean-field Random-cluster Model. 528-543 2015 APPROX-RANDOM https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.528 conf/approx/2015 db/conf/approx/approx2015.html#BlancaS15 Leonard J. Schulman Alistair Sinclair Piyush Srivastava 0001 Symbolic Integration and the Complexity of Computing Averages. 1231-1245 2015 FOCS https://doi.org/10.1109/FOCS.2015.79 https://doi.ieeecomputersociety.org/10.1109/FOCS.2015.79 conf/focs/2015 db/conf/focs/focs2015.html#SchulmanSS15 Alistair Sinclair Piyush Srivastava 0001 Daniel Stefankovic Yitong Yin Spatial mixing and the connective constant: Optimal bounds. 1549-1563 2015 SODA https://doi.org/10.1137/1.9781611973730.102 conf/soda/2015 db/conf/soda/soda2015.html#SinclairSSY15 Leonard J. Schulman Alistair Sinclair Analysis of a Classical Matrix Preconditioning Algorithm. 831-840 2015 STOC https://doi.org/10.1145/2746539.2746556 https://www.wikidata.org/entity/Q130995519 conf/stoc/2015 db/conf/stoc/stoc2015.html#SchulmanS15

Leonard J. Schulman Alistair Sinclair Analysis of a Classical Matrix Preconditioning Algorithm. 2015 abs/1504.03026 CoRR http://arxiv.org/abs/1504.03026 db/journals/corr/corr1504.html#SchulmanS15

Pietro Caputo Fabio Martinelli Alistair Sinclair Alexandre Stauffer Dynamics of Lattice Triangulations on Thin Rectangles. 2015 abs/1505.06161 CoRR http://arxiv.org/abs/1505.06161 db/journals/corr/corr1505.html#CaputoMSS15

Antonio Blanca Alistair Sinclair Random-Cluster Dynamics in ℤ2. 2015 abs/1510.06762 CoRR http://arxiv.org/abs/1510.06762 db/journals/corr/corr1510.html#BlancaS15

Alistair Sinclair Piyush Srivastava 0001 Daniel Stefankovic Yitong Yin Spatial mixing and the connective constant: Optimal bounds. 2014 abs/1410.2595 CoRR http://arxiv.org/abs/1410.2595 db/journals/corr/corr1410.html#SinclairSSY14

Alistair Sinclair Dan Vilenchik Delaying satisfiability for random 2SAT. 251-263 2013 43 Random Struct. Algorithms 2 https://doi.org/10.1002/rsa.20465 db/journals/rsa/rsa43.html#SinclairV13

Alistair Sinclair Piyush Srivastava 0001 Yitong Yin Spatial Mixing and Approximation Algorithms for Graphs with Bounded Connective Constant. 300-309 2013 FOCS https://doi.org/10.1109/FOCS.2013.40 https://doi.ieeecomputersociety.org/10.1109/FOCS.2013.40 conf/focs/2013 db/conf/focs/focs2013.html#SinclairSY13 Pietro Caputo Fabio Martinelli Alistair Sinclair Alexandre Stauffer Random lattice triangulations: structure and algorithms. 615-624 2013 STOC https://doi.org/10.1145/2488608.2488685 conf/stoc/2013 db/conf/stoc/stoc2013.html#CaputoMSS13 Alistair Sinclair Piyush Srivastava 0001 Lee-Yang theorems and the complexity of computing averages. 625-634 2013 STOC https://doi.org/10.1145/2488608.2488686 conf/stoc/2013 db/conf/stoc/stoc2013.html#SinclairS13

Alistair Sinclair Piyush Srivastava 0001 Yitong Yin Spatial mixing and approximation algorithms for graphs with bounded connective constant. 2013 CoRR http://arxiv.org/abs/1308.1762 abs/1308.1762 db/journals/corr/corr1308.html#SinclairSY13

Ivona Bezáková Alistair Sinclair Daniel Stefankovic Eric Vigoda Negative Examples for Sequential Importance Sampling of Binary Contingency Tables. 606-620 2012 64 Algorithmica 4 https://doi.org/10.1007/s00453-011-9569-3 db/journals/algorithmica/algorithmica64.html#BezakovaSSV12

Lorenz Minder Alistair Sinclair The Extended k-tree Algorithm. 349-382 2012 25 J. Cryptol. 2 https://doi.org/10.1007/s00145-011-9097-y db/journals/joc/joc25.html#MinderS12

Alistair Sinclair Piyush Srivastava 0001 Marc Thurley Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs. 941-953 2012 SODA https://doi.org/10.1137/1.9781611973099.75 https://dl.acm.org/citation.cfm?id=2095191 conf/soda/2012 db/conf/soda/soda2012.html#SinclairST12

Alistair Sinclair Piyush Srivastava 0001 Lee-Yang theorems and the complexity of computing averages http://arxiv.org/abs/1211.2376 2012 CoRR abs/1211.2376 db/journals/corr/corr1211.html#abs-1211-2376

Steve Chien Alistair Sinclair Convergence to approximate Nash equilibria in congestion games. 315-327 2011 71 Games Econ. Behav. 2 https://doi.org/10.1016/j.geb.2009.05.004 db/journals/geb/geb71.html#ChienS11

Yuval Peres Alistair Sinclair Perla Sousi Alexandre Stauffer Mobile Geometric Graphs: Detection, Coverage and Percolation. 412-428 2011 SODA https://doi.org/10.1137/1.9781611973082.33 http://dl.acm.org/citation.cfm?id=2133069 conf/soda/2011 db/conf/soda/soda2011.html#PeresSSS11 Steve Chien Prahladh Harsha Alistair Sinclair Srikanth Srinivasan 0001 Almost settling the hardness of noncommutative determinant. 499-508 2011 STOC https://doi.org/10.1145/1993636.1993703 conf/stoc/2011 db/conf/stoc/stoc2011.html#ChienHSS11

Steve Chien Prahladh Harsha Alistair Sinclair Srikanth Srinivasan 0001 Almost Settling the Hardness of Noncommutative Determinant http://arxiv.org/abs/1101.1169 2011 CoRR abs/1101.1169 db/journals/corr/corr1101.html#abs-1101-1169

Alistair Sinclair Piyush Srivastava 0001 Marc Thurley Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs http://arxiv.org/abs/1107.2368 2011 CoRR abs/1107.2368 db/journals/corr/corr1107.html#abs-1107-2368

Thomas P. Hayes Alistair Sinclair Liftings of Tree-Structured Markov Chains - (Extended Abstract). 602-616 2010 APPROX-RANDOM https://doi.org/10.1007/978-3-642-15369-3_45 conf/approx/2010 db/conf/approx/approx2010.html#HayesS10 Alistair Sinclair Dan Vilenchik Delaying Satisfiability for Random 2SAT. 710-723 2010 APPROX-RANDOM https://doi.org/10.1007/978-3-642-15369-3_53 conf/approx/2010 db/conf/approx/approx2010.html#SinclairV10

Alistair Sinclair Alexandre Stauffer Mobile Geometric Graphs, and Detection and Communication Problems in Mobile Wireless Networks http://arxiv.org/abs/1005.1117 2010 CoRR abs/1005.1117 db/journals/corr/corr1005.html#abs-1005-1117

Yuval Peres Alistair Sinclair Perla Sousi Alexandre Stauffer Mobile Geometric Graphs: Detection, Coverage and Percolation http://arxiv.org/abs/1008.0075 2010 CoRR abs/1008.0075 db/journals/corr/corr1008.html#abs-1008-0075

Fabio Martinelli Alistair Sinclair Mixing Time for the Solid-on-Solid Model http://arxiv.org/abs/1008.0125 2010 CoRR abs/1008.0125 db/journals/corr/corr1008.html#abs-1008-0125

Claire Kenyon Yuval Rabani Alistair Sinclair Low Distortion Maps Between Point Sets. 1617-1636 2009 39 SIAM J. Comput. 4 https://doi.org/10.1137/080712921 https://www.wikidata.org/entity/Q102421740 db/journals/siamcomp/siamcomp39.html#KenyonRS09

Steve Chien Alistair Sinclair Strong and Pareto Price of Anarchy in Congestion Games. 279-291 2009 ICALP (1) https://doi.org/10.1007/978-3-642-02927-1_24 conf/icalp/2009-1 db/conf/icalp/icalp2009-1.html#ChienS09 Lorenz Minder Alistair Sinclair The extended k-tree algorithm. 586-595 2009 SODA https://doi.org/10.1137/1.9781611973068.65 http://dl.acm.org/citation.cfm?id=1496770.1496835 conf/soda/2009 db/conf/soda/soda2009.html#MinderS09 Claire Mathieu Alistair Sinclair Sherali-adams relaxations of the matching polytope. 293-302 2009 STOC https://doi.org/10.1145/1536414.1536456 conf/stoc/2009 db/conf/stoc/stoc2009.html#MathieuS09 Fabio Martinelli Alistair Sinclair Mixing time for the solid-on-solid model. 571-580 2009 STOC https://doi.org/10.1145/1536414.1536492 conf/stoc/2009 db/conf/stoc/stoc2009.html#MartinelliS09

Elitza N. Maneva Alistair Sinclair On the satisfiability threshold and clustering of solutions of random 3-SAT formulas. 359-369 2008 407 Theor. Comput. Sci. 1-3 https://doi.org/10.1016/j.tcs.2008.06.053 https://www.wikidata.org/entity/Q125756943 db/journals/tcs/tcs407.html#ManevaS08

Fabio Martinelli Alistair Sinclair Dror Weitz Fast mixing for independent sets, colorings, and other models on trees. 134-172 2007 31 Random Struct. Algorithms 2 https://doi.org/10.1002/rsa.20132 db/journals/rsa/rsa31.html#MartinelliSW07

Steve Chien Alistair Sinclair Algebras with Polynomial Identities and Computing the Determinant. 252-266 2007 37 SIAM J. Comput. 1 https://doi.org/10.1137/S0097539705447359 db/journals/siamcomp/siamcomp37.html#ChienS07

Steve Chien Alistair Sinclair Convergence to approximate Nash equilibria in congestion games. 169-178 2007 conf/soda/2007 SODA http://dl.acm.org/citation.cfm?id=1283383.1283402 db/conf/soda/soda2007.html#ChienS07

Elitza N. Maneva Alistair Sinclair On the Satisfiability Threshold and Clustering of Solutions of Random 3-SAT Formulas http://arxiv.org/abs/0710.0805 2007 CoRR abs/0710.0805 db/journals/corr/corr0710.html#abs-0710-0805

Chandra Chekuri Anupam Gupta 0001 Ilan Newman Yuri Rabinovich Alistair Sinclair Embedding k-Outerplanar Graphs into l 1. 119-136 2006 20 SIAM J. Discret. Math. 1 https://doi.org/10.1137/S0895480102417379 db/journals/siamdm/siamdm20.html#ChekuriGNRS06

Ivona Bezáková Alistair Sinclair Daniel Stefankovic Eric Vigoda Negative Examples for Sequential Importance Sampling of Binary Contingency Tables. 136-147 2006 conf/esa/2006 ESA https://doi.org/10.1007/11841036_15 db/conf/esa/esa2006.html#BezakovaSSV06 Thomas P. Hayes Alistair Sinclair A general lower bound for mixing of single-site dynamics on graphs. 511-520 2005 conf/focs/2005 FOCS https://doi.org/10.1109/SFCS.2005.6 https://doi.ieeecomputersociety.org/10.1109/SFCS.2005.6 db/conf/focs/focs2005.html#HayesS05

Anupam Gupta 0001 Ilan Newman Yuri Rabinovich Alistair Sinclair Cuts, Trees and l1-Embeddings of Graphs. 233-269 2004 24 Comb. 2 https://doi.org/10.1007/s00493-004-0015-x https://www.wikidata.org/entity/Q60608702 db/journals/combinatorica/combinatorica24.html#GuptaNRS04

Mark Jerrum Alistair Sinclair Eric Vigoda A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. 671-697 2004 51 J. ACM 4 https://doi.org/10.1145/1008731.1008738 https://www.wikidata.org/entity/Q55893500 db/journals/jacm/jacm51.html#JerrumSV04

Martin E. Dyer Alistair Sinclair Eric Vigoda Dror Weitz Mixing in time and space for lattice spin systems: A combinatorial view. 461-479 2004 24 Random Struct. Algorithms 4 https://doi.org/10.1002/rsa.20004 https://www.wikidata.org/entity/Q56323942 db/journals/rsa/rsa24.html#DyerSVW04

Ben Morris 0001 Alistair Sinclair Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions. 195-226 2004 34 SIAM J. Comput. 1 https://doi.org/10.1137/S0097539702411915 db/journals/siamcomp/siamcomp34.html#MorrisS04

Steve Chien Alistair Sinclair Algebras with Polynomial Identities and Computing the Determinant. 352-361 2004 conf/focs/2004 FOCS https://doi.org/10.1109/FOCS.2004.9 https://doi.ieeecomputersociety.org/10.1109/FOCS.2004.9 db/conf/focs/focs2004.html#ChienS04 Elchanan Mossel Yuval Peres Alistair Sinclair Shuffling by Semi-Random Transpositions. 572-581 2004 conf/focs/2004 FOCS https://doi.org/10.1109/FOCS.2004.60 https://doi.ieeecomputersociety.org/10.1109/FOCS.2004.60 db/conf/focs/focs2004.html#MosselPS04 Fabio Martinelli Alistair Sinclair Dror Weitz Fast mixing for independent sets, colorings and other models on trees. 456-465 2004 conf/soda/2004 SODA http://dl.acm.org/citation.cfm?id=982792.982857 db/conf/soda/soda2004.html#MartinelliSW04 Claire Kenyon Yuval Rabani Alistair Sinclair Low distortion maps between point sets. 272-280 2004 conf/stoc/2004 STOC https://doi.org/10.1145/1007352.1007398 db/conf/stoc/stoc2004.html#KenyonRS04

Steve Chien Lars Eilstrup Rasmussen Alistair Sinclair Clifford algebras and approximating the permanent. 263-290 2003 67 J. Comput. Syst. Sci. 2 https://doi.org/10.1016/S0022-0000(03)00010-2 db/journals/jcss/jcss67.html#ChienRS03

Joachim von zur Gathen Igor E. Shparlinski Alistair Sinclair Finding Points on Curves over Finite Fields. 1436-1448 2003 32 SIAM J. Comput. 6 https://doi.org/10.1137/S0097539799351018 db/journals/siamcomp/siamcomp32.html#GathenSS03

Fabio Martinelli Alistair Sinclair Dror Weitz The Ising Model on Trees: Boundary Conditions and Mixing Time. 628-639 2003 conf/focs/2003 FOCS https://doi.org/10.1109/SFCS.2003.1238235 https://doi.ieeecomputersociety.org/10.1109/SFCS.2003.1238235 db/conf/focs/focs2003.html#MartinelliSW03 Chandra Chekuri Anupam Gupta 0001 Ilan Newman Yuri Rabinovich Alistair Sinclair Embedding k-outerplanar graphs into l1. 527-536 2003 conf/soda/2003 SODA http://dl.acm.org/citation.cfm?id=644108.644197 db/conf/soda/soda2003.html#ChekuriGNRS03 Martin E. Dyer Alistair Sinclair Eric Vigoda Dror Weitz Mixing in Time and Space for Lattice Spin Systems: A Combinatorial View. 149-163 2002 conf/random/2002 RANDOM https://doi.org/10.1007/3-540-45726-7_13 https://www.wikidata.org/entity/Q56323996 db/conf/random/random2002.html#DyerSVW02 Steve Chien Lars Eilstrup Rasmussen Alistair Sinclair Clifford algebras and approximating the permanent. 222-231 2002 conf/stoc/2002 STOC https://doi.org/10.1145/509907.509944 db/conf/stoc/stoc2002.html#ChienRS02

Michael Luby Dana Randall Alistair Sinclair Markov Chain Algorithms for Planar Lattice Structures. 167-192 2001 31 SIAM J. Comput. 1 https://doi.org/10.1137/S0097539799360355 db/journals/siamcomp/siamcomp31.html#LubyRS01

Mark Jerrum Alistair Sinclair Eric Vigoda A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. 712-721 2001 conf/stoc/2001 STOC https://doi.org/10.1145/380752.380877 https://www.wikidata.org/entity/Q56806477 db/conf/stoc/stoc2001.html#JerrumSV01

Ashwin Nayak 0001 Alistair Sinclair Uri Zwick Spatial Codes and the Hardness of String Folding Problems. 13-36 1999 6 J. Comput. Biol. 1 db/journals/jcb/jcb6.html#NayakSZ99 https://doi.org/10.1089/cmb.1999.6.13 https://www.wikidata.org/entity/Q41649085

Ben Morris 0001 Alistair Sinclair Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions. 230-240 1999 conf/focs/1999 FOCS https://doi.org/10.1109/SFFCS.1999.814595 https://doi.ieeecomputersociety.org/10.1109/SFFCS.1999.814595 db/conf/focs/focs99.html#MorrisS99 Anupam Gupta 0001 Ilan Newman Yuri Rabinovich Alistair Sinclair Cuts, Trees and l1-Embeddings of Graphs. 399-409 1999 conf/focs/1999 FOCS https://doi.org/10.1109/SFFCS.1999.814611 https://doi.ieeecomputersociety.org/10.1109/SFFCS.1999.814611 db/conf/focs/focs99.html#GuptaNRS99 Dorit S. Hochbaum Klaus Jansen José D. P. Rolim Alistair Sinclair Randomization, Approximation, and Combinatorial Algorithms and Techniques, Third International Workshop on Randomization and Approximation Techniques in Computer Science, and Second International Workshop on Approximation Algorithms for Combinatorial Optimization Problems RANDOM-APPROX'99, Berkeley, CA, USA, August 8-11, 1999, Proceedings RANDOM-APPROX Lecture Notes in Computer Science 1671 Springer 1999 3-540-66329-0 https://doi.org/10.1007/b72324 db/conf/random/random1999.html

Claire Kenyon Yuval Rabani Alistair Sinclair Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing. 218-235 1998 27 J. Algorithms 2 db/journals/jal/jal27.html#KenyonRS98 https://doi.org/10.1006/jagm.1997.0919

Yuval Rabani Yuri Rabinovich Alistair Sinclair A computational view of population genetics. 313-334 1998 12 Random Struct. Algorithms 4 db/journals/rsa/rsa12.html#RabaniRS98 https://doi.org/10.1002/(SICI)1098-2418(199807)12:4<313::AID-RSA1>3.0.CO;2-W

Yuval Rabani Alistair Sinclair Rolf Wanka Local Divergence of Markov Chains and the Analysis of Iterative Load Balancing Schemes. 694-705 1998 conf/focs/1998 FOCS https://doi.org/10.1109/SFCS.1998.743520 https://doi.ieeecomputersociety.org/10.1109/SFCS.1998.743520 db/conf/focs/focs98.html#RabaniSW98 Ashwin Nayak 0001 Alistair Sinclair Uri Zwick Spatial Codes and the Hardness of String Folding Problems (Extended Abstract). 639-648 1998 conf/soda/1998 SODA db/conf/soda/soda98.html#NayakSZ98 http://dl.acm.org/citation.cfm?id=314613.315034 Claire Kenyon Yuval Rabani Alistair Sinclair Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing (Preliminary Version). 351-358 1996 conf/soda/1996 SODA db/conf/soda/soda96.html#KenyonRS96 http://dl.acm.org/citation.cfm?id=313852.314082 Michael Luby Dana Randall Alistair Sinclair Markov Chain Algorithms for Planar Lattice Structures (Extended Abstract). 150-159 1995 conf/focs/1995 FOCS db/conf/focs/focs95.html#LubyRS95 https://doi.org/10.1109/SFCS.1995.492472 https://doi.ieeecomputersociety.org/10.1109/SFCS.1995.492472 Yuval Rabani Yuri Rabinovich Alistair Sinclair A computational view of population genetics. 83-92 1995 conf/stoc/STOC27 STOC https://doi.org/10.1145/225058.225088 db/conf/stoc/stoc1995.html#RabaniRS95 Dana Randall Alistair Sinclair Testable Algorithms for Self-Avoiding Walks. 593-602 1994 conf/soda/1994 SODA db/conf/soda/soda94.html#RandallS94 http://dl.acm.org/citation.cfm?id=314464.314657 Alistair Sinclair Algorithms for random generation and counting - a Markov chain approach. 1-146 Birkhäuser 1993 Progress in theoretical computer science 978-0-8176-3658-6

Michael Luby Alistair Sinclair David Zuckerman Optimal Speedup of Las Vegas Algorithms. 173-180 1993 47 Inf. Process. Lett. 4 db/journals/ipl/ipl47.html#LubySZ93 https://doi.org/10.1016/0020-0190(93)90029-9 https://www.wikidata.org/entity/Q127580410

Mark Jerrum Alistair Sinclair Polynomial-Time Approximation Algorithms for the Ising Model. 1087-1116 1993 22 SIAM J. Comput. 5 db/journals/siamcomp/siamcomp22.html#JerrumS93 https://doi.org/10.1137/0222066 https://www.wikidata.org/entity/Q60264972

Michael Luby Alistair Sinclair David Zuckerman Optimal Speedup of Las Vegas Algorithms. 128-133 1993 conf/istcs/1993 ISTCS db/conf/istcs/istcs1993.html#LubySZ93 https://doi.org/10.1109/ISTCS.1993.253477 https://doi.ieeecomputersociety.org/10.1109/ISTCS.1993.253477 Claire Kenyon Dana Randall Alistair Sinclair Matchings in lattice graphs. 738-746 1993 conf/stoc/STOC25 STOC https://doi.org/10.1145/167088.167278 db/conf/stoc/stoc1993.html#KenyonRS93

Alistair Sinclair Improved Bounds for Mixing Rates of Marcov Chains and Multicommodity Flow. 351-370 1992 1 Comb. Probab. Comput. db/journals/cpc/cpc1.html#Sinclair92 https://doi.org/10.1017/S0963548300000390

Quadratic Dynamical Systems (Preliminary Version) Yuri Rabinovich Alistair Sinclair Avi Wigderson 304-313 conf/focs/FOCS33 1992 FOCS db/conf/focs/focs92.html#RabinovichSW92 https://doi.org/10.1109/SFCS.1992.267761 https://doi.ieeecomputersociety.org/10.1109/SFCS.1992.267761 Alistair Sinclair Improved Bounds for Mixing Rates of Marked Chains and Multicommodity Flow. 474-487 1992 conf/latin/1992 LATIN db/conf/latin/latin92.html#Sinclair92 https://doi.org/10.1007/BFb0023849

Mark Jerrum Alistair Sinclair Fast Uniform Generation of Regular Graphs. 91-100 1990 73 Theor. Comput. Sci. 1 db/journals/tcs/tcs73.html#JerrumS90 https://doi.org/10.1016/0304-3975(90)90164-D

Mark Jerrum Alistair Sinclair Polynomial-Time Approximation Algorithms for Ising Model (Extended Abstract). 462-475 1990 conf/icalp/1990 ICALP db/conf/icalp/icalp90.html#JerrumS90 https://doi.org/10.1007/BFb0032051

Alistair Sinclair Mark Jerrum Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains 93-133 Inf. Comput. July 1989 82 1 db/journals/iandc/iandc82.html#SinclairJ89 https://doi.org/10.1016/0890-5401(89)90067-9 https://www.wikidata.org/entity/Q56386806

Mark Jerrum Alistair Sinclair Approximating the Permanent. 1149-1178 1989 18 SIAM J. Comput. 6 db/journals/siamcomp/siamcomp18.html#JerrumS89 https://doi.org/10.1137/0218077 https://www.wikidata.org/entity/Q56386807

Conductance and the Rapid Mixing Property for Markov Chains: the Approximation of the Permanent Resolved (Preliminary Version) Mark Jerrum Alistair Sinclair 235-244 conf/stoc/STOC20 1988 STOC db/conf/stoc/stoc88.html#JerrumS88 https://doi.org/10.1145/62212.62234 Alistair Sinclair Mark Jerrum Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains. 134-148 1987 conf/wg/1987 WG db/conf/wg/wg87.html#SinclairJ87 https://doi.org/10.1007/3-540-19422-3_11 Dimitris Achlioptas Joao Basso Ivona Bezáková Antonio Blanca Pietro Caputo Chandra Chekuri Steve Chien Martin E. Dyer Shirshendu Ganguly Joachim von zur Gathen Reza Gheissari Anupam Gupta 0001 Prahladh Harsha Thomas P. Hayes Dorit S. Hochbaum Fotis Iliopoulos Klaus Jansen Mark Jerrum Jingcheng Liu 0001 Michael Luby Elitza N. Maneva Fabio Martinelli Claire MathieuClaire Kenyon Lorenz Minder Ben Morris 0001 Elchanan Mossel Ashwin Nayak 0001 Ilan Newman Daniel Parisi Yuval Peres Yuval Rabani Yuri Rabinovich Dana Randall Lars Eilstrup Rasmussen José D. P. Rolim Leonard J. Schulman Igor E. Shparlinski Perla Sousi Srikanth Srinivasan 0001 Nikhil Srivastava Piyush Srivastava 0001 Alexandre Stauffer Daniel Stefankovic Zachary Stier Marc Thurley Eric Vigoda Dan Vilenchik Thuy-Duong Vuong Rolf Wanka Dror Weitz Avi Wigderson Yitong Yin Xusheng Zhang David Zuckerman Uri Zwick