Pages that link to "Item:Q3765248"
From MaRDI portal
The following pages link to Complexity of network synchronization (Q3765248):
Displaying 50 items.
- Distributed backup placement in networks (Q1741963) (← links)
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks (Q1743719) (← links)
- On the use of random numbers in asynchronous simulation via rollback (Q1825689) (← links)
- Fast leader election in anonymous rings with bounded expected delay (Q1944153) (← links)
- Fault-containing self-stabilizing distributed protocols (Q1954231) (← links)
- Sublinear fully distributed partition with applications (Q1959378) (← links)
- Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model (Q1981632) (← links)
- Making asynchronous distributed computations robust to noise (Q2010600) (← links)
- Graph spanners: a tutorial review (Q2026289) (← links)
- Constructing light spanners deterministically in near-linear time (Q2077383) (← links)
- Light spanners for high dimensional norms via stochastic decompositions (Q2088589) (← links)
- Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation (Q2098190) (← links)
- Making Byzantine consensus live (Q2104036) (← links)
- Gathering a Euclidean closed chain of robots in linear time (Q2148881) (← links)
- Covering metric spaces by few trees (Q2168848) (← links)
- Upper and lower bounds for the synchronizer performance in systems with probabilistic message loss (Q2241637) (← links)
- Sparse covers for planar graphs and graphs that exclude a fixed minor (Q2249746) (← links)
- Message lower bounds via efficient network synchronization (Q2292919) (← links)
- Mixed-integer programming approaches for the tree \(t^*\)-spanner problem (Q2329685) (← links)
- Causing communication closure: safe program composition with reliable non-FIFO channels (Q2377131) (← links)
- Toward more localized local algorithms: removing assumptions concerning global knowledge (Q2441787) (← links)
- Highly concurrent logically synchronous multicast (Q2638776) (← links)
- Distributed strong diameter network decomposition (Q2672581) (← links)
- Improved NP-hardness results for the minimum \(t\)-spanner problem on bounded-degree graphs (Q2682929) (← links)
- Message Lower Bounds via Efficient Network Synchronization (Q2835018) (← links)
- Maintaining bipartite matchings in the presence of failures (Q3141219) (← links)
- Fast fault-tolerant parallel communication and on-line maintenance for hypercubes using information dispersal (Q3358214) (← links)
- The Iterated Restricted Immediate Snapshot Model (Q3511360) (← links)
- Local Maps: New Insights into Mobile Agent Algorithms (Q3540225) (← links)
- A linear time algorithm to construct a tree 4-spanner on trapezoid graphs (Q3568416) (← links)
- A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs (Q3599135) (← links)
- Approximating Shortest Paths in Graphs (Q3605483) (← links)
- Efficient distributed algorithms for single-source shortest paths and related problems on plane networks (Q4000864) (← links)
- On the memory overhead of distributed snapshots (Q4262691) (← links)
- Efficiency of semisynchronous versus asynchronous networks (Q4311637) (← links)
- Testing the diameter of graphs (Q4543626) (← links)
- An optimal parallel algorithm to construct a tree 3-spanner on interval graphs (Q4653706) (← links)
- Unison, canon, and sluggish clocks in networks controlled by a synchronizer (Q4850331) (← links)
- Repeated uncoordinated information dissemination by flooding (Q4861344) (← links)
- Making Asynchronous Distributed Computations Robust to Channel Noise (Q4993319) (← links)
- Distance-Preserving Graph Contractions (Q4993321) (← links)
- Neighborhood graphs and distributed Δ+1-coloring (Q5054815) (← links)
- Generating sparse spanners for weighted graphs (Q5056089) (← links)
- Low-diameter graph decomposition is in NC (Q5056131) (← links)
- Constructing Light Spanners Deterministically in Near-Linear Time (Q5075736) (← links)
- (Q5089274) (← links)
- (Q5090892) (← links)
- Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set (Q5090921) (← links)
- (Q5090930) (← links)
- The Synergy of Finite State Machines (Q5091099) (← links)
