Computing on an anonymous ring
Journal of the ACM (JACM)
SIAM Journal on Computing
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases
IEEE Transactions on Parallel and Distributed Systems
Computing vector functions on anonymous networks
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Computing in Totally Anonymous Asynchronous Shared Memory Systems
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Assigning labels in unknown anonymous networks (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
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
Can we elect if we cannot compare?
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Leader election in rings with nonunique labels
Fundamenta Informaticae
Relationships between broadcast and shared memory in reliable anonymous distributed systems
Distributed Computing - Special issue: DISC 04
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
A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
On the round complexity of Byzantine agreement without initial set-up
Information and Computation
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
How much memory is needed for leader election
DISC'10 Proceedings of the 24th 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
ACM Transactions on Computation Theory (TOCT)
Waking up anonymous ad hoc radio networks
DISC'05 Proceedings of the 19th international conference on Distributed Computing
On the power of anonymous one-way communication
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Designing old and new distributed algorithms by replaying an incremental proof-based development
Rigorous Methods for Software Construction and Analysis
Distributed tree comparison with nodes of limited memory
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Communication complexity of consensus in anonymous message passing systems
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
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Leader Election in Rings with Nonunique Labels
Fundamenta Informaticae
Knowledge, level of symmetry, and time of leader election
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
| Hi-index | 0.00 |