Random generation of combinatorial structures from a uniform
Theoretical Computer Science
Optimization, approximation, and complexity classes
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Algorithms for random generation and counting: a Markov chain approach
Algorithms for random generation and counting: a Markov chain approach
A very simple algorithm for estimating the number of k-colorings of a low-degree graph
Random Structures & Algorithms
The Number of Independent Sets in a Grid Graph
SIAM Journal on Discrete Mathematics
Markov chain algorithms for planar lattice structures
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Clique is hard to approximate within n1-
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Exact sampling and approximate counting techniques
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The complexity of counting graph homomorphisms (extended abstract)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A Note on Bounding the Mixing Time by Linear Programming
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
On Counting Independent Sets in Sparse Graphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Convergence of the Iterated Prisoner's Dilemma Game
Combinatorics, Probability and Computing
Counting without sampling: new algorithms for enumeration problems using statistical physics
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Counting independent sets up to the tree threshold
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Random Structures & Algorithms
A worst-case time upper bound for counting the number of independent sets
CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
PTAS for maximum weight independent set problem with random weights in bounded degree graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximate counting via correlation decay in spin systems
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |