Complexity of network synchronization
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound
- An improved algorithm for finding the median distributively
- Parallel \((\Delta +1)\)-coloring of constant-degree graphs
- Dual coordinate step methods for linear network flow problems
- The causal ordering abstraction and a simple way to implement it
- The synchronization problem in protocol testing and its complexity
- On sparse spanners of weighted graphs
- Coupling coefficients of a distributed execution
- Rapid convergence of a local load balancing algorithm for asynchronous rings
- The Steiner problem in distributed computing systems
- An optimal distributed algorithm for recognizing mesh-connected networks
- Low diameter graph decompositions
- Graph theoretical issues in computer networks
- Upper and lower bounds for stochastic marked graphs
- Tentative and definite distributed computations: An optimistic approach to network synchronization
- Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling
- The use of a synchronizer yields the maximum computation rate in distributed networks
- Restrictions of minimum spanner problems
- The local detection paradigm and its applications to self-stabilization
- Simple and efficient network decomposition and synchronization
- On the minimal time required for execution of distributed concurrent processes in synchronous modes
- Tree spanners of bounded degree graphs
- Distributed approximation of k-service assignment
- Distributed backup placement in networks
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
- On the use of random numbers in asynchronous simulation via rollback
- Fast leader election in anonymous rings with bounded expected delay
- Fault-containing self-stabilizing distributed protocols
- Sublinear fully distributed partition with applications
- Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model
- Making asynchronous distributed computations robust to noise
- Graph spanners: a tutorial review
- Constructing light spanners deterministically in near-linear time
- Light spanners for high dimensional norms via stochastic decompositions
- Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation
- Making Byzantine consensus live
- Gathering a Euclidean closed chain of robots in linear time
- Covering metric spaces by few trees
- Upper and lower bounds for the synchronizer performance in systems with probabilistic message loss
- Sparse covers for planar graphs and graphs that exclude a fixed minor
- Message lower bounds via efficient network synchronization
- Mixed-integer programming approaches for the tree \(t^*\)-spanner problem
- Causing communication closure: safe program composition with reliable non-FIFO channels
- Toward more localized local algorithms: removing assumptions concerning global knowledge
- Highly concurrent logically synchronous multicast
- Distributed strong diameter network decomposition
- Improved NP-hardness results for the minimum \(t\)-spanner problem on bounded-degree graphs
- On approximating tree spanners that are breadth first search trees
- Message Lower Bounds via Efficient Network Synchronization
- Spanners of de Bruijn and Kautz graphs
- The bit complexity of the predecessor problem
- Foundations of aggregation and synchronization in distributed systems
- Maintaining bipartite matchings in the presence of failures
- Fast fault-tolerant parallel communication and on-line maintenance for hypercubes using information dispersal
- The Iterated Restricted Immediate Snapshot Model
- Local Maps: New Insights into Mobile Agent Algorithms
- A linear time algorithm to construct a tree 4-spanner on trapezoid graphs
- A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs
- Distributed minimum dominating set approximations in restricted families of graphs
- Approximating Shortest Paths in Graphs
- Efficiency of Synchronous Versus Asynchronous Distributed Systems
- scientific article; zbMATH DE number 4028858 (Why is no real title available?)
- On the performance of a retransmission-based synchronizer
- Symmetry breaking depending on the chromatic number or the neighborhood growth
- Efficient distributed algorithms for single-source shortest paths and related problems on plane networks
- On the memory overhead of distributed snapshots
- Efficiency of semisynchronous versus asynchronous networks
- A new synchronizer design
- Testing the diameter of graphs
- Self-stabilizing Byzantine asynchronous unison
- An optimal parallel algorithm to construct a tree 3-spanner on interval graphs
- Unison, canon, and sluggish clocks in networks controlled by a synchronizer
- Repeated uncoordinated information dissemination by flooding
- Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs
- Making Asynchronous Distributed Computations Robust to Channel Noise
- Distance-Preserving Graph Contractions
- New transience bounds for max-plus linear systems
- Neighborhood graphs and distributed Δ+1-coloring
- Generating sparse spanners for weighted graphs
- Low-diameter graph decomposition is in NC
- Constructing Light Spanners Deterministically in Near-Linear Time
- scientific article; zbMATH DE number 7559466 (Why is no real title available?)
- scientific article; zbMATH DE number 7561256 (Why is no real title available?)
- Derandomizing distributed algorithms with small messages: spanners and dominating set
- Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model
- The Synergy of Finite State Machines
- Covering Metric Spaces by Few Trees
- Distributed shortest-path protocols for time-dependent networks
- A self-stabilizing algorithm for the maximum flow problem
- An efficient distributed algorithm for constructing small dominating sets
- Hundreds of impossibility results for distributed computing
- Improved guarantees for vertex sparsification in planar graphs
- Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs
- Distance-Preserving Graph Contractions
- scientific article; zbMATH DE number 222692 (Why is no real title available?)
- Graph Transformations
- A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
- Fundamental Limits on Synchronizing Clocks Over Networks
- On the Complexity of Network Synchronization
- A fault-containing self-stabilizing \((3-\frac 2{\varDelta+1})\)-approximation algorithm for vertex cover in anonymous networks
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)
