Lower Bounds for Distributed Maximum-Finding Algorithms
Journal of the ACM (JACM)
Electing a leader in a synchronous ring
Journal of the ACM (JACM)
Computing on an anonymous ring
Journal of the ACM (JACM)
Computing on an anonymous network
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Calling names in nameless networks
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Distributed computing on transitive networks: the torus
Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science on STACS 89
Computing boolean functions on anonymous networks
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Better computing on the anonymous ring
Journal of Algorithms
Two lower bounds in asynchronous distributed computation
Journal of Computer and System Sciences
Distributed computing: models and methods
Handbook of theoretical computer science (vol. B)
Gap theorems for distributed computation
SIAM Journal on Computing
Symmetry and similarity in distributed systems
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
An improved algorithm for decentralized extrema-finding in circular configurations of processes
Communications of the ACM
Communicating sequential processes
Communications of the ACM
Simple and Efficient Election Algorithms for Anonymous Networks
Proceedings of the 3rd International Workshop on Distributed Algorithms
Electing a Leader when Processor Identity Numbers are not Distinct (Extended Abstract)
Proceedings of the 3rd International Workshop on Distributed Algorithms
Spanning Tree Construction for Nameless Networks
WDAG '90 Proceedings of the 4th International Workshop on Distributed Algorithms
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Computing on Anonymous Networks: Part II-Decision and Membership Problems
IEEE Transactions on Parallel and Distributed Systems
Computing anonymously with arbitrary knowledge
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Backward consistency and sense of direction in advanced distributed systems
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Leader Election Problem on Networks in which Processor Identity Numbers Are Not Distinct
IEEE Transactions on Parallel and Distributed Systems
An Effective Characterization of Computability in Anonymous Networks
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
A Characterization of Families of Graphs in Which Election Is Possible
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Universal dynamic synchronous self-stabilization
Distributed Computing
Can we elect if we cannot compare?
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Sense of direction in distributed computing
Theoretical Computer Science - Special issue: Distributed computing
Computing on anonymous networks with sense of direction
Theoretical Computer Science
Sorting and election in anonymous asynchronous rings
Journal of Parallel and Distributed Computing
Leader election in rings with nonunique labels
Fundamenta Informaticae
Oracle size: a new measure of difficulty for communication tasks
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Local Computations in Graphs: The Case of Cellular Edge Local Computations
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
Map construction of unknown graphs by multiple agents
Theoretical Computer Science
An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Election and rendezvous with incomparable labels
Theoretical Computer Science
About the Termination Detection in the Asynchronous Message Passing Model
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Labelled (Hyper)Graphs, Negotiations and the Naming Problem
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Constant-Space Localized Byzantine Consensus
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Information and Computation
Rendezvous of Mobile Agents When Tokens Fail Anytime
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Computing on a partially eponymous ring
Theoretical Computer Science
Randomized generation of acyclic orientations upon anonymous distributed systems
Journal of Parallel and Distributed Computing
Proceedings of the 28th ACM symposium on Principles of distributed computing
An optimal local approximation algorithm for max-min linear programs
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
On the round complexity of Byzantine agreement without initial set-up
Information and Computation
Semi-local Model of Computations on Graphs to Break the Local Symmetry
Electronic Notes in Theoretical Computer Science (ENTCS)
Fault-tolerant simulation of message-passing algorithms by mobile agents
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Communication algorithms with advice
Journal of Computer and System Sciences
On the self-stabilization of mobile robots in graphs
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
The price of anonymity: optimal consensus despite asynchrony, crash and anonymity
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Comparing universal covers in polynomial time
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Distributed algorithms for edge dominating sets
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
How to meet when you forget: log-space rendezvous in arbitrary graphs
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Local Computations on Triangular Graphs
Fundamenta Informaticae - Understanding Computers' Intelligence Celebrating the 100th Volume of Fundamenta Informaticae in Honour of Helena Rasiowa
Tell me where i am so i can meet you sooner: asynchronous rendezvous with location information
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Rendezvous of mobile agents without agreement on local orientation
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
How much memory is needed for leader election
DISC'10 Proceedings of the 24th international conference on Distributed computing
Rendezvous of mobile agents in directed graphs
DISC'10 Proceedings of the 24th international conference on Distributed computing
DISC'10 Proceedings of the 24th international conference on Distributed computing
Constructing a map of an anonymous graph: applications of universal sequences
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Byzantine agreement with homonyms
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash, and Anonymity
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
DISC 2011 invited lecture: deterministic rendezvous in networks: survey of models and results
DISC'11 Proceedings of the 25th international conference on Distributed computing
Mobile agent algorithms versus message passing algorithms
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Computing on a partially eponymous ring
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Improved distributed exploration of anonymous networks
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
Graph labelings derived from models in distributed computing
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Election in the qualitative world
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Journal of Parallel and Distributed Computing
Duplicate address detection in wireless ad hoc networks using wireless nature
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Local computations on closed unlabelled edges: the election problem and the naming problem
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Tree exploration with an oracle
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Groupings and pairings in anonymous networks
DISC'06 Proceedings of the 20th international conference on Distributed Computing
A knowledge-based analysis of global function computation
DISC'06 Proceedings of the 20th international conference on Distributed Computing
A bridge between the asynchronous message passing model and local computations in graphs
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Exact quantum algorithms for the leader election problem
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Exact Quantum Algorithms for the Leader Election Problem
ACM Transactions on Computation Theory (TOCT)
Designing old and new distributed algorithms by replaying an incremental proof-based development
Rigorous Methods for Software Construction and Analysis
Effective elections for anonymous mobile agents
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Gathering asynchronous oblivious mobile robots in a ring
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Distributed tree comparison with nodes of limited memory
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
How simple robots benefit from looking back
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Communication complexity of consensus in anonymous message passing systems
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Asynchronous rendezvous of anonymous agents in arbitrary graphs
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Decidability classes for mobile agents computing
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
MAGNET: ad hoc network system based on mobile agents
Computer Communications
Distributed maximal matching: greedy is optimal
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Lower bounds for local approximation
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Weak models of distributed computing, with connections to modal logic
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Deterministic network exploration by anonymous silent agents with local traffic reports
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Local Computations in Graphs: The Case of Cellular Edge Local Computations
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
Leader Election in Rings with Nonunique Labels
Fundamenta Informaticae
Enumeration and Leader Election in Partially Anonymous and Multi-hop Broadcast Networks
Fundamenta Informaticae
Knowledge, level of symmetry, and time of leader election
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
ACM Computing Surveys (CSUR)
Perspective: Simple agents learn to find their way: An introduction on mapping polygons
Discrete Applied Mathematics
Learning a ring cheaply and fast
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Lower bounds for local approximation
Journal of the ACM (JACM)
| Hi-index | 0.02 |
In anonymous networks, the processors do not have identity numbers. We investigate the following representative problems on anonymous networks: (a) the leader election problem, (b) the edge election problem, (c) the spanning tree construction problem, and (d) the topology recognition problem. On a given network, the above problems may or may not be solvable, depending on the amount of information about the attributes of the network made available to the processors. Some possibilities are: (1) no network attribute information at all is available, (2) an upper bound on the number of processors in the network is available, (3) the exact number of processors in the network is available, and (4) the topology of the network is available. In terms of a new graph property called "symmetricity," in each of the four cases (1)-(4) above, we characterize the class of networks on which each of the four problems (a)-(d) is solvable. We then relate the symmetricity of a network to its 1- and 2-factors.