Synchronous counting and computational algorithm design
From MaRDI portal
Publication:896024
DOI10.1016/j.jcss.2015.09.002zbMath1346.68038OpenAlexW1942094667MaRDI QIDQ896024
Christoph Lenzen, Siert Wieringa, Joel Rybicki, Danny Dolev, Janne H. Korhonen, Matti Järvisalo, Keijo Heljanko, Jukka Suomela
Publication date: 11 December 2015
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2015.09.002
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Distributed systems (68M14) Distributed algorithms (68W15)
Related Items
Synthesis of distributed algorithms with parameterized threshold guards, Efficient Counting with Optimal Resilience, Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits, Near-optimal self-stabilising counting and firing squads, Parameterized synthesis of self-stabilizing protocols in symmetric networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity-sensitive decision procedures for abstract argumentation
- A lower bound for the time to assure interactive consistency
- Efficiently solving quantified bit-vector formulas
- Towards Optimal Synchronous Counting
- Solving QBF with Counterexample Guided Refinement
- Finding Efficient Circuits for Ensemble Computation
- Lazy Synthesis
- Parameterized Synthesis
- Fast self-stabilizing byzantine tolerant digital clock synchronization
- SAT-Based Synthesis Methods for Safety Specs
- Resilience of mutual exclusion algorithms to transient memory faults
- Abstraction-Based Algorithm for 2QBF
- Self-stabilizing clock synchronization in the presence of Byzantine faults
- Counterexample-guided abstraction refinement for symbolic model checking
- Bounded Synthesis
- On Self-stabilizing Synchronous Actions Despite Byzantine Attacks
- Synthesis of Communicating Processes from Temporal Logic Specifications
- Reaching Agreement in the Presence of Faults
- The Byzantine generals strike again
- Synthesis of Self-Stabilising and Byzantine-Resilient Distributed Systems
- What Can be Computed Locally?
- Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT
- Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription
- Theory and Applications of Satisfiability Testing
- Optimal Sorting Networks
- Automated Technology for Verification and Analysis
- Generalization of a Probability Limit Theorem of Cramer
- Computer Aided Verification
