default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlistair Sinclair
Person information
- affiliation: University of California, Berkeley, USA
- award (1996): Gödel Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j30]Reza Gheissari
, Alistair Sinclair:
Spatial mixing and the random-cluster dynamics on lattices. Random Struct. Algorithms 64(2): 490-534 (2024)- [c55]Pietro Caputo, Alistair Sinclair:
Nonlinear Dynamics for the Ising Model. STOC 2024: 515-526 - [i20]Yuval Rabani, Leonard J. Schulman, Alistair Sinclair:
Diversity in Evolutionary Dynamics. CoRR abs/2406.03938 (2024) - 2023
- [c54]Reza Gheissari, Alistair Sinclair:
Spatial mixing and the random-cluster dynamics on lattices. SODA 2023: 4606-4621 - 2022
- [j29]Antonio Blanca, Alistair Sinclair, Xusheng Zhang:
The critical mean-field Chayes-Machta dynamics. Comb. Probab. Comput. 31(6): 924-975 (2022) - [j28]Fotis Iliopoulos, Alistair Sinclair:
Efficiently list-edge coloring multigraphs asymptotically optimally. Random Struct. Algorithms 61(4): 724-753 (2022) - [c53]Reza Gheissari, Alistair Sinclair:
Low-temperature Ising dynamics with random initializations. STOC 2022: 1445-1458 - 2021
- [c52]Antonio Blanca, Alistair Sinclair, Xusheng Zhang:
The Critical Mean-Field Chayes-Machta Dynamics. APPROX-RANDOM 2021: 47:1-47:15 - [c51]Antonio Blanca, Pietro Caputo, Daniel Parisi, Alistair Sinclair, Eric Vigoda:
Entropy decay in the Swendsen-Wang dynamics on ℤd. STOC 2021: 1551-1564 - [i19]Antonio Blanca, Alistair Sinclair, Xusheng Zhang:
The Critical Mean-field Chayes-Machta Dynamics. CoRR abs/2102.03004 (2021) - 2020
- [c50]Fotis Iliopoulos, Alistair Sinclair:
Efficiently list-edge coloring multigraphs asymptotically optimally. SODA 2020: 2319-2336
2010 – 2019
- 2019
- [j27]Antonio Blanca, Pietro Caputo, Alistair Sinclair, Eric Vigoda:
Spatial mixing and nonlocal Markov chains. Random Struct. Algorithms 55(3): 584-614 (2019) - [c49]Dimitris Achlioptas, Fotis Iliopoulos, Alistair Sinclair:
Beyond the Lovász Local Lemma: Point to Set Correlations and Their Algorithmic Applications. FOCS 2019: 725-744 - [c48]Jingcheng Liu, Alistair Sinclair, Piyush Srivastava:
A Deterministic Algorithm for Counting Colorings with 2-Delta Colors. FOCS 2019: 1380-1404 - [c47]Jingcheng Liu, Alistair Sinclair, Piyush Srivastava:
Fisher Zeros and Correlation Decay in the Ising Model. ITCS 2019: 55:1-55:8 - [i18]Jingcheng Liu, Alistair Sinclair, Piyush Srivastava:
A deterministic algorithm for counting colorings with 2Δ colors. CoRR abs/1906.01228 (2019) - 2018
- [c46]Antonio Blanca, Pietro Caputo, Alistair Sinclair, Eric Vigoda:
Spatial Mixing and Non-local Markov chains. SODA 2018: 1965-1980 - [i17]Dimitris Achlioptas, Fotis Iliopoulos, Alistair Sinclair:
A New Perspective on Stochastic Local Search and the Lovasz Local Lemma. CoRR abs/1805.02026 (2018) - [i16]Jingcheng Liu, Alistair Sinclair, Piyush Srivastava:
Fisher zeros and correlation decay in the Ising model. CoRR abs/1807.06577 (2018) - [i15]Fotis Iliopoulos, Alistair Sinclair:
Efficiently list-edge coloring multigraphs asymptotically optimally. CoRR abs/1812.10309 (2018) - 2017
- [j26]Leonard J. Schulman, Alistair Sinclair:
Analysis of a Classical Matrix Preconditioning Algorithm. J. ACM 64(2): 9:1-9:23 (2017) - [c45]Jingcheng Liu, Alistair Sinclair, Piyush Srivastava:
The Ising Partition Function: Zeros and Deterministic Approximation. FOCS 2017: 986-997 - [i14]Jingcheng Liu, Alistair Sinclair, Piyush Srivastava:
The Ising Partition Function: Zeros and Deterministic Approximation. CoRR abs/1704.06493 (2017) - [i13]Antonio Blanca, Pietro Caputo, Alistair Sinclair, Eric Vigoda:
Spatial Mixing and Non-local Markov chains. CoRR abs/1708.01513 (2017) - 2016
- [c44]Antonio Blanca, Alistair Sinclair:
Random-Cluster Dynamics in ℤ2. SODA 2016: 498-513 - 2015
- [c43]Antonio Blanca, Alistair Sinclair:
Dynamics for the Mean-field Random-cluster Model. APPROX-RANDOM 2015: 528-543 - [c42]Leonard J. Schulman, Alistair Sinclair, Piyush Srivastava:
Symbolic Integration and the Complexity of Computing Averages. FOCS 2015: 1231-1245 - [c41]Alistair Sinclair, Piyush Srivastava, Daniel Stefankovic, Yitong Yin:
Spatial mixing and the connective constant: Optimal bounds. SODA 2015: 1549-1563 - [c40]Leonard J. Schulman, Alistair Sinclair:
Analysis of a Classical Matrix Preconditioning Algorithm. STOC 2015: 831-840 - [i12]Leonard J. Schulman, Alistair Sinclair:
Analysis of a Classical Matrix Preconditioning Algorithm. CoRR abs/1504.03026 (2015) - [i11]Pietro Caputo, Fabio Martinelli, Alistair Sinclair, Alexandre Stauffer:
Dynamics of Lattice Triangulations on Thin Rectangles. CoRR abs/1505.06161 (2015) - [i10]Antonio Blanca, Alistair Sinclair:
Random-Cluster Dynamics in ℤ2. CoRR abs/1510.06762 (2015) - 2014
- [i9]Alistair Sinclair, Piyush Srivastava, Daniel Stefankovic, Yitong Yin:
Spatial mixing and the connective constant: Optimal bounds. CoRR abs/1410.2595 (2014) - 2013
- [j25]Alistair Sinclair, Dan Vilenchik:
Delaying satisfiability for random 2SAT. Random Struct. Algorithms 43(2): 251-263 (2013) - [c39]Alistair Sinclair, Piyush Srivastava, Yitong Yin:
Spatial Mixing and Approximation Algorithms for Graphs with Bounded Connective Constant. FOCS 2013: 300-309 - [c38]Pietro Caputo, Fabio Martinelli, Alistair Sinclair, Alexandre Stauffer:
Random lattice triangulations: structure and algorithms. STOC 2013: 615-624 - [c37]Alistair Sinclair, Piyush Srivastava:
Lee-Yang theorems and the complexity of computing averages. STOC 2013: 625-634 - [i8]Alistair Sinclair, Piyush Srivastava, Yitong Yin:
Spatial mixing and approximation algorithms for graphs with bounded connective constant. CoRR abs/1308.1762 (2013) - 2012
- [j24]Ivona Bezáková, Alistair Sinclair, Daniel Stefankovic, Eric Vigoda:
Negative Examples for Sequential Importance Sampling of Binary Contingency Tables. Algorithmica 64(4): 606-620 (2012) - [j23]Lorenz Minder, Alistair Sinclair:
The Extended k-tree Algorithm. J. Cryptol. 25(2): 349-382 (2012) - [c36]Alistair Sinclair, Piyush Srivastava, Marc Thurley:
Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs. SODA 2012: 941-953 - [i7]Alistair Sinclair, Piyush Srivastava:
Lee-Yang theorems and the complexity of computing averages. CoRR abs/1211.2376 (2012) - 2011
- [j22]Steve Chien, Alistair Sinclair:
Convergence to approximate Nash equilibria in congestion games. Games Econ. Behav. 71(2): 315-327 (2011) - [c35]Yuval Peres, Alistair Sinclair, Perla Sousi, Alexandre Stauffer:
Mobile Geometric Graphs: Detection, Coverage and Percolation. SODA 2011: 412-428 - [c34]Steve Chien, Prahladh Harsha, Alistair Sinclair, Srikanth Srinivasan:
Almost settling the hardness of noncommutative determinant. STOC 2011: 499-508 - [i6]Steve Chien, Prahladh Harsha, Alistair Sinclair, Srikanth Srinivasan:
Almost Settling the Hardness of Noncommutative Determinant. CoRR abs/1101.1169 (2011) - [i5]Alistair Sinclair, Piyush Srivastava, Marc Thurley:
Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs. CoRR abs/1107.2368 (2011) - 2010
- [c33]Thomas P. Hayes, Alistair Sinclair:
Liftings of Tree-Structured Markov Chains - (Extended Abstract). APPROX-RANDOM 2010: 602-616 - [c32]Alistair Sinclair, Dan Vilenchik:
Delaying Satisfiability for Random 2SAT. APPROX-RANDOM 2010: 710-723 - [i4]Alistair Sinclair, Alexandre Stauffer:
Mobile Geometric Graphs, and Detection and Communication Problems in Mobile Wireless Networks. CoRR abs/1005.1117 (2010) - [i3]Yuval Peres, Alistair Sinclair, Perla Sousi, Alexandre Stauffer:
Mobile Geometric Graphs: Detection, Coverage and Percolation. CoRR abs/1008.0075 (2010) - [i2]Fabio Martinelli, Alistair Sinclair:
Mixing Time for the Solid-on-Solid Model. CoRR abs/1008.0125 (2010)
2000 – 2009
- 2009
- [j21]Claire Kenyon, Yuval Rabani, Alistair Sinclair:
Low Distortion Maps Between Point Sets. SIAM J. Comput. 39(4): 1617-1636 (2009) - [c31]Steve Chien, Alistair Sinclair:
Strong and Pareto Price of Anarchy in Congestion Games. ICALP (1) 2009: 279-291 - [c30]Lorenz Minder, Alistair Sinclair:
The extended k-tree algorithm. SODA 2009: 586-595 - [c29]Claire Mathieu, Alistair Sinclair:
Sherali-adams relaxations of the matching polytope. STOC 2009: 293-302 - [c28]Fabio Martinelli, Alistair Sinclair:
Mixing time for the solid-on-solid model. STOC 2009: 571-580 - 2008
- [j20]Elitza N. Maneva, Alistair Sinclair:
On the satisfiability threshold and clustering of solutions of random 3-SAT formulas. Theor. Comput. Sci. 407(1-3): 359-369 (2008) - 2007
- [j19]Fabio Martinelli, Alistair Sinclair, Dror Weitz:
Fast mixing for independent sets, colorings, and other models on trees. Random Struct. Algorithms 31(2): 134-172 (2007) - [j18]Steve Chien, Alistair Sinclair:
Algebras with Polynomial Identities and Computing the Determinant. SIAM J. Comput. 37(1): 252-266 (2007) - [c27]Steve Chien, Alistair Sinclair:
Convergence to approximate Nash equilibria in congestion games. SODA 2007: 169-178 - [i1]Elitza N. Maneva, Alistair Sinclair:
On the Satisfiability Threshold and Clustering of Solutions of Random 3-SAT Formulas. CoRR abs/0710.0805 (2007) - 2006
- [j17]Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair:
Embedding k-Outerplanar Graphs into l 1. SIAM J. Discret. Math. 20(1): 119-136 (2006) - [c26]Ivona Bezáková, Alistair Sinclair, Daniel Stefankovic, Eric Vigoda:
Negative Examples for Sequential Importance Sampling of Binary Contingency Tables. ESA 2006: 136-147 - 2005
- [c25]Thomas P. Hayes, Alistair Sinclair:
A general lower bound for mixing of single-site dynamics on graphs. FOCS 2005: 511-520 - 2004
- [j16]Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair:
Cuts, Trees and l1-Embeddings of Graphs. Comb. 24(2): 233-269 (2004) - [j15]Mark Jerrum, Alistair Sinclair, Eric Vigoda:
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. J. ACM 51(4): 671-697 (2004) - [j14]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): 461-479 (2004) - [j13]Ben Morris, Alistair Sinclair:
Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions. SIAM J. Comput. 34(1): 195-226 (2004) - [c24]Steve Chien, Alistair Sinclair:
Algebras with Polynomial Identities and Computing the Determinant. FOCS 2004: 352-361 - [c23]Elchanan Mossel, Yuval Peres, Alistair Sinclair:
Shuffling by Semi-Random Transpositions. FOCS 2004: 572-581 - [c22]Fabio Martinelli, Alistair Sinclair, Dror Weitz:
Fast mixing for independent sets, colorings and other models on trees. SODA 2004: 456-465 - [c21]Claire Kenyon, Yuval Rabani, Alistair Sinclair:
Low distortion maps between point sets. STOC 2004: 272-280 - 2003
- [j12]Steve Chien, Lars Eilstrup Rasmussen, Alistair Sinclair:
Clifford algebras and approximating the permanent. J. Comput. Syst. Sci. 67(2): 263-290 (2003) - [j11]Joachim von zur Gathen, Igor E. Shparlinski, Alistair Sinclair:
Finding Points on Curves over Finite Fields. SIAM J. Comput. 32(6): 1436-1448 (2003) - [c20]Fabio Martinelli, Alistair Sinclair, Dror Weitz:
The Ising Model on Trees: Boundary Conditions and Mixing Time. FOCS 2003: 628-639 - [c19]Chandra Chekuri, Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair:
Embedding k-outerplanar graphs into l1. SODA 2003: 527-536 - 2002
- [c18]Martin E. Dyer, Alistair Sinclair, Eric Vigoda, Dror Weitz:
Mixing in Time and Space for Lattice Spin Systems: A Combinatorial View. RANDOM 2002: 149-163 - [c17]Steve Chien, Lars Eilstrup Rasmussen, Alistair Sinclair:
Clifford algebras and approximating the permanent. STOC 2002: 222-231 - 2001
- [j10]Michael Luby, Dana Randall, Alistair Sinclair:
Markov Chain Algorithms for Planar Lattice Structures. SIAM J. Comput. 31(1): 167-192 (2001) - [c16]Mark Jerrum, Alistair Sinclair, Eric Vigoda:
A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. STOC 2001: 712-721
1990 – 1999
- 1999
- [j9]Ashwin Nayak, Alistair Sinclair, Uri Zwick:
Spatial Codes and the Hardness of String Folding Problems. J. Comput. Biol. 6(1): 13-36 (1999) - [c15]Ben Morris, Alistair Sinclair:
Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions. FOCS 1999: 230-240 - [c14]Anupam Gupta, Ilan Newman, Yuri Rabinovich, Alistair Sinclair:
Cuts, Trees and l1-Embeddings of Graphs. FOCS 1999: 399-409 - [e1]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. Lecture Notes in Computer Science 1671, Springer 1999, ISBN 3-540-66329-0 [contents] - 1998
- [j8]Claire Kenyon, Yuval Rabani, Alistair Sinclair:
Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing. J. Algorithms 27(2): 218-235 (1998) - [j7]Yuval Rabani, Yuri Rabinovich, Alistair Sinclair:
A computational view of population genetics. Random Struct. Algorithms 12(4): 313-334 (1998) - [c13]Yuval Rabani, Alistair Sinclair, Rolf Wanka:
Local Divergence of Markov Chains and the Analysis of Iterative Load Balancing Schemes. FOCS 1998: 694-705 - [c12]Ashwin Nayak, Alistair Sinclair, Uri Zwick:
Spatial Codes and the Hardness of String Folding Problems (Extended Abstract). SODA 1998: 639-648 - 1996
- [c11]Claire Kenyon, Yuval Rabani, Alistair Sinclair:
Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing (Preliminary Version). SODA 1996: 351-358 - 1995
- [c10]Michael Luby, Dana Randall, Alistair Sinclair:
Markov Chain Algorithms for Planar Lattice Structures (Extended Abstract). FOCS 1995: 150-159 - [c9]Yuval Rabani, Yuri Rabinovich, Alistair Sinclair:
A computational view of population genetics. STOC 1995: 83-92 - 1994
- [c8]Dana Randall, Alistair Sinclair:
Testable Algorithms for Self-Avoiding Walks. SODA 1994: 593-602 - 1993
- [b1]Alistair Sinclair:
Algorithms for random generation and counting - a Markov chain approach. Progress in theoretical computer science, Birkhäuser 1993, ISBN 978-0-8176-3658-6, pp. 1-146 - [j6]Michael Luby, Alistair Sinclair, David Zuckerman:
Optimal Speedup of Las Vegas Algorithms. Inf. Process. Lett. 47(4): 173-180 (1993) - [j5]Mark Jerrum, Alistair Sinclair:
Polynomial-Time Approximation Algorithms for the Ising Model. SIAM J. Comput. 22(5): 1087-1116 (1993) - [c7]Michael Luby, Alistair Sinclair, David Zuckerman:
Optimal Speedup of Las Vegas Algorithms. ISTCS 1993: 128-133 - [c6]Claire Kenyon, Dana Randall, Alistair Sinclair:
Matchings in lattice graphs. STOC 1993: 738-746 - 1992
- [j4]Alistair Sinclair:
Improved Bounds for Mixing Rates of Marcov Chains and Multicommodity Flow. Comb. Probab. Comput. 1: 351-370 (1992) - [c5]Yuri Rabinovich, Alistair Sinclair, Avi Wigderson:
Quadratic Dynamical Systems (Preliminary Version). FOCS 1992: 304-313 - [c4]Alistair Sinclair:
Improved Bounds for Mixing Rates of Marked Chains and Multicommodity Flow. LATIN 1992: 474-487 - 1990
- [j3]Mark Jerrum, Alistair Sinclair:
Fast Uniform Generation of Regular Graphs. Theor. Comput. Sci. 73(1): 91-100 (1990) - [c3]Mark Jerrum, Alistair Sinclair:
Polynomial-Time Approximation Algorithms for Ising Model (Extended Abstract). ICALP 1990: 462-475
1980 – 1989
- 1989
- [j2]Alistair Sinclair, Mark Jerrum:
Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains. Inf. Comput. 82(1): 93-133 (1989) - [j1]Mark Jerrum, Alistair Sinclair:
Approximating the Permanent. SIAM J. Comput. 18(6): 1149-1178 (1989) - 1988
- [c2]Mark Jerrum, Alistair Sinclair:
Conductance and the Rapid Mixing Property for Markov Chains: the Approximation of the Permanent Resolved (Preliminary Version). STOC 1988: 235-244 - 1987
- [c1]Alistair Sinclair, Mark Jerrum:
Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains. WG 1987: 134-148
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
