scientific article; zbMATH DE number 732976
From MaRDI portal
Publication:4325545
zbMATH Open0826.68056MaRDI QIDQ4325545FDOQ4325545
Authors: Gerard Tel 
Publication date: 12 March 1995
Title of this publication is not available (Why is that?)
Recommendations
- Introduction to Distributed Algorithms
- Distributed algorithms. An intuitive approach
- scientific article; zbMATH DE number 996442
- scientific article; zbMATH DE number 49259
- Introduction à l'algorithmique des objets partagés
- scientific article; zbMATH DE number 2090633
- Distributed systems. An algorithmic approach
- Distributed Systems
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Distributed algorithms (68W15) Network design and communication in computer systems (68M10)
Cited In (66)
- Sense of direction in processor networks
- Store locally, prove globally
- Proving convergence of self-stabilizing systems using first-order rewriting and regular languages
- Improved deterministic leader election in diameter-two networks
- Self-stabilization of wait-free shared memory objects
- Termination of amnesiac flooding
- Flush primitives for asynchronous distributed systems
- Self-stabilization with path algebra
- Linear election in pancake graphs
- Introduction to Distributed Self-Stabilizing Algorithms
- Deadlock prevention by acyclic orientations
- Some remarks on distributed depth-first search.
- Theories for mechanical proofs of imperative programs
- Self-stabilizing ring orientation using constant space
- Searching games with errors -- fifty years of coping with liars
- Tolerating transient and intermittent failures
- Formalization and correctness of the PALS architectural pattern for distributed real-time systems
- Gossiping and broadcasting versus computing functions in networks.
- Title not available (Why is that?)
- A fast distributed approximation algorithm for minimum spanning trees
- A distributed approximation algorithm for the minimum degree minimum weight spanning trees
- Verifying identical communicating processes is undecidable
- Some problems in distributed computational geometry
- Evaluating the running time of a communication round over the Internet
- Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms
- Optimistic atomic broadcast: A pragmatic viewpoint
- Optimization of information exchange in a network of autonomous participants
- Gossiping and broadcasting versus computing functions in networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graphs and algorithms in communication networks on seven league boots
- Generalization of coarse-grained models with introduction of three-dimensional space
- Broadcasting in unlabeled hypercubes with a linear number of messages.
- Ranks of graphs: The size of acyclic orientation cover for deadlock-free packet routing
- Transience bounds for distributed algorithms
- A Stabilizing Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Networks
- A self-stabilizing distributed algorithm to find the median of a tree graph
- A synchronous \(\pi\)-calculus
- A survey on interval routing
- On the impact of link faults on Byzantine agreement
- Fault-tolerant multiparty session types
- The doomsday distributed termination detection protocol
- Online algorithms for page replication in rings
- Calculs approchés de la borne inférieure de valeurs réparties
- Developing topology discovery in Event-B
- Distributed graph algorithms and their complexity: an introduction
- Distributed network protocols
- Singularly optimal randomized leader election
- Efficient distributed approximation algorithms via probabilistic tree embeddings
- Title not available (Why is that?)
- Choosing social laws for multi-agent systems: Minimality and simplicity
- Optimized silent self-stabilizing scheme for tree-based constructions
- Deadlock-free interval routing schemes
- Title not available (Why is that?)
- Sublinear bounds for randomized leader election
- Title not available (Why is that?)
- Exact communication costs for consensus and leader in a tree
- Title not available (Why is that?)
- A mechanical proof of Segall's PIF algorithm
- On the number of active nodes in a multicomputer system
- Title not available (Why is that?)
- Deterministic Models of Communication Faults
- Randomized leader election
- Petri net based verification of distributed algorithms: An example
- Distributed computation in dynamic networks via random walks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4325545)
