Pages that link to "Item:Q1077930"
From MaRDI portal
The following pages link to On the possibility and impossibility of achieving clock synchronization (Q1077930):
Displaying 16 items.
- Reconciling fault-tolerant distributed computing and systems-on-chip (Q424907) (← links)
- Gradient clock synchronization in dynamic networks (Q693764) (← links)
- The asynchronous bounded-cycle model (Q719298) (← links)
- Easy impossibility proofs for distributed consensus problems (Q1079947) (← links)
- A new fault-tolerant algorithm for clock synchronization (Q1104072) (← links)
- Clock synchronization and the power of broadcasting (Q1176072) (← links)
- Low-cost clock synchronization (Q1261107) (← links)
- Common knowledge revisited (Q1295439) (← links)
- Interval-based clock synchronization with optimal precision. (Q1426005) (← links)
- Improved time bounds for linearizable implementations of abstract data types (Q1627963) (← links)
- Booting clock synchronization in partially synchronous systems with hybrid process and link failures (Q1954236) (← links)
- Dynamic ad hoc clock synchronization (Q2056800) (← links)
- Random asynchronous iterations in distributed coordination algorithms (Q2280907) (← links)
- Rigorously modeling self-stabilizing fault-tolerant circuits: an ultra-robust clocking scheme for systems-on-chip (Q2637656) (← links)
- Time is not a healer (Q5096164) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
