Efficient stopping rules for Markov chains
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Uniform and Self-Stabilizing Token Rings Allowing Unfair Daemon
IEEE Transactions on Parallel and Distributed Systems
A new approach to effective circuit clustering
ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
Design of on-line algorithms using hitting times
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Compatible sequences and a slow Winkler percolation
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
IEEE Transactions on Parallel and Distributed Systems
Clairvoyant scheduling of random walks
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Evasive random walks and the clairvoyant demon
Random Structures & Algorithms
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks
Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
Deterministic approximation of the cover time
Random Structures & Algorithms
The Clairvoyant Demon Has a Hard Task
Combinatorics, Probability and Computing
On the Cover Time for Random Walks on Random Graphs
Combinatorics, Probability and Computing
Reversal of Markov Chains and the Forget Time
Combinatorics, Probability and Computing
A Note on Distributional Equality in the Cyclic Tour Property for Markov Chains
Combinatorics, Probability and Computing
On the expected time for Herman's probabilistic self-stabilizing algorithm
Theoretical Computer Science
Improved approximation of the minimum cover time
Theoretical Computer Science
Discrete Applied Mathematics
Deterministic rendezvous, treasure hunts and strongly universal exploration sequences
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
How to meet in anonymous network
Theoretical Computer Science
Deterministic Rendezvous in Trees with Little Memory
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
The hitting and cover times of random walks on finite graphs using local degree information
Theoretical Computer Science
On a form of coordinate percolation
Combinatorics, Probability and Computing
Proceedings of the 28th ACM symposium on Principles of distributed computing
A random walk model for infection on graphs
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Impact of local topological information on random walks on finite graphs
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
An algorithmic theory of mobile agents
TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Faster treasure hunt and better strongly universal exploration sequences
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Randomized rendez-vous with limited memory
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Exit frequency matrices for finite markov chains
Combinatorics, Probability and Computing
A random walk model for infection on graphs: spread of epidemics & rumours with mobile agents
Discrete Event Dynamic Systems
Multiple Random Walks in Random Regular Graphs
SIAM Journal on Discrete Mathematics
Randomized rendezvous with limited memory
ACM Transactions on Algorithms (TALG)
A tight unconditional lower bound on distributed randomwalk computation
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
How to meet in anonymous network
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Asynchronous deterministic rendezvous in graphs
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Polynomial deterministic rendezvous in arbitrary graphs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Efficient computation of distance sketches in distributed networks
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Some remarks on cops and drunk robbers
Theoretical Computer Science
Discrete Green's functions and random walks on graphs
Journal of Combinatorial Theory Series A
| Hi-index | 0.01 |