Random generation of combinatorial structures from a uniform
Theoretical Computer Science
How hard is it to marry at random? (On the approximation of the permanent)
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A random polynomial time algorithm for approximating the volume of convex bodies
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The random walk construction of uniform spanning trees and uniform labelled trees
SIAM Journal on Discrete Mathematics
Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Approximating the permanent of graphs with large factors
Theoretical Computer Science
Improved Bounds for Mixing Rates of Marked Chains and Multicommodity Flow
LATIN '92 Proceedings of the 1st Latin American Symposium on Theoretical Informatics
Connectivity Properties of Matroids
Connectivity Properties of Matroids
Sparsification—a technique for speeding up dynamic graph algorithms
Journal of the ACM (JACM)
Edge isoperimetry and rapid mixing on matroids and geometric Markov chains
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On Approximating the Number of Bases of Exchange Preserving Matroids
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Asymptotic Enumeration of Spanning Trees
Combinatorics, Probability and Computing
Journal of Combinatorial Theory Series A
Combinatorics, Probability and Computing
Positive Influence and Negative Dependence
Combinatorics, Probability and Computing
Negative correlation in graphs and matroids
Combinatorics, Probability and Computing
Expanders via random spanning trees
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Relationship privacy: output perturbation for queries with joins
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Some inequalities for whitney–tutte polynomials
Combinatorics, Probability and Computing
An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods
SIAM Journal on Computing
Negative dependence and srinivasan's sampling process
Combinatorics, Probability and Computing
On some Tutte polynomial sequences in the square lattice
Journal of Combinatorial Theory Series B
Conditional negative association for competing urns
Random Structures & Algorithms
| Hi-index | 0.00 |