Complexity of network synchronization
Journal of the ACM (JACM)
A fast and simple randomized parallel algorithm for maximal matching
Information Processing Letters
A fast and simple randomized parallel algorithm for the maximal independent set problem
Journal of Algorithms
Deterministic coin tossing with applications to optimal parallel list ranking
Information and Control
A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Parallel (&Dgr;+1)-coloring of constant-degree graphs
Information Processing Letters
Parallel symmetry-breaking in sparse graphs
SIAM Journal on Discrete Mathematics
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Self-stabilization by local checking and correction (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Locality in distributed graph algorithms
SIAM Journal on Computing
ACM Computing Surveys (CSUR)
Linear programming without the matrix
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Time optimal self-stabilizing synchronization
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
SIAM Journal on Computing
Self-stabilization
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Approximation algorithms
SIAM Journal on Computing
On the Distributed Complexity of Computing Maximal Matchings
SIAM Journal on Discrete Mathematics
Global Optimization Using Local Information with Applications to Flow Control
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Local computations on static and dynamic graphs
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
What cannot be computed locally!
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Some simple distributed algorithms for sparse networks
Distributed Computing
Distributed approximation: a survey
ACM SIGACT News
The price of being near-sighted
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Constant-time distributed dominating set approximation
Distributed Computing
On the complexity of distributed graph coloring
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Fault-Tolerant Clustering in Ad Hoc and Sensor Networks
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
What can be approximated locally?: case study: dominating sets in planar graphs
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Dynamic networks are as fast as static networks
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
A log-star distributed maximal independent set algorithm for growth-bounded graphs
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Fast Distributed Approximations in Planar Graphs
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Leveraging Linial's Locality Limit
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Tight Local Approximation Results for Max-Min Linear Programs
Algorithmic Aspects of Wireless Sensor Networks
Distributed (δ+1)-coloring in linear (in δ) time
Proceedings of the forty-first annual ACM symposium on Theory of computing
Weak graph colorings: distributed algorithms and applications
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
An optimal local approximation algorithm for max-min linear programs
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
A local 2-approximation algorithm for the vertex cover problem
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Distributed coloring in Õ (√log n) Bit Rounds
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Chameleon-MAC: adaptive and self-algorithms for media access control in mobile ad hoc networks
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Robust architectures for open distributed systems and topological self-stabilization: invited paper
Proceedings of the Third International Workshop on Reliability, Availability, and Security
DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
Fault tolerance is one of the main concepts in distributed computing. It has been tackled from different angles, e.g. by building replicated systems that can survive crash failures of individual components, or even systems that can tolerate a minority of arbitrarily malicious ("Byzantine") participants. Self-stabilization, a fault tolerance concept coined by the late Edsger W. Dijkstra in 1973 [1,2], is of a different stamp. A self-stabilizing system must survive arbitrary failures, beyond Byzantine failures, including for instance a total wipe out of volatile memory at all nodes. In other words, the system must self-heal and converge to a correct state even if starting in an arbitrary state, provided that no further faults happen.