Self-stabilizing clock synchronization in the presence of Byzantine faults
DOI10.1145/1017460.1017463zbMATH Open1204.68094OpenAlexW1970745521WikidataQ56806106 ScholiaQ56806106MaRDI QIDQ3069909FDOQ3069909
Authors: Shlomi Dolev, Jennifer L. Welch 
Publication date: 1 February 2011
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1017460.1017463
Recommendations
- Principles of Distributed Systems
- Self-stabilizing Byzantine clock synchronization with optimal precision
- Fast self-stabilizing Byzantine tolerant digital clock synchronization
- On Self-stabilizing Synchronous Actions Despite Byzantine Attacks
- Self-stabilising Byzantine clock synchronisation is almost as easy as consensus
Randomized algorithms (68W20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Theory of operating systems (68N25)
Cited In (35)
- A distributed algorithm to prevent mutual drift between n logical clocks
- Realization of periodic functions by self-stabilizing population protocols with synchronous handshakes
- On self-stabilizing wait-free clock synchronization
- Efficient Counting with Optimal Resilience
- On Self-stabilizing Synchronous Actions Despite Byzantine Attacks
- Self-stabilizing Byzantine clock synchronization with optimal precision
- Self-stabilizing Byzantine clock synchronization with optimal precision
- Perennial secure multi-party computation of universal Turing machine
- Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits
- Principles of Distributed Systems
- Fault-tolerant algorithms for tick-generation in asynchronous logic
- Randomization adaptive self-stabilization
- A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks
- Title not available (Why is that?)
- Secure and self-stabilizing clock synchronization in sensor networks
- Practically-self-stabilizing virtual synchrony
- Parallel composition for time-to-fault adaptive stabilization
- The triumph and tribulation of system stabilization
- Self-stabilization of Byzantine Protocols
- Self-stabilizing Byzantine asynchronous unison
- Maximum metric spanning tree made Byzantine tolerant
- Dynamic FTSS in asynchronous systems: the case of unison
- Robust and scalable middleware for selfish-computer systems
- Synchronous counting and computational algorithm design
- Near-optimal self-stabilising counting and firing squads
- Fast computation by population protocols with a leader
- Self-stabilizing indulgent zero-degrading binary consensus
- Dynamic ad hoc clock synchronization
- Game authority for robust and scalable distributed selfish-computer systems
- Rigorously modeling self-stabilizing fault-tolerant circuits: an ultra-robust clocking scheme for systems-on-chip
- Self-stabilising Byzantine clock synchronisation is almost as easy as consensus
- Booting clock synchronization in partially synchronous systems
- Secret Swarm Unit Reactive k −Secret Sharing
- Booting clock synchronization in partially synchronous systems with hybrid process and link failures
- Title not available (Why is that?)
This page was built for publication: Self-stabilizing clock synchronization in the presence of Byzantine faults
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3069909)
