Trading space for time in undirected s-t connectivity
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
Distributed probabilistic polling and applications to proportionate agreement
Information and Computation
IEEE Transactions on Parallel and Distributed Systems
A stochastic process on the hypercube with applications to peer-to-peer networks
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
The cover time, the blanket time, and the Matthews bound
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Randomized protocols for asynchronous consensus
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
The Cover Time of Random Regular Graphs
SIAM Journal on Discrete Mathematics
Random walks in peer-to-peer networks: algorithms and evaluation
Performance Evaluation - P2P computing systems
The power of choice in random walks: an empirical study
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Discrete Applied Mathematics
Tight bounds for distributed selection
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Many random walks are faster than one
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Random walks, universal traversal sequences, and the complexity of maze problems
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Flooding time in edge-Markovian dynamic graphs
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Memory Efficient Anonymous Graph Exploration
Graph-Theoretic Concepts in Computer Science
Tight Bounds for the Cover Time of Multiple Random Walks
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Parsimonious flooding in dynamic graphs
Proceedings of the 28th ACM symposium on Principles of distributed computing
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
Impact of local topological information on random walks on finite graphs
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Probabilistic local majority voting for the agreement problem on finite graphs
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Speeding up random walks with neighborhood exploration
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Multiple Random Walks in Random Regular Graphs
SIAM Journal on Discrete Mathematics
A tight upper bound on the cover time for random walks on graphs
Random Structures & Algorithms
A tight lower bound on the cover time for random walks on graphs
Random Structures & Algorithms
Stabilizing consensus with the power of two choices
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Cover times, blanket times, and majorizing measures
Proceedings of the forty-third annual ACM symposium on Theory of computing
More efficient periodic traversal in anonymous undirected graphs
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Universal adaptive self-stabilizing traversal scheme: Random walk and reloading wave
Journal of Parallel and Distributed Computing
Deterministic walks with choice
Discrete Applied Mathematics
| Hi-index | 0.00 |