The following pages link to Alistair Sinclair (Q287734):
Displaying 50 items.
- Dynamics of lattice triangulations on thin rectangles (Q287736) (← links)
- The extended \(k\)-tree algorithm (Q431783) (← links)
- Mixing time for the solid-on-solid model (Q433908) (← links)
- Convergence to approximate Nash equilibria in congestion games (Q632952) (← links)
- Optimal speedup of Las Vegas algorithms (Q689615) (← links)
- Cuts, trees and \(\ell_1\)-embeddings of graphs (Q705742) (← links)
- Fast uniform generation of regular graphs (Q909471) (← links)
- On the satisfiability threshold and clustering of solutions of random 3-SAT formulas (Q955013) (← links)
- Approximate counting, uniform generation and rapidly mixing Markov chains (Q1117955) (← links)
- Approximating the number of monomer-dimer coverings of a lattice. (Q1593404) (← links)
- The Ising partition function: zeros and deterministic approximation (Q1730971) (← links)
- Entropy production in nonlinear recombination models (Q1750084) (← links)
- Glauber dynamics on trees: Boundary conditions and mixing time (Q1766910) (← links)
- Negative examples for sequential importance sampling of binary contingency tables (Q1945173) (← links)
- Mobile geometric graphs: detection, coverage and percolation (Q1955843) (← links)
- Entropy decay in the Swendsen-Wang dynamics on \(\mathbb{Z}^d\) (Q2134289) (← links)
- Lee-Yang theorems and the complexity of computing averages (Q2249768) (← links)
- Random lattice triangulations: structure and algorithms (Q2346085) (← links)
- Spatial mixing and the connective constant: optimal bounds (Q2359740) (← links)
- Random-cluster dynamics in \(\mathbb {Z}^2\) (Q2363654) (← links)
- A general lower bound for mixing of single-site dynamics on graphs (Q2456048) (← links)
- Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs (Q2511522) (← links)
- Quasisymmetric embeddings, the observable diameter, and expansion properties of graphs (Q2573422) (← links)
- Self-testing algorithms for self-avoiding walks (Q2737885) (← links)
- Markov Chain Algorithms for Planar Lattice Structures (Q2784446) (← links)
- Delaying satisfiability for random 2SAT (Q2852549) (← links)
- (Q2934594) (← links)
- Analysis of a Classical Matrix Preconditioning Algorithm (Q2941580) (← links)
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries (Q3069905) (← links)
- (Q3128922) (← links)
- (Q3135094) (← links)
- Polynomial-Time Approximation Algorithms for the Ising Model (Q3142597) (← links)
- (Q3197826) (← links)
- Approximating the Permanent (Q3211352) (← links)
- Low distortion maps between point sets (Q3580974) (← links)
- Low Distortion Maps Between Point Sets (Q3586193) (← links)
- Liftings of Tree-Structured Markov Chains (Q3588438) (← links)
- Delaying Satisfiability for Random 2SAT (Q3588446) (← links)
- Strong and Pareto Price of Anarchy in Congestion Games (Q3638041) (← links)
- (Q4038711) (← links)
- Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing (Q4216135) (← links)
- (Q4230353) (← links)
- (Q4231920) (← links)
- (Q4234054) (← links)
- (Q4249732) (← links)
- (Q4250233) (← links)
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow (Q4291194) (← links)
- Finding Points on Curves over Finite Fields (Q4429696) (← links)
- (Q4440435) (← links)
- (Q4471340) (← links)
