Synchronous counting and computational algorithm design
From MaRDI portal
Publication:896024
Recommendations
Cites work
- A lower bound for the time to assure interactive consistency
- Abstraction-based algorithm for 2QBF
- Automated Technology for Verification and Analysis
- Bounded Synthesis
- Complexity-sensitive decision procedures for abstract argumentation
- Counterexample guided abstraction refinement algorithm for propositional circumscription
- Counterexample-guided abstraction refinement for symbolic model checking
- Efficiently solving quantified bit-vector formulas
- Fast self-stabilizing Byzantine tolerant digital clock synchronization
- Finding efficient circuits for ensemble computation
- Generalization of a Probability Limit Theorem of Cramer
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 3870578 (Why is no real title available?)
- scientific article; zbMATH DE number 2061537 (Why is no real title available?)
- scientific article; zbMATH DE number 1903356 (Why is no real title available?)
- scientific article; zbMATH DE number 2090318 (Why is no real title available?)
- scientific article; zbMATH DE number 7075887 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- scientific article; zbMATH DE number 3189696 (Why is no real title available?)
- Lazy synthesis
- On Self-stabilizing Synchronous Actions Despite Byzantine Attacks
- Optimal sorting networks
- Parameterized synthesis
- Reaching Agreement in the Presence of Faults
- Resilience of mutual exclusion algorithms to transient memory faults
- SAT-Based Synthesis Methods for Safety Specs
- Self-stabilization
- Self-stabilizing clock synchronization in the presence of Byzantine faults
- Solving QBF with counterexample guided refinement
- Synthesis of Communicating Processes from Temporal Logic Specifications
- Synthesis of self-stabilising and Byzantine-resilient distributed systems
- Synthesizing shortest linear straight-line programs over \(\mathrm{GF}(2)\) using SAT
- Temporal induction by incremental SAT solving
- The Byzantine generals strike again
- Theorem proving using lazy proof explication.
- Theory and Applications of Satisfiability Testing
- Towards optimal synchronous counting
- What Can be Computed Locally?
Cited in
(8)- Efficient counting with optimal resilience
- Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits
- Parameterized synthesis of self-stabilizing protocols in symmetric networks
- Towards optimal synchronous counting
- Synthesis of distributed algorithms with parameterized threshold guards
- scientific article; zbMATH DE number 220144 (Why is no real title available?)
- Efficient counting with optimal resilience
- Near-optimal self-stabilising counting and firing squads
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)
