Pages that link to "Item:Q3765248"
From MaRDI portal
The following pages link to Complexity of network synchronization (Q3765248):
Displaying 50 items.
- On approximating tree spanners that are breadth first search trees (Q269500) (← links)
- Spanners of de Bruijn and Kautz graphs (Q287077) (← links)
- The bit complexity of the predecessor problem (Q287147) (← links)
- Distributed minimum dominating set approximations in restricted families of graphs (Q360271) (← links)
- On the performance of a retransmission-based synchronizer (Q392190) (← links)
- Symmetry breaking depending on the chromatic number or the neighborhood growth (Q392191) (← links)
- Self-stabilizing Byzantine asynchronous unison (Q455967) (← links)
- Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs (Q487267) (← links)
- New transience bounds for max-plus linear systems (Q505429) (← links)
- A fault-containing self-stabilizing \((3-\frac 2{\varDelta+1})\)-approximation algorithm for vertex cover in anonymous networks (Q555319) (← links)
- The power of multimedia: Combining point-to-point and multi-access networks (Q582899) (← links)
- Distributed approximation of capacitated dominating sets (Q613113) (← links)
- Approximation of minimum weight spanners for sparse graphs (Q627187) (← links)
- On the complexity of distributed stable matching with small messages (Q660987) (← links)
- Distributed discovery of large near-cliques (Q661050) (← links)
- Anonymous wireless rings (Q673090) (← links)
- A lower bound on the period length of a distributed scheduler (Q689104) (← links)
- Efficient decentralized algorithms for the distributed trigger counting problem (Q693074) (← links)
- Formalization and correctness of the PALS architectural pattern for distributed real-time systems (Q714796) (← links)
- Some aspects of parallel and distributed iterative algorithms - a survey (Q805158) (← links)
- Graph spanners in the streaming model: An experimental study (Q834593) (← links)
- Small stretch \((\alpha ,\beta )\)-spanners in the streaming model (Q838152) (← links)
- A faster distributed protocol for constructing a minimum spanning tree (Q856405) (← links)
- An efficient distributed algorithm for maximum matching in general graphs (Q911306) (← links)
- Blocking versus nonblocking interprocess communication: A note on the effect on concurrency (Q917284) (← links)
- Fast deterministic distributed algorithms for sparse spanners (Q930906) (← links)
- Combinatorial network abstraction by trees and distances (Q954979) (← links)
- Streaming algorithm for graph spanners-single pass and constant processing time per edge (Q963343) (← links)
- Space efficient and time optimal distributed BFS tree construction (Q975469) (← links)
- Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound (Q1041222) (← links)
- An improved algorithm for finding the median distributively (Q1101218) (← links)
- Parallel \((\Delta +1)\)-coloring of constant-degree graphs (Q1108036) (← links)
- Dual coordinate step methods for linear network flow problems (Q1115790) (← links)
- The causal ordering abstraction and a simple way to implement it (Q1183422) (← links)
- On sparse spanners of weighted graphs (Q1196368) (← links)
- Coupling coefficients of a distributed execution (Q1208733) (← links)
- Rapid convergence of a local load balancing algorithm for asynchronous rings (Q1292435) (← links)
- The Steiner problem in distributed computing systems (Q1310949) (← links)
- An optimal distributed algorithm for recognizing mesh-connected networks (Q1314373) (← links)
- Low diameter graph decompositions (Q1316650) (← links)
- Graph theoretical issues in computer networks (Q1319540) (← links)
- Upper and lower bounds for stochastic marked graphs (Q1321817) (← links)
- Tentative and definite distributed computations: An optimistic approach to network synchronization (Q1330420) (← links)
- Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling (Q1331949) (← links)
- The use of a synchronizer yields the maximum computation rate in distributed networks (Q1364128) (← links)
- Restrictions of minimum spanner problems (Q1370655) (← links)
- The local detection paradigm and its applications to self-stabilization (Q1389769) (← links)
- Simple and efficient network decomposition and synchronization (Q1575640) (← links)
- Tree spanners of bounded degree graphs (Q1693164) (← links)
- Distributed approximation of \(k\)-service assignment (Q1733389) (← links)
