scientific article; zbMATH DE number 2061537

zbMATH Open1039.68518MaRDI QIDQ4457215FDOQ4457215

Authors Ariel Daliot, Danny Dolev, Hanna Parnas

Publication date 21 March 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2704/27040032.htm

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• On Self-stabilizing Synchronous Actions Despite Byzantine Attacks
• Principles of Distributed Systems
• Self-stabilising Byzantine clock synchronisation is almost as easy as consensus
• Self-stabilising Byzantine clock synchronisation is almost as easy as consensus
• Self-stabilization of Byzantine Protocols

Cited in

(9)

• Self-organizing Desynchronization and TDMA on Wireless Sensor Networks
• Round-Oblivious Stabilizing Consensus in Dynamic Networks
• Synchronous counting and computational algorithm design
• On specifications and proofs of timed circuits
• Fault-tolerant algorithms for tick-generation in asynchronous logic: robust pulse generation
• Rigorously modeling self-stabilizing fault-tolerant circuits: an ultra-robust clocking scheme for systems-on-chip
• scientific article; zbMATH DE number 6536313 (Why is no real title available?)
• Global synchronization of pulse-coupled oscillators on trees
• Fast computation by population protocols with a leader

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4457215)