Distributed algorithms for finding centers and medians in networks
ACM Transactions on Programming Languages and Systems (TOPLAS)
Lower Bounds for Distributed Maximum-Finding Algorithms
Journal of the ACM (JACM)
An O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
On an improved algorithm for decentralized extrema finding in circular configurations of processors
Communications of the ACM
Distributed computation on graphs: shortest path algorithms
Communications of the ACM
Decentralized extrema-finding in circular configurations of processors
Communications of the ACM
An improved algorithm for decentralized extrema-finding in circular configurations of processes
Communications of the ACM
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Distributed multi-destination routing: The constraints of local information
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Distributed k-selection: From a sequential to a distributed algorithm
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Tradeoffs for selection in distributed networks (Preliminary Version)
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Optimal Elections in Faulty Loop Networks and Applications
IEEE Transactions on Computers
Broadcasting under network ignorance scenario
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 2
Time-message trade-offs for the weak unison problem
Nordic Journal of Computing
Sense of direction in distributed computing
Theoretical Computer Science - Special issue: Distributed computing
Distributed Computing
Efficient leader election using sense of direction
Distributed Computing
Lower bounds for sense of direction in regular graphs
Distributed Computing
Theoretical Computer Science
Leader election algorithm using heap structure
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
Minimal chordal sense of direction and circulant graphs
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.02 |
Based on some recent results, it is here argued that the communication complexity of distributed problems can be greatly affected by two factors hereby identified as 'sense of direction' and 'topological awareness'. It is also suggested that 'insensitivity' to either or both factors is an indicator of the inherent difficulty of a distributed problem. A bibliography of recent results is included.