Synchronous counting and computational algorithm design
DOI10.1016/J.JCSS.2015.09.002zbMATH Open1346.68038OpenAlexW1942094667MaRDI QIDQ896024FDOQ896024
Authors: Danny Dolev, Keijo Heljanko, Matti Järvisalo, Janne H. Korhonen, Christoph Lenzen, Joel Rybicki, Jukka Suomela, Siert Wieringa 
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
Recommendations
Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15) Network design and communication in computer systems (68M10) Distributed systems (68M14)
Cites Work
- Theory and Applications of Satisfiability Testing
- Efficiently solving quantified bit-vector formulas
- Solving QBF with counterexample guided refinement
- Abstraction-based algorithm for 2QBF
- Counterexample-guided abstraction refinement for symbolic model checking
- Title not available (Why is that?)
- Title not available (Why is that?)
- Counterexample guided abstraction refinement algorithm for propositional circumscription
- Title not available (Why is that?)
- Self-stabilization
- Title not available (Why is that?)
- Generalization of a Probability Limit Theorem of Cramer
- Finding efficient circuits for ensemble computation
- SAT-Based Synthesis Methods for Safety Specs
- Title not available (Why is that?)
- Reaching Agreement in the Presence of Faults
- The Byzantine generals strike again
- Title not available (Why is that?)
- Complexity-sensitive decision procedures for abstract argumentation
- Theorem proving using lazy proof explication.
- Optimal sorting networks
- Bounded Synthesis
- Synthesis of Communicating Processes from Temporal Logic Specifications
- A lower bound for the time to assure interactive consistency
- Temporal induction by incremental SAT solving
- Automated Technology for Verification and Analysis
- Fast self-stabilizing Byzantine tolerant digital clock synchronization
- Self-stabilizing clock synchronization in the presence of Byzantine faults
- On Self-stabilizing Synchronous Actions Despite Byzantine Attacks
- Synthesis of self-stabilising and Byzantine-resilient distributed systems
- Towards optimal synchronous counting
- What Can be Computed Locally?
- Lazy synthesis
- Parameterized synthesis
- Resilience of mutual exclusion algorithms to transient memory faults
- Title not available (Why is that?)
- Synthesizing shortest linear straight-line programs over \(\mathrm{GF}(2)\) using SAT
- Title not available (Why is that?)
Cited In (8)
- Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits
- Efficient counting with optimal resilience
- Efficient counting with optimal resilience
- Near-optimal self-stabilising counting and firing squads
- Title not available (Why is that?)
- Parameterized synthesis of self-stabilizing protocols in symmetric networks
- Towards optimal synchronous counting
- Synthesis of distributed algorithms with parameterized threshold guards
Uses Software
This page was built for publication: Synchronous counting and computational algorithm design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896024)
