Complexity of network synchronization
From MaRDI portal
Publication:3765248
Recommendations
Cited in
(only showing first 100 items - show all)- On the performance of a retransmission-based synchronizer
- Symmetry breaking depending on the chromatic number or the neighborhood growth
- Some aspects of parallel and distributed iterative algorithms - a survey
- Efficiency of Synchronous Versus Asynchronous Distributed Systems
- Expected linear round synchronization: the missing link for linear Byzantine SMR
- scientific article; zbMATH DE number 222692 (Why is no real title available?)
- Graph spanners: a tutorial review
- Efficient distributed algorithms for single-source shortest paths and related problems on plane networks
- On the minimal time required for execution of distributed concurrent processes in synchronous modes
- Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation
- The local detection paradigm and its applications to self-stabilization
- A lower bound on the period length of a distributed scheduler
- Gathering a Euclidean closed chain of robots in linear time
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
- The Synergy of Finite State Machines
- A new synchronizer design
- Making Byzantine consensus live
- Constructing Light Spanners Deterministically in Near-Linear Time
- Making Byzantine consensus live
- Algorithms and Computation
- Testing the diameter of graphs
- Fast deterministic distributed algorithms for sparse spanners
- An efficient distributed algorithm for maximum matching in general graphs
- scientific article; zbMATH DE number 7561256 (Why is no real title available?)
- Distributed approximation of k-service assignment
- Efficiency of semisynchronous versus asynchronous networks
- Efficient decentralized algorithms for the distributed trigger counting problem
- Distance-Preserving Graph Contractions
- Distance-Preserving Graph Contractions
- On approximating tree spanners that are breadth first search trees
- Small stretch ( , )-spanners in the streaming model
- New transience bounds for max-plus linear systems
- Making local algorithms wait-free: the case of ring coloring
- Distributed backup placement in networks
- Parallel \((\Delta +1)\)-coloring of constant-degree graphs
- Generating sparse spanners for weighted graphs
- Space efficient and time optimal distributed BFS tree construction
- Covering Metric Spaces by Few Trees
- Foundations of aggregation and synchronization in distributed systems
- A fault-containing self-stabilizing \((3-\frac 2{\varDelta+1})\)-approximation algorithm for vertex cover in anonymous networks
- scientific article; zbMATH DE number 7650073 (Why is no real title available?)
- Upper and lower bounds for stochastic marked graphs
- Making asynchronous distributed computations robust to noise
- Liveness and latency of Byzantine state-machine replication
- A faster distributed protocol for constructing a minimum spanning tree
- Formalization and correctness of the PALS architectural pattern for distributed real-time systems
- Dual coordinate step methods for linear network flow problems
- Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions
- The synchronization problem in protocol testing and its complexity
- Message lower bounds via efficient network synchronization
- Spanners of de Bruijn and Kautz graphs
- The bit complexity of the predecessor problem
- A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs
- Hundreds of impossibility results for distributed computing
- Improved guarantees for vertex sparsification in planar graphs
- Low-diameter graph decomposition is in NC
- Distributed shortest-path protocols for time-dependent networks
- Upper and lower bounds for the synchronizer performance in systems with probabilistic message loss
- Unison, canon, and sluggish clocks in networks controlled by a synchronizer
- The power of multimedia: Combining point-to-point and multi-access networks
- Tentative and definite distributed computations: An optimistic approach to network synchronization
- On specifications and proofs of timed circuits
- Coupling coefficients of a distributed execution
- Combinatorial network abstraction by trees and distances
- Rapid convergence of a local load balancing algorithm for asynchronous rings
- Message Lower Bounds via Efficient Network Synchronization
- An optimal parallel algorithm to construct a tree 3-spanner on interval graphs
- Graph spanners in the streaming model: An experimental study
- A self-stabilizing algorithm for the maximum flow problem
- Highly concurrent logically synchronous multicast
- Derandomizing distributed algorithms with small messages: spanners and dominating set
- Simple and efficient network decomposition and synchronization
- Fault-containing self-stabilizing distributed protocols
- Tree spanners of bounded degree graphs
- On sparse spanners of weighted graphs
- Self-stabilizing Byzantine asynchronous unison
- Fundamental Limits on Synchronizing Clocks Over Networks
- Mixed-integer programming approaches for the tree \(t^*\)-spanner problem
- An improved algorithm for finding the median distributively
- Repeated uncoordinated information dissemination by flooding
- The causal ordering abstraction and a simple way to implement it
- Low diameter graph decompositions
- Sublinear fully distributed partition with applications
- Maintaining bipartite matchings in the presence of failures
- An optimal distributed algorithm for recognizing mesh-connected networks
- Graph theoretical issues in computer networks
- The Steiner problem in distributed computing systems
- Streaming algorithm for graph spanners-single pass and constant processing time per edge
- scientific article; zbMATH DE number 7559466 (Why is no real title available?)
- Polynomial algorithms for sparse spanners on subcubic graphs
- On the Complexity of Network Synchronization
- Causing communication closure: safe program composition with reliable non-FIFO channels
- On the memory overhead of distributed snapshots
- Local Maps: New Insights into Mobile Agent Algorithms
- Fast fault-tolerant parallel communication and on-line maintenance for hypercubes using information dispersal
- Restrictions of minimum spanner problems
- Approximation of minimum weight spanners for sparse graphs
- Covering metric spaces by few trees
- A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
- A Near-Optimal Deterministic Distributed Synchronizer
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)
