Sense of direction in distributed computing
From MaRDI portal
Publication:1870525
DOI10.1016/S0304-3975(01)00395-4zbMATH Open1026.68009MaRDI QIDQ1870525FDOQ1870525
Authors: P. Flocchini, Bernard Mans, N. Santoro 
Publication date: 14 May 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- A trade-off between information and communication in broadcast protocols
- Computing on an anonymous ring
- A fully distributed (minimal) spanning tree algorithm
- Towards optimal distributed election on chordal rings
- Efficient elections in chordal ring networks
- On the impact of sense of direction on message complexity
- On the message complexity of distributed problems
- Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- Minimal sense of direction in regular networks
- Minimal sense of direction and decision problems for Cayley graphs
- Title not available (Why is that?)
- Symmetries and sense of direction in labeled graphs
- Optimal elections in faulty loop networks and applications
- The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors
- Efficient leader election using sense of direction
- Optimal distributed algorithms in unlabeled tori and chordal rings
- Perspective in a box
- Sense of direction: Definitions, properties, and classes
- Complexity of Deciding Sense of Direction
- TOPOLOGICAL CONSTRAINTS FOR SENSE OF DIRECTION
- Perfect broadcasting in unlabeled networks
- Computing on anonymous networks with sense of direction
- Distributed Computing on Anonymous Hypercube Networks
- A near-optimal multistage distributed algorithm for finding leaders in clustered chordal rings
- Backward consistency and sense of direction in advanced distributed systems
- Broadcasting in unlabeled hypercubes with a linear number of messages.
- Coverings that preserve sense of direction
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cycle regular graphs need not be transitive
Cited In (21)
- A decision-theoretic approach to reliable message delivery
- Coverings that preserve sense of direction
- Tree exploration with advice
- Computing on anonymous networks with sense of direction
- Rendezvous problem
- On the impact of sense of direction on message complexity
- Title not available (Why is that?)
- Backward Consistency and Sense of Direction in Advanced Distributed Systems
- Searching for a black hole in arbitrary networks: optimal mobile agents protocols
- OPTIMAL CONSTRUCTION OF SENSE OF DIRECTION IN A TORUS BY A MOBILE AGENT
- Lower bounds for sense of direction in regular graphs
- Sense of direction: Definitions, properties, and classes
- Title not available (Why is that?)
- Complexity of Deciding Sense of Direction
- Improved periodic data retrieval in asynchronous rings with a faulty host
- A survey on interval routing
- Weak sense of direction labelings and graph embeddings
- An Algorithmic Theory of Mobile Agents
- Interval routing schemes allow broadcasting with linear message-complexity
- Exploration of Time-Varying Connected Graphs with Silent Agents
- Setting port numbers for fast graph exploration
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)
