Complexity of network synchronization
From MaRDI portal
Publication:3765248
Recommendations
Cited in
(only showing first 100 items - show all)- Low-diameter graph decomposition is in NC
- Polynomial algorithms for sparse spanners on subcubic graphs
- Making Asynchronous Distributed Computations Robust to Channel Noise
- Causing communication closure: safe program composition with reliable non-FIFO channels
- Coupling coefficients of a distributed execution
- Local Maps: New Insights into Mobile Agent Algorithms
- Expected linear round synchronization: the missing link for linear Byzantine SMR
- Distributed approximation of \(k\)-service assignment
- A new synchronizer design
- Constructing Light Spanners Deterministically in Near-Linear Time
- Distributed computing in the asynchronous LOCAL model
- Optimizing concurrency under Scheduling by Edge Reversal
- Making local algorithms wait-free: the case of ring coloring
- On the memory overhead of distributed snapshots
- Fast fault-tolerant parallel communication and on-line maintenance for hypercubes using information dispersal
- Efficient distributed algorithms for single-source shortest paths and related problems on plane networks
- Gathering a Euclidean closed chain of robots in linear time
- Faster deterministic distributed MIS and approximate matching
- Light spanners for high dimensional norms via stochastic decompositions
- Improved NP-hardness results for the minimum \(t\)-spanner problem on bounded-degree graphs
- Liveness and latency of Byzantine state-machine replication
- Sparse covers for planar graphs and graphs that exclude a fixed minor
- A Near-Optimal Deterministic Distributed Synchronizer
- scientific article; zbMATH DE number 7561256 (Why is no real title available?)
- Derandomizing distributed algorithms with small messages: spanners and dominating set
- Constructing light spanners deterministically in near-linear time
- Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs
- An optimal distributed algorithm for recognizing mesh-connected networks
- Graph theoretical issues in computer networks
- Unison, canon, and sluggish clocks in networks controlled by a synchronizer
- Highly concurrent logically synchronous multicast
- Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model
- Improved guarantees for vertex sparsification in planar graphs
- Message Lower Bounds via Efficient Network Synchronization
- On the Complexity of Network Synchronization
- Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model
- Algorithms and Computation
- scientific article; zbMATH DE number 7650073 (Why is no real title available?)
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
- Graph Transformations
- On the use of random numbers in asynchronous simulation via rollback
- Foundations of aggregation and synchronization in distributed systems
- Message lower bounds via efficient network synchronization
- Rapid convergence of a local load balancing algorithm for asynchronous rings
- Fast leader election in anonymous rings with bounded expected delay
- Upper and lower bounds for the synchronizer performance in systems with probabilistic message loss
- Neighborhood graphs and distributed Δ+1-coloring
- Making Byzantine consensus live
- Maintaining bipartite matchings in the presence of failures
- Expected linear round synchronization: the missing link for linear Byzantine SMR
- Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation
- Distributed strong diameter network decomposition
- Repeated uncoordinated information dissemination by flooding
- Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions
- A self-stabilizing algorithm for the maximum flow problem
- On the minimal time required for execution of distributed concurrent processes in synchronous modes
- Distributed dense subgraph detection and low outdegree orientation
- Toward more localized local algorithms: removing assumptions concerning global knowledge
- Making asynchronous distributed computations robust to noise
- Making Byzantine consensus live
- The Synergy of Finite State Machines
- Covering Metric Spaces by Few Trees
- Mixed-integer programming approaches for the tree \(t^*\)-spanner problem
- scientific article; zbMATH DE number 222692 (Why is no real title available?)
- Covering metric spaces by few trees
- Distance-Preserving Graph Contractions
- Distance-Preserving Graph Contractions
- Streaming algorithm for graph spanners-single pass and constant processing time per edge
- The causal ordering abstraction and a simple way to implement it
- Anonymous wireless rings
- Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound
- Tentative and definite distributed computations: An optimistic approach to network synchronization
- Simple and efficient network decomposition and synchronization
- On approximating tree spanners that are breadth first search trees
- The synchronization problem in protocol testing and its complexity
- Approximation of minimum weight spanners for sparse graphs
- New transience bounds for max-plus linear systems
- A linear time algorithm to construct a tree 4-spanner on trapezoid graphs
- Efficiency of Synchronous Versus Asynchronous Distributed Systems
- An efficient distributed algorithm for maximum matching in general graphs
- Fault-containing self-stabilizing distributed protocols
- On the performance of a retransmission-based synchronizer
- Distributed shortest-path protocols for time-dependent networks
- Symmetry breaking depending on the chromatic number or the neighborhood growth
- Blocking versus nonblocking interprocess communication: A note on the effect on concurrency
- Approximating Shortest Paths in Graphs
- The power of multimedia: Combining point-to-point and multi-access networks
- scientific article; zbMATH DE number 4028858 (Why is no real title available?)
- scientific article; zbMATH DE number 7559466 (Why is no real title available?)
- A fault-containing self-stabilizing \((3-\frac 2{\varDelta+1})\)-approximation algorithm for vertex cover in anonymous networks
- Spanners of de Bruijn and Kautz graphs
- The bit complexity of the predecessor problem
- Distributed approximation of capacitated dominating sets
- Combinatorial network abstraction by trees and distances
- Some aspects of parallel and distributed iterative algorithms - a survey
- Fundamental Limits on Synchronizing Clocks Over Networks
- The local detection paradigm and its applications to self-stabilization
- Tree spanners of bounded degree graphs
- Distributed backup placement in networks
- An improved algorithm for finding the median distributively
This page was built for publication: Complexity of network synchronization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3765248)
