RCN algorithms for the uniform generation of combinatorial structures
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Simple Markov-chain algorithms for generating bipartite graphs and tournaments
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Approximately counting Hamilton cycles in dense graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Generating random regular graphs
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Generating Random Regular Graphs Quickly
Combinatorics, Probability and Computing
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
Journal of the ACM (JACM)
Sampling regular graphs and a peer-to-peer network
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Peer-to-peer networks based on random transformations of connected regular undirected graphs
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Sampling binary contingency tables with a greedy start
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On unbiased sampling for unstructured peer-to-peer networks
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
A Sequential Algorithm for Generating Random Graphs
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
On unbiased sampling for unstructured peer-to-peer networks
IEEE/ACM Transactions on Networking (TON)
Liftings of tree-structured Markov chains
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Constructing and sampling graphs with a prescribed joint degree distribution
Journal of Experimental Algorithmics (JEA)
Are we there yet? when to stop a markov chain while generating random graphs
WAW'12 Proceedings of the 9th international conference on Algorithms and Models for the Web Graph
Hi-index | 5.23 |