On the Complexity of Adding Convergence

DOI10.1007/978-3-642-40213-5_2zbMath1434.68110OpenAlexW2155664147MaRDI QIDQ2948235

Alex Klinkhamer, Ali Ebnenasir

Publication date: 30 September 2015

Published in: Fundamentals of Software Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40213-5_2

zbMATH Keywords

convergenceNP-completenessdistributed programsself-stabilization

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

Parameterized synthesis of self-stabilizing protocols in symmetric networks ⋮ Parameterized Synthesis of Self-Stabilizing Protocols in Symmetric Rings ⋮ Unnamed Item

This page was built for publication: On the Complexity of Adding Convergence