Pages that link to "Item:Q1603375"
From MaRDI portal
The following pages link to Closed form bounds for clock synchronization under simple uncertainty assumptions (Q1603375):
Displaying 8 items.
- HEX: scaling honeycombs is easier than scaling clock trees (Q269518) (← links)
- Gradient clock synchronization in dynamic networks (Q693764) (← links)
- Towards a real-time distributed computing model (Q1004326) (← links)
- Improved time bounds for linearizable implementations of abstract data types (Q1627963) (← links)
- Gradient clock synchronization (Q2375294) (← links)
- Clock Synchronization and Estimation in Highly Dynamic Networks: An Information Theoretic Approach (Q3460704) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- Fault-tolerant algorithms for tick-generation in asynchronous logic (Q5501934) (← links)
