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
Deterministic simulation in LOGSPACE
STOC '87 Proceedings of the nineteenth 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
Trading space for time in undirected s-t connectivity
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The electrical resistance of a graph captures its commute and cover times
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Token management schemes and random walks yield self-stabilizing mutual exclusion
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
A technique for lower bounding the cover time
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
On the time to traverse all edges of a graph
Information Processing Letters
Fast connected components algorithms for the EREW PRAM
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Time-space trade-offs for undirected st-connectivity on a JAG
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
An optimal randomized logarithmic time connectivity algorithm for the EREW PRAM (extended abstract)
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Efficiently searching a graph by a smell-oriented vertex process
Annals of Mathematics and Artificial Intelligence
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
How Well Do Random Walks Parallelize?
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Performance of random walks in one-hop replication networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |