On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
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
Compact, adaptive placement schemes for non-uniform requirements
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Filtering Random Graphs to Synthesize Interconnection Networks with Multiple Objectives
IEEE Transactions on Parallel and Distributed Systems
On the asymmetry of random regular graphs and random graphs
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
Combinatorics, Probability and Computing
Generating Random Regular Graphs Quickly
Combinatorics, Probability and Computing
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
Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums
Journal of Combinatorial Theory Series A
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
Araneola: A scalable reliable multicast system for dynamic environments
Journal of Parallel and Distributed Computing
The probability that a random multigraph is simple
Combinatorics, Probability and Computing
Subgraphs of random k-edge-coloured k-regular graphs
Combinatorics, Probability and Computing
Uniform sampling of digraphs with a fixed degree sequence
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Hamilton Cycles in Random Graphs with a Fixed Degree Sequence
SIAM Journal on Discrete Mathematics
Expanders are universal for the class of all spanning trees
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Jellyfish: networking data centers, randomly
HotCloud'11 Proceedings of the 3rd USENIX conference on Hot topics in cloud computing
Jellyfish: networking data centers randomly
NSDI'12 Proceedings of the 9th USENIX conference on Networked Systems Design and Implementation
Survey: The cook-book approach to the differential equation method
Computer Science Review
Approximate counting of regular hypergraphs
Information Processing Letters
| Hi-index | 0.00 |