Unranking and ranking spanning trees of a graph
Journal of Algorithms
SIAM Journal on Computing
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Generating random combinatorial objects
Journal of Algorithms
The random walk construction of uniform spanning trees and uniform labelled trees
SIAM Journal on Discrete Mathematics
Stationarity detection in the initial transient problem
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Algorithms for random generation and counting: a Markov chain approach
Algorithms for random generation and counting: a Markov chain approach
What do we know about the Metropolis algorithm?
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Two algorithms for unranking arborescences
Journal of Algorithms
Exact sampling with coupled Markov chains and applications to statistical mechanics
Proceedings of the seventh international conference on Random structures and algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Determinant algorithms for random planar structures
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges
Proceedings of the 2002 ACM symposium on Applied computing
Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
On the number of broadcast schemes in networks
Information Processing Letters
Shuffling biological sequences with motif constraints
Journal of Discrete Algorithms
Ant Colony Optimization and the Minimum Spanning Tree Problem
Learning and Intelligent Optimization
Coloured loop-erased random walk on the complete graph
Combinatorics, Probability and Computing
Proceedings of the 28th ACM symposium on Principles of distributed computing
Consensus-based decentralized auctions for robusttask allocation
IEEE Transactions on Robotics
Reconstructing the topology of protein complexes
RECOMB'07 Proceedings of the 11th annual international conference on Research in computational molecular biology
Ant Colony Optimization and the minimum spanning tree problem
Theoretical Computer Science
GSST: anytime guaranteed search
Autonomous Robots
An O(log n/ log log n)-approximation algorithm for the asymmetric traveling salesman problem
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Limiting the spread of misinformation in social networks
Proceedings of the 20th international conference on World wide web
Fast simulation of large-scale growth models
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Chip-firing games, potential theory on graphs, and spanning trees
Journal of Combinatorial Theory Series A
Time hierarchies for sampling distributions
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Linear algebra and sequential importance sampling for network reliability
Proceedings of the Winter Simulation Conference
Journal of the ACM (JACM)
A fresh perspective: learning to sparsify for detection in massive noisy sensor networks
Proceedings of the 12th international conference on Information processing in sensor networks
Random spanning trees and the prediction ofweighted graphs
The Journal of Machine Learning Research
| Hi-index | 0.00 |