Pages that link to "Item:Q3719807"
From MaRDI portal
The following pages link to An upper and lower bound for clock synchronization (Q3719807):
Displayed 24 items.
- Gradient clock synchronization in dynamic networks (Q693764) (← links)
- Probabilistic clock synchronization (Q916348) (← links)
- Towards a real-time distributed computing model (Q1004326) (← links)
- On the possibility and impossibility of achieving clock synchronization (Q1077930) (← links)
- Optimal precision in the presence of uncertainty (Q1079953) (← links)
- A clock synchronization problem with random delays (Q1121019) (← links)
- Clock synchronization and the power of broadcasting (Q1176072) (← links)
- Linearizable read/write objects (Q1292436) (← links)
- Closed form bounds for clock synchronization under simple uncertainty assumptions (Q1603375) (← links)
- Improved time bounds for linearizable implementations of abstract data types (Q1627963) (← links)
- Trade-off results for connection management (Q1853581) (← links)
- Booting clock synchronization in partially synchronous systems with hybrid process and link failures (Q1954236) (← links)
- Lower bounds on message passing implementations of multiplicity-relaxed queues and stacks (Q2097352) (← links)
- Reconciling fault-tolerant distributed algorithms and real-time computing (Q2251157) (← links)
- Gradient clock synchronization (Q2375294) (← links)
- Verification of clock synchronization algorithms: experiments on a combination of deductive tools (Q2642981) (← links)
- Clock Synchronization and Estimation in Highly Dynamic Networks: An Information Theoretic Approach (Q3460704) (← links)
- Determination of Clock Synchronization Errors in Distributed Networks (Q4604632) (← links)
- Time is not a healer (Q5096164) (← links)
- Guaranteeing global synchronization in networks with stochastic interactions (Q5137675) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- Fault-tolerant algorithms for tick-generation in asynchronous logic (Q5501934) (← links)
- Self-stabilizing Byzantine clock synchronization with optimal precision (Q5920221) (← links)
- Brief Announcement: Improved, Partially-Tight Multiplicity Queue Lower Bounds (Q6202279) (← links)