Low-Temperature Ising Dynamics with Random Initializations | 0 | 0.34 | 2022 |
The critical mean-field Chayes-Machta dynamics. | 0 | 0.34 | 2022 |
Efficiently list-edge coloring multigraphs asymptotically optimally. | 0 | 0.34 | 2020 |
Beyond the Lovász Local Lemma: Point to Set Correlations and Their Algorithmic Applications | 0 | 0.34 | 2019 |
Fisher zeros and correlation decay in the Ising model. | 3 | 0.47 | 2019 |
A Deterministic Algorithm for Counting Colorings with 2-Delta Colors | 0 | 0.34 | 2019 |
A New Perspective on Stochastic Local Search and the Lovasz Local Lemma. | 0 | 0.34 | 2018 |
Spatial Mixing and Non-local Markov chains. | 1 | 0.36 | 2018 |
The Ising Partition Function: Zeros and Deterministic Approximation. | 10 | 0.65 | 2017 |
Spatial Mixing and Systematic Scan Markov chains. | 0 | 0.34 | 2016 |
Random-Cluster Dynamics in ℤ2. | 0 | 0.34 | 2016 |
Dynamics for the Mean-field Random-cluster Model. | 0 | 0.34 | 2015 |
Random-Cluster Dynamics in $\mathbb{Z}^2$ | 0 | 0.34 | 2015 |
Symbolic Integration and the Complexity of Computing Averages | 0 | 0.34 | 2015 |
Spatial mixing and the connective constant: optimal bounds | 9 | 0.60 | 2014 |
Spatial Mixing and Approximation Algorithms for Graphs with Bounded Connective Constant | 13 | 0.69 | 2013 |
Lee-Yang theorems and the complexity of computing averages | 4 | 0.43 | 2013 |
Random lattice triangulations: structure and algorithms | 2 | 0.44 | 2013 |
Delaying Satisfiability for Random 2SAT | 2 | 0.38 | 2013 |
Negative examples for sequential importance sampling of binary contingency tables | 16 | 1.72 | 2012 |
The Extended k-tree Algorithm | 18 | 0.94 | 2012 |
Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs | 30 | 1.07 | 2012 |
Almost settling the hardness of noncommutative determinant | 5 | 0.58 | 2011 |
Convergence to approximate Nash equilibria in congestion games | 99 | 4.11 | 2011 |
Mobile geometric graphs: detection, coverage and percolation | 25 | 1.05 | 2011 |
Mobile Geometric Graphs, and Detection and Communication Problems in Mobile Wireless Networks | 3 | 0.50 | 2010 |
Liftings Of Tree-Structured Markov Chains (Extended Abstract) | 0 | 0.34 | 2010 |
Sherali-adams relaxations of the matching polytope | 25 | 0.85 | 2009 |
Strong and Pareto Price of Anarchy in Congestion Games | 16 | 0.71 | 2009 |
Mixing time for the solid-on-solid model | 1 | 0.43 | 2009 |
Low Distortion Maps Between Point Sets | 38 | 1.66 | 2009 |
Fast mixing for independent sets, colorings, and other models on trees | 36 | 3.07 | 2007 |
On the satisfiability threshold and clustering of solutions of random 3-SAT formulas | 13 | 0.70 | 2007 |
Algebras with Polynomial Identities and Computing the Determinant | 15 | 0.93 | 2007 |
A general lower bound for mixing of single-site dynamics on graphs | 11 | 0.67 | 2005 |
Shuffling by semi-random transpositions | 3 | 0.59 | 2004 |
Cuts, Trees And L(1)-Embeddings Of Graphs | 43 | 4.18 | 2004 |
Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions | 38 | 2.14 | 2004 |
Mixing in time and space for lattice spin systems: A combinatorial view | 15 | 1.89 | 2004 |
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries | 300 | 26.29 | 2004 |
Finding Points on Curves over Finite Fields | 7 | 0.77 | 2003 |
The Ising Model on Trees: Boundary Conditions and Mixing Time | 9 | 1.23 | 2003 |
Embedding k-Outerplanar Graphs into l1 | 18 | 1.16 | 2003 |
Spatial codes and the hardness of string folding problems. | 11 | 5.55 | 1999 |
Spatial Codes and the Hardness of String Folding Problems (Extended Abstract) | 1 | 0.35 | 1998 |
Biased random walks, Lyapunov functions, and stochastic analysis of best fit bin packing | 15 | 1.51 | 1998 |
A computational view of population genetics | 38 | 4.80 | 1998 |
Markov Chain Algorithms For Planar Lattice Structures (Extended Abstract) | 11 | 2.17 | 1995 |
Polynomial-time approximation algorithms for the Ising model | 98 | 14.74 | 1993 |
Quadratic Dynamical Systems (Preliminary Version) | 7 | 1.03 | 1992 |