Sense of direction in distributed computing
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3864485 (Why is no real title available?)
- scientific article; zbMATH DE number 1262787 (Why is no real title available?)
- scientific article; zbMATH DE number 1140070 (Why is no real title available?)
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- A fully distributed (minimal) spanning tree algorithm
- A near-optimal multistage distributed algorithm for finding leaders in clustered chordal rings
- A trade-off between information and communication in broadcast protocols
- Backward consistency and sense of direction in advanced distributed systems
- Broadcasting in unlabeled hypercubes with a linear number of messages.
- Complexity of Deciding Sense of Direction
- Computing on an anonymous ring
- Computing on anonymous networks with sense of direction
- Coverings that preserve sense of direction
- Cycle regular graphs need not be transitive
- Distributed Computing on Anonymous Hypercube Networks
- Efficient elections in chordal ring networks
- Efficient leader election using sense of direction
- Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation
- Minimal sense of direction and decision problems for Cayley graphs
- Minimal sense of direction in regular networks
- On the impact of sense of direction on message complexity
- On the message complexity of distributed problems
- Optimal distributed algorithms in unlabeled tori and chordal rings
- Optimal elections in faulty loop networks and applications
- Perfect broadcasting in unlabeled networks
- Perspective in a box
- Sense of direction: Definitions, properties, and classes
- Symmetries and sense of direction in labeled graphs
- TOPOLOGICAL CONSTRAINTS FOR SENSE OF DIRECTION
- The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors
- Towards optimal distributed election on chordal rings
Cited in
(21)- Computing on anonymous networks with sense of direction
- Weak sense of direction labelings and graph embeddings
- On the impact of sense of direction on message complexity
- An Algorithmic Theory of Mobile Agents
- scientific article; zbMATH DE number 1185591 (Why is no real title available?)
- Rendezvous problem
- Lower bounds for sense of direction in regular graphs
- Sense of direction: Definitions, properties, and classes
- Setting port numbers for fast graph exploration
- scientific article; zbMATH DE number 3864485 (Why is no real title available?)
- Backward Consistency and Sense of Direction in Advanced Distributed Systems
- OPTIMAL CONSTRUCTION OF SENSE OF DIRECTION IN A TORUS BY A MOBILE AGENT
- Interval routing schemes allow broadcasting with linear message-complexity
- Improved periodic data retrieval in asynchronous rings with a faulty host
- Complexity of Deciding Sense of Direction
- Searching for a black hole in arbitrary networks: optimal mobile agents protocols
- A survey on interval routing
- Coverings that preserve sense of direction
- Exploration of Time-Varying Connected Graphs with Silent Agents
- A decision-theoretic approach to reliable message delivery
- Tree exploration with advice
This page was built for publication: Sense of direction in distributed computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1870525)
