The following pages link to (Q4325545):
Displaying 39 items.
- Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms (Q294745) (← links)
- A distributed approximation algorithm for the minimum degree minimum weight spanning trees (Q436669) (← links)
- On the impact of link faults on Byzantine agreement (Q476176) (← links)
- Sublinear bounds for randomized leader election (Q477103) (← links)
- Formalization and correctness of the PALS architectural pattern for distributed real-time systems (Q714796) (← links)
- Some problems in distributed computational geometry (Q719317) (← links)
- Linear election in pancake graphs (Q963349) (← links)
- Ranks of graphs: The size of acyclic orientation cover for deadlock-free packet routing (Q1022603) (← links)
- Developing topology discovery in Event-B (Q1044181) (← links)
- Theories for mechanical proofs of imperative programs (Q1267030) (← links)
- Verifying identical communicating processes is undecidable (Q1269916) (← links)
- Self-stabilizing ring orientation using constant space (Q1271475) (← links)
- A self-stabilizing distributed algorithm to find the median of a tree graph (Q1305938) (← links)
- A mechanical proof of Segall's PIF algorithm (Q1362774) (← links)
- Petri net based verification of distributed algorithms: An example (Q1377301) (← links)
- Deadlock prevention by acyclic orientations (Q1399106) (← links)
- Gossiping and broadcasting versus computing functions in networks. (Q1427193) (← links)
- Choosing social laws for multi-agent systems: Minimality and simplicity (Q1575182) (← links)
- A survey on interval routing (Q1575744) (← links)
- Exact communication costs for consensus and leader in a tree (Q1827285) (← links)
- Some remarks on distributed depth-first search. (Q1853008) (← links)
- Optimistic atomic broadcast: A pragmatic viewpoint (Q1870527) (← links)
- Self-stabilization with path algebra (Q1870595) (← links)
- Randomized leader election (Q1954216) (← links)
- The doomsday distributed termination detection protocol (Q1954217) (← links)
- A fast distributed approximation algorithm for minimum spanning trees (Q1954259) (← links)
- Optimized silent self-stabilizing scheme for tree-based constructions (Q2072099) (← links)
- Fault-tolerant multiparty session types (Q2165214) (← links)
- Distributed computation in dynamic networks via random walks (Q2345448) (← links)
- A synchronous \(\pi\)-calculus (Q2381508) (← links)
- Broadcasting in unlabeled hypercubes with a linear number of messages. (Q2583557) (← links)
- Optimization of information exchange in a network of autonomous participants (Q2695085) (← links)
- Graphs and Algorithms in Communication Networks on Seven League Boots (Q3404458) (← links)
- Gossiping and broadcasting versus computing functions in networks (Q5047171) (← links)
- Deadlock-free interval routing schemes (Q5048937) (← links)
- Distributed Graph Algorithms and their Complexity: An Introduction (Q5135263) (← links)
- Обобщение усредненных моделей с введением трeхмерного пространства (Q5221884) (← links)
- Self-stabilization of wait-free shared memory objects (Q6084562) (← links)
- Termination of amnesiac flooding (Q6099033) (← links)
