Self-stabilizing clock synchronization in the presence of Byzantine faults
From MaRDI portal
Publication:3069909
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
Cited in
(39)- 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
- Clock synchronization with faults and recoveries (extended abstract)
- On Self-stabilizing Synchronous Actions Despite Byzantine Attacks
- Perennial secure multi-party computation of universal Turing machine
- Self-stabilising Byzantine clock synchronisation is almost as easy as consensus
- Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits
- Self-stabilizing Byzantine clock synchronization with optimal precision
- Self-stabilizing Byzantine clock synchronization with optimal precision
- Randomization adaptive self-stabilization
- Principles of Distributed Systems
- A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks
- Secure and self-stabilizing clock synchronization in sensor networks
- scientific article; zbMATH DE number 1304101 (Why is no real title available?)
- Practically-self-stabilizing virtual synchrony
- Efficient counting with optimal resilience
- Parallel composition for time-to-fault adaptive stabilization
- Self-stabilizing Byzantine asynchronous unison
- Self-stabilization of Byzantine Protocols
- The triumph and tribulation of system stabilization
- Fault-tolerant algorithms for tick-generation in asynchronous logic: robust pulse generation
- Dynamic FTSS in asynchronous systems: the case of unison
- Robust and scalable middleware for selfish-computer systems
- Synchronous counting and computational algorithm design
- Fast computation by population protocols with a leader
- Near-optimal self-stabilising counting and firing squads
- Dynamic ad hoc clock synchronization
- Self-stabilizing indulgent zero-degrading binary consensus
- 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
- Fast self-stabilizing Byzantine tolerant digital clock synchronization
- Self-stabilizing Byzantine agreement
- Booting clock synchronization in partially synchronous systems with hybrid process and link failures
- Secret Swarm Unit Reactive k −Secret Sharing
- Preserving stabilization while \textit{practically} bounding state space using incorruptible partially synchronized clocks
- scientific article; zbMATH DE number 4058836 (Why is no real title available?)
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)
