Computing on an anonymous ring
Journal of the ACM (JACM)
Theoretical Computer Science
SIAM Journal on Computing
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases
IEEE Transactions on Parallel and Distributed Systems
Average and Randomized Complexity of Distributed Problems
SIAM Journal on Computing
Computing vector functions on anonymous networks
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Computing anonymously with arbitrary knowledge
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Symmetry and similarity in distributed systems
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Discrete Mathematics
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Leader election in plane cellular automata, only with left-right global convention
Theoretical Computer Science - Combinatorics of the discrete plane and tilings
Relationships between broadcast and shared memory in reliable anonymous distributed systems
Distributed Computing - Special issue: DISC 04
Map construction of unknown graphs by multiple agents
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
Computing on a partially eponymous ring
Theoretical Computer Science
On the round complexity of Byzantine agreement without initial set-up
Information and Computation
A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Fault-tolerant simulation of message-passing algorithms by mobile agents
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
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
Distributed algorithms for edge dominating sets
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of 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
Computing on a partially eponymous ring
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Journal of Parallel and Distributed Computing
Groupings and pairings in anonymous networks
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
On the power of anonymous one-way communication
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Byzantine agreement with homonyms in synchronous systems
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Decidability classes for mobile agents computing
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Weak models of distributed computing, with connections to modal logic
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Homonyms with forgeable identifiers
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Rendezvous of mobile agents in unknown graphs with faulty links
DISC'07 Proceedings of the 21st international conference on Distributed Computing
ACM Computing Surveys (CSUR)
Byzantine agreement with homonyms in synchronous systems
Theoretical Computer Science
| Hi-index | 0.00 |
We provide effective (i.e., recursive) characterizations of the relations that can be computed on networks where all processors use the same algorithm, start from the same state, and know at least a bound on the network size. Three activation models are considered (synchronous, asynchronous, interleaved).