The following pages link to Distributed network protocols (Q3313789):
Displaying 33 items.
- The expressive power of snap-stabilization (Q264569) (← links)
- Fast and compact self-stabilizing verification, computation, and fault detection of an MST (Q498670) (← links)
- Self-stabilizing leader election in polynomial steps (Q528197) (← links)
- The power of multimedia: Combining point-to-point and multi-access networks (Q582899) (← links)
- Location of central nodes in time varying computer networks (Q811350) (← links)
- Asynchronous distributed termination-parallel and symmetric solutions with echo algorithms (Q911262) (← links)
- A new optimal distributed algorithm for the set intersection problem (Q1178213) (← links)
- Two distributed problems involving Byzantine processes (Q1186434) (← links)
- Bounded time-stamps (Q1261108) (← links)
- A principle for sequential reasoning about distributed algorithms (Q1346611) (← links)
- A mechanical proof of Segall's PIF algorithm (Q1362774) (← links)
- Petri net based verification of distributed algorithms: An example (Q1377301) (← links)
- The local detection paradigm and its applications to self-stabilization (Q1389769) (← links)
- Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds (Q1741851) (← links)
- Exact communication costs for consensus and leader in a tree (Q1827285) (← links)
- Snap-stabilization and PIF in tree networks (Q1954227) (← links)
- A modular framework for verifying versatile distributed systems (Q2011199) (← links)
- Optimized silent self-stabilizing scheme for tree-based constructions (Q2072099) (← links)
- The first fully polynomial stabilizing algorithm for BFS tree construction (Q2272977) (← links)
- Distributed distance computation and routing with small messages (Q2422769) (← links)
- Efficient communication in unknown networks (Q2747804) (← links)
- ADAPTIVE DISTRIBUTED MUTUAL EXCLUSION BY DYNAMIC TOPOLOGY SWITCHING (Q2997929) (← links)
- Time-Efficient Broadcast in Radio Networks (Q3404475) (← links)
- Performance evaluation of fault-tolerant routing algorithms: an optimization problem (Q3835609) (← links)
- On the memory overhead of distributed snapshots (Q4262691) (← links)
- Efficiency of semisynchronous versus asynchronous networks (Q4311637) (← links)
- Deterministic Leader Election in Programmable Matter (Q5092343) (← links)
- On the complexity of global computation in the presence of link failures: the general case (Q5136985) (← links)
- Distributed shortest-path protocols for time-dependent networks (Q5137327) (← links)
- The wake up and report problem is time-equivalent to the firing squad synchronization problem (Q5138501) (← links)
- A distributed dual ascent algorithm for Steiner problems in multicast routing (Q5191138) (← links)
- ON THE COMPLEXITY OF SOME ADAPTIVE POLLING ALGORITHMS IN GENERAL NETWORKS (Q5249000) (← links)
- Termination of amnesiac flooding (Q6099033) (← links)
