On processor coordination using asynchronous hardware
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Uniform self-stabilizing rings
VLSI Algorithms and Architectures
Self-stabilization of dynamic systems assuming only read/write atomicity
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Self-stabilizing systems in spite of distributed control
Communications of the ACM
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On a random walk problem arising in self-stabilizing token management
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Resource bounds for self stabilizing message driven protocols
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Self-stabilizing symmetry breaking in constant-space (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Reasoning about probabilistic parallel programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Memory-efficient and self-stabilizing network RESET (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Probabilistic self-stabilizing mutual exclusion in uniform rings
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Memory requirements for silent stabilization
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Uniform and Self-Stabilizing Token Rings Allowing Unfair Daemon
IEEE Transactions on Parallel and Distributed Systems
Uniform Dynamic Self-Stabilizing Leader Election
IEEE Transactions on Parallel and Distributed Systems
A Self-Stabilizing Ring Orientation Algorithm With a Smaller Number of Processor States
IEEE Transactions on Parallel and Distributed Systems
Memory space requirements for self-stabilizing leader election protocols
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Fundamental control algorithms in mobile networks
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Self-stabilizing algorithms for synchronous unidirectional rings
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Fault-containing network protocols
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Self-stabilizing token circulation on asynchronous uniform unidirectional rings
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
IEEE Transactions on Parallel and Distributed Systems
Two-State Self-Stabilizing Algorithms for Token Rings
IEEE Transactions on Software Engineering
Analyzing Expected Time by Scheduler-Luck Games
IEEE Transactions on Software Engineering
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Token-based self-stabilizing uniform algorithms
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Randomized Finite-State Distributed Algorithms as Markov Chains
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
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
Tight Space Self-stabilizing Uniform l-Mutual Exclusion
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
A self-stabilizing algorithm for bridge finding
Distributed Computing
A self-stabilizing algorithm for the maximum flow problem
Distributed Computing
Self-stabilization: randomness to reduce space
Distributed Computing
Self-stabilization of dynamic systems assuming only read/write atomicity
Distributed Computing - Special issue: Self-stabilization
Random Walk for Self-Stabilizing Group Communication in Ad Hoc Networks
IEEE Transactions on Mobile Computing
Asynchronous deterministic rendezvous in graphs
Theoretical Computer Science
Coupling and self-stabilization
Distributed Computing - Special issue: DISC 04
On the expected time for Herman's probabilistic self-stabilizing algorithm
Theoretical Computer Science
How to Compute Times of Random Walks Based Distributed Algorithms
Fundamenta Informaticae
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
Game-Based Probabilistic Predicate Abstraction in PRISM
Electronic Notes in Theoretical Computer Science (ENTCS)
The hitting and cover times of random walks on finite graphs using local degree information
Theoretical Computer Science
Asynchronous Deterministic Rendezvous on the Line
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Proceedings of the 28th ACM symposium on Principles of distributed computing
The wandering token: Congestion avoidance of a shared resource
Future Generation Computer Systems
Quantitative Analysis With the Probabilistic Model Checker PRISM
Electronic Notes in Theoretical Computer Science (ENTCS)
Impact of local topological information on random walks on finite graphs
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Delays induce an exponential memory gap for rendezvous in trees
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
How to meet when you forget: log-space rendezvous in arbitrary graphs
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
How to meet asynchronously (almost) everywhere
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithms and theory of computation handbook
Almost optimal asynchronous rendezvous in infinite multidimensional grids
DISC'10 Proceedings of the 24th international conference on Distributed computing
A new method to automatically compute processing times for random walks based distributed algorithms
ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
Low memory distributed protocols for 2-coloring
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
A tight unconditional lower bound on distributed randomwalk computation
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
On stabilization in Herman's algorithm
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Random walks, interacting particles, dynamic networks: randomness can be helpful
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Flat holonomies on automata networks
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
How to meet in anonymous network
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Topological adaptability for the distributed token circulation paradigm in faulty environment
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Asynchronous deterministic rendezvous in graphs
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
A dynamic reconfiguration tolerant self-stabilizing token circulation algorithm in ad-hoc networks
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Polynomial deterministic rendezvous in arbitrary graphs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
On time analysis of random walk based token circulation algorithms
ISSADS'05 Proceedings of the 5th international conference on Advanced Distributed Systems
Request-based token passing for self-stabilizing mutual exclusion
Information Sciences: an International Journal
Loosely-Stabilizing leader election in population protocol model
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Random walks in distributed computing: a survey
IICS'04 Proceedings of the 4th international conference on Innovative Internet Community Systems
Loosely-stabilizing leader election in a population protocol model
Theoretical Computer Science
Time vs. space trade-offs for rendezvous in trees
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Efficient computation of distance sketches in distributed networks
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Coalescing random walks and voting on graphs
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
How to meet asynchronously (almost) everywhere
ACM Transactions on Algorithms (TALG)
How to Compute Times of Random Walks Based Distributed Algorithms
Fundamenta Informaticae
Universal adaptive self-stabilizing traversal scheme: Random walk and reloading wave
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |