scientific article; zbMATH DE number 732976

Publication date: 12 March 1995

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

distributed systems probabilistic algorithms computer communication networks protocols

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Network design and communication in computer systems (68M10) Distributed algorithms (68W15)

Related Items (47)

Gossiping and broadcasting versus computing functions in networks ⋮ Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms ⋮ Deadlock-free interval routing schemes ⋮ A synchronous \(\pi\)-calculus ⋮ A mechanical proof of Segall's PIF algorithm ⋮ Fault-tolerant multiparty session types ⋮ Petri net based verification of distributed algorithms: An example ⋮ Improved deterministic leader election in diameter-two networks ⋮ Termination of amnesiac flooding ⋮ Deadlock prevention by acyclic orientations ⋮ A Stabilizing Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Networks ⋮ Optimization of information exchange in a network of autonomous participants ⋮ A distributed approximation algorithm for the minimum degree minimum weight spanning trees ⋮ Randomized leader election ⋮ The doomsday distributed termination detection protocol ⋮ A fast distributed approximation algorithm for minimum spanning trees ⋮ Gossiping and broadcasting versus computing functions in networks. ⋮ Distributed Graph Algorithms and their Complexity: An Introduction ⋮ Proving convergence of self-stabilizing systems using first-order rewriting and regular languages ⋮ On the impact of link faults on Byzantine agreement ⋮ Sublinear bounds for randomized leader election ⋮ Self-stabilization of wait-free shared memory objects ⋮ Calculs approchés de la borne inférieure de valeurs réparties ⋮ Linear election in pancake graphs ⋮ Formalization and correctness of the PALS architectural pattern for distributed real-time systems ⋮ Deterministic Models of Communication Faults ⋮ Some problems in distributed computational geometry ⋮ Searching games with errors -- fifty years of coping with liars ⋮ Online algorithms for page replication in rings ⋮ Efficient distributed approximation algorithms via probabilistic tree embeddings ⋮ Theories for mechanical proofs of imperative programs ⋮ Обобщение усредненных моделей с введением трeхмерного пространства ⋮ Verifying identical communicating processes is undecidable ⋮ Ranks of graphs: The size of acyclic orientation cover for deadlock-free packet routing ⋮ Self-stabilizing ring orientation using constant space ⋮ Graphs and Algorithms in Communication Networks on Seven League Boots ⋮ Optimized silent self-stabilizing scheme for tree-based constructions ⋮ Exact communication costs for consensus and leader in a tree ⋮ Choosing social laws for multi-agent systems: Minimality and simplicity ⋮ A survey on interval routing ⋮ Developing topology discovery in Event-B ⋮ A self-stabilizing distributed algorithm to find the median of a tree graph ⋮ Some remarks on distributed depth-first search. ⋮ Broadcasting in unlabeled hypercubes with a linear number of messages. ⋮ Distributed computation in dynamic networks via random walks ⋮ Optimistic atomic broadcast: A pragmatic viewpoint ⋮ Self-stabilization with path algebra

This page was built for publication: