A random polynomial-time algorithm for approximating the volume of convex bodies
Journal of the ACM (JACM)
Converting high probability into nearly-constant time—with applications to parallel hashing
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Fast parallel generation of random permutations
Proceedings of the 18th international colloquium on Automata, languages and programming
Algorithms for random generation and counting: a Markov chain approach
Algorithms for random generation and counting: a Markov chain approach
Cryptographic defense against traffic analysis
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Routing Permutations on Graphs Via Matchings
SIAM Journal on Discrete Mathematics
Tight analyses of two local load balancing algorithms
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Software protection and simulation on oblivious RAMs
Journal of the ACM (JACM)
The Markov chain Monte Carlo method: an approach to approximate counting and integration
Approximation algorithms for NP-hard problems
Dynamic load balancing by random matchings
Journal of Computer and System Sciences
Efficient low-contention parallel algorithms
Journal of Computer and System Sciences
Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers
SIAM Journal on Computing
SIAM Journal on Computing
RCN algorithms for the uniform generation of combinatorial structures
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
The QRQW PRAM: accounting for contention in parallel algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Faster random generation of linear extensions
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Scheduling and Load Balancing in Parallel and Distributed Systems
Scheduling and Load Balancing in Parallel and Distributed Systems
A Genuinely Polynomial-Time Algorithms for Sampling Two-Rowed Contingency Tables
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Path coupling: A technique for proving rapid mixing in Markov chains
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Markov chains and polynomial time algorithms
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Very rapid mixing of the Glauber dynamics for proper colorings on bounded-degree graphs
Random Structures & Algorithms
Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Local view attack on anonymous communication
ESORICS'05 Proceedings of the 10th European conference on Research in Computer Security
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
The Complexity of Distributions
SIAM Journal on Computing
| Hi-index | 0.00 |