Name
Affiliation
Papers
ALISTAIR SINCLAIR
Univ. of Edinburgh, Edinburgh, Scotland, UK
54
Collaborators
Citations 
PageRank 
54
1506
308.40
Referers 
Referees 
References 
1877
630
579
Search Limit
1001000
Title
Citations
PageRank
Year
Low-Temperature Ising Dynamics with Random Initializations00.342022
The critical mean-field Chayes-Machta dynamics.00.342022
Efficiently list-edge coloring multigraphs asymptotically optimally.00.342020
Beyond the Lovász Local Lemma: Point to Set Correlations and Their Algorithmic Applications00.342019
Fisher zeros and correlation decay in the Ising model.30.472019
A Deterministic Algorithm for Counting Colorings with 2-Delta Colors00.342019
A New Perspective on Stochastic Local Search and the Lovasz Local Lemma.00.342018
Spatial Mixing and Non-local Markov chains.10.362018
The Ising Partition Function: Zeros and Deterministic Approximation.100.652017
Spatial Mixing and Systematic Scan Markov chains.00.342016
Random-Cluster Dynamics in ℤ2.00.342016
Dynamics for the Mean-field Random-cluster Model.00.342015
Random-Cluster Dynamics in $\mathbb{Z}^2$00.342015
Symbolic Integration and the Complexity of Computing Averages00.342015
Spatial mixing and the connective constant: optimal bounds90.602014
Spatial Mixing and Approximation Algorithms for Graphs with Bounded Connective Constant130.692013
Lee-Yang theorems and the complexity of computing averages40.432013
Random lattice triangulations: structure and algorithms20.442013
Delaying Satisfiability for Random 2SAT20.382013
Negative examples for sequential importance sampling of binary contingency tables161.722012
The Extended k-tree Algorithm180.942012
Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs301.072012
Almost settling the hardness of noncommutative determinant50.582011
Convergence to approximate Nash equilibria in congestion games994.112011
Mobile geometric graphs: detection, coverage and percolation251.052011
Mobile Geometric Graphs, and Detection and Communication Problems in Mobile Wireless Networks30.502010
Liftings Of Tree-Structured Markov Chains (Extended Abstract)00.342010
Sherali-adams relaxations of the matching polytope250.852009
Strong and Pareto Price of Anarchy in Congestion Games160.712009
Mixing time for the solid-on-solid model10.432009
Low Distortion Maps Between Point Sets381.662009
Fast mixing for independent sets, colorings, and other models on trees363.072007
On the satisfiability threshold and clustering of solutions of random 3-SAT formulas130.702007
Algebras with Polynomial Identities and Computing the Determinant150.932007
A general lower bound for mixing of single-site dynamics on graphs110.672005
Shuffling by semi-random transpositions30.592004
Cuts, Trees And L(1)-Embeddings Of Graphs434.182004
Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions382.142004
Mixing in time and space for lattice spin systems: A combinatorial view151.892004
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries30026.292004
Finding Points on Curves over Finite Fields70.772003
The Ising Model on Trees: Boundary Conditions and Mixing Time91.232003
Embedding k-Outerplanar Graphs into l1181.162003
Spatial codes and the hardness of string folding problems.115.551999
Spatial Codes and the Hardness of String Folding Problems (Extended Abstract)10.351998
Biased random walks, Lyapunov functions, and stochastic analysis of best fit bin packing151.511998
A computational view of population genetics384.801998
Markov Chain Algorithms For Planar Lattice Structures (Extended Abstract)112.171995
Polynomial-time approximation algorithms for the Ising model9814.741993
Quadratic Dynamical Systems (Preliminary Version)71.031992
  • 1
  • 2