Election in a complete network with a sense of direction
Information Processing Letters
A fully distributed (minimal) spanning tree algorithm
Information Processing Letters
Computing on an anonymous ring
Journal of the ACM (JACM)
An efficient distributed depth-first-search algorithm
Information Processing Letters
A modular technique for the design of efficient distributed leader finding algorithms
ACM Transactions on Programming Languages and Systems (TOPLAS)
A trade-off between information and communication in broadcast protocols
Journal of the ACM (JACM)
Optimal Distributed t-Resilient Election in Complete Networks
IEEE Transactions on Software Engineering
Towards optimal distributed election on chordal rings
Information Processing Letters
A near-optimal multistage distributed algorithm for finding leaders in clustered chordal rings
Information Sciences—Informatics and Computer Science: An International Journal
Object identifiers, keys, and surrogates: object identifiers revisited
Theory and Practice of Object Systems
Leader Election in the Presence of Link Failures
IEEE Transactions on Parallel and Distributed Systems
Optimal elections in labeled hypercubes
Journal of Parallel and Distributed Computing
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases
IEEE Transactions on Parallel and Distributed Systems
Distributed computing on anonymous hypercube networks
Journal of Algorithms
Minimal sense of direction in regular networks
Information Processing Letters
On the impact of sense of direction on message complexity
Information Processing Letters
Optimal distributed algorithms in unlabeled tori and chordal rings
Journal of Parallel and Distributed Computing
Optimal Elections in Faulty Loop Networks and Applications
IEEE Transactions on Computers
Minimal sense of direction and decision problems for Cayley graphs
Information Processing Letters
Broadcasting in unlabeled hypercubes with a linear number of messages
Information Processing Letters
Backward consistency and sense of direction in advanced distributed systems
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Perfect broadcasting in unlabeled networks
Discrete Applied Mathematics
Symmetries and sense of direction in labeled graphs
Discrete Applied Mathematics
Complexity of Deciding Sense of Direction
SIAM Journal on Computing
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Coverings that preserve sense of direction
Information Processing Letters
Distributed Algorithms
Time-message trade-offs for the weak unison problem
Nordic Journal of Computing
Distributed Computing on Anonymous Hypercubes with Faulty Components (Extended Abstract)
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Sense of Direction in Processor Networks
SOFSEM '95 Proceedings of the 22nd Seminar on Current Trends in Theory and Practice of Informatics
Broadcasting on Anonymous Unoriented Tori
WG '98 Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science
Computing on anonymous networks with sense of direction
Theoretical Computer Science
Self-Stabilizing Network Orientation Algorithms In Arbitrary Rooted Networks
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Efficient leader election using sense of direction
Distributed Computing
Searching for a black hole in arbitrary networks: optimal mobile agent protocols
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Mobile Agent Rendezvous in a Ring
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Note: Setting port numbers for fast graph exploration
Theoretical Computer Science
Information and Computation
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Weak sense of direction labelings and graph embeddings
Discrete Applied Mathematics
Distributed security algorithms by mobile agents
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Setting port numbers for fast graph exploration
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Optimal memory rendezvous of anonymous mobile agents in a unidirectional ring
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Minimal chordal sense of direction and circulant graphs
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Online graph exploration with advice
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Delays Induce an Exponential Memory Gap for Rendezvous in Trees
ACM Transactions on Algorithms (TALG)
Hi-index | 0.00 |
Sense of direction is a property of labeled graphs which has been shown to have a definite impact on computability and complexity in systems of communicating entities, and whose applicability ranges from the analysis of graph classes to distributed object systems. The full consequences of this property are still not known; in fact, the ongoing investigations continue to bring new (often surprising) results, to establish unsuspected links with other research and/or application areas, and to pose more questions than they answer. The aim of this paper is to provide a view of the current status of research, describing some of the relevant results, and providing pointers to future research directions.