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)
Wait-free clock synchronization
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Unifying self-stabilization and fault-tolerance
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Time optimal self-stabilizing synchronization
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Memory-efficient and self-stabilizing network RESET (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Log-space polynomial end-to-end communication
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Uniform Dynamic Self-Stabilizing Leader Election
IEEE Transactions on Parallel and Distributed Systems
Self-stabilizing algorithms for synchronous unidirectional rings
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Self-stabilizing unidirectional network algorithms by power-supply
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Self-Stabilizing Strong Fairness under Weak Fairness
IEEE Transactions on Parallel and Distributed Systems
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
A stabilizing algorithm for finding biconnected components
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Universal dynamic synchronous self-stabilization
Distributed Computing
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Self-Stabilizing PIF Algorithm in Arbitrary Rooted Networks
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
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Distributed verification of minimum spanning trees
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Optimal snap-stabilizing PIF algorithms in un-oriented trees
Journal of High Speed Networks - Self-Stabilizing Systems, Part 2
Greedy distributed optimization of multi-commodity flows
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock
IEEE Transactions on Dependable and Secure Computing
Stateless distributed gradient descent for positive linear programs
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
A log-star distributed maximal independent set algorithm for growth-bounded graphs
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
An optimal snap-stabilizing wave algorithm in arbitrary graphs
Computer Communications
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Proceedings of the 28th ACM symposium on Principles of distributed computing
Local Algorithms: Self-stabilization on Speed
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
A Self-stabilizing and Local Delaunay Graph Construction
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
An improved snap-stabilizing PIF algorithm
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Spanders: distributed spanning expanders
Proceedings of the 2010 ACM Symposium on Applied Computing
Stateless near optimal flow control with poly-logarithmic convergence
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
Proceedings of the twenty-second annual ACM 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
A tranformational approach for designing scheduler-oblivious self-stabilizing algorithms
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
Distributed decision problems: the locality angle
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Fast and compact self stabilizing verification, computation, and fault detection of an MST
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Locality and checkability in wait-free computing
DISC'11 Proceedings of the 25th international conference on Distributed computing
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Sensor networks: distributed algorithms reloaded – or revolutions?
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Snap-stabilizing k-wave synchronizer
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part I
Tiara: A self-stabilizing deterministic skip list and skip graph
Theoretical Computer Science
Self-stabilizing mutual exclusion and group mutual exclusion for population protocols with covering
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Theoretical Computer Science
International Journal of Grid and Utility Computing
Hi-index | 0.00 |
The computational complexity of approximating omega (G), the size of the largest clique in a graph G, within a given factor is considered. It is shown that if certain approximation procedures exist, then EXPTIME=NEXPTIME and NP=P.