STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Generating random spanning trees more quickly than the cover time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
RCN algorithms for the uniform generation of combinatorial structures
Proceedings of the seventh annual ACM-SIAM symposium on Discrete 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
Exact Sampling in Machine Scheduling Problems
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
On the number of broadcast schemes in networks
Information Processing Letters
Shuffling biological sequences with motif constraints
Journal of Discrete Algorithms
How to Compute Times of Random Walks Based Distributed Algorithms
Fundamenta Informaticae
Expanders via random spanning trees
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A Generic Distributed Algorithm for Computing by Random Mobile Agents
Agent Computing and Multi-Agent Systems
Efficient distributed random walks with applications
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
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
SAPPER: subgraph indexing and approximate matching in large graphs
Proceedings of the VLDB Endowment
Limiting the spread of misinformation in social networks
Proceedings of the 20th international conference on World wide web
Diameter of random spanning trees in a given graph
Journal of Graph Theory
Simulating Size-constrained Galton-Watson Trees
SIAM Journal on Computing
The distribution of height and diameter in random non-plane binary trees
Random Structures & Algorithms
How to Compute Times of Random Walks Based Distributed Algorithms
Fundamenta Informaticae
Chip-firing games, potential theory on graphs, and spanning trees
Journal of Combinatorial Theory Series A
Universal adaptive self-stabilizing traversal scheme: Random walk and reloading wave
Journal of Parallel and Distributed Computing
A distributed clustering algorithm for large-scale dynamic networks
Cluster Computing
Network-wide local unambiguous failure localization (NWL-UFL) via monitoring trails
IEEE/ACM Transactions on Networking (TON)
What do large networks look like?
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Nested clusters with intercluster routing
The Journal of Supercomputing
| Hi-index | 0.00 |