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
Universal dynamic synchronous self-stabilization
Distributed Computing
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
Computing on a partially eponymous ring
Theoretical Computer Science
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
Rendezvous of mobile agents in directed graphs
DISC'10 Proceedings of the 24th international conference on Distributed computing
Computing on a partially eponymous ring
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
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
Cohomology of GKM fiber bundles
Journal of Algebraic Combinatorics: An International Journal
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
Exact Quantum Algorithms for the Leader Election Problem
ACM Transactions on Computation Theory (TOCT)
Decidability classes for mobile agents computing
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Locally constrained graph homomorphisms-structure, complexity, and applications
Computer Science Review
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
Enumeration and Leader Election in Partially Anonymous and Multi-hop Broadcast Networks
Fundamenta Informaticae
Rendezvous of mobile agents in unknown graphs with faulty links
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Perspective: Simple agents learn to find their way: An introduction on mapping polygons
Discrete Applied Mathematics
Bi-resolving Graph Homomorphisms and Extensions of Bi-closing codes
Acta Applicandae Mathematicae: an international survey journal on applying mathematics and mathematical applications
Hi-index | 0.05 |