Mobile Agent Rendezvous in a Ring
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Asynchronous deterministic rendezvous in graphs
Theoretical Computer Science
Map construction of unknown graphs by multiple agents
Theoretical Computer Science
How to meet in anonymous network
Theoretical Computer Science
Deterministic Rendezvous in Trees with Little Memory
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Asynchronous Deterministic Rendezvous on the Line
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Fault-tolerant simulation of message-passing algorithms by mobile agents
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Mobile agent rendezvous in a ring using faulty tokens
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
The power of tokens: rendezvous and symmetry detection for two mobile agents in a ring
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Randomized rendez-vous with limited memory
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Delays induce an exponential memory gap for rendezvous in trees
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
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 to meet asynchronously (almost) everywhere
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
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
Rendezvous of mobile agents in directed graphs
DISC'10 Proceedings of the 24th international conference on Distributed computing
Almost optimal asynchronous rendezvous in infinite multidimensional grids
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
Deterministic symmetric rendezvous with tokens in a synchronous torus
Discrete Applied Mathematics
Randomized rendezvous with limited memory
ACM Transactions on Algorithms (TALG)
Asynchronous deterministic rendezvous in bounded terrains
Theoretical Computer Science
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Mobile agent rendezvous: a survey
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
How to meet in anonymous network
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Asynchronous deterministic rendezvous in graphs
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Polynomial deterministic rendezvous in arbitrary graphs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Distributed exploration of an unknown graph
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Asynchronous deterministic rendezvous in bounded terrains
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Mobile agent rendezvous in a synchronous torus
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Asynchronous rendezvous of anonymous agents in arbitrary graphs
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Time vs. space trade-offs for rendezvous in trees
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
How to meet asynchronously (almost) everywhere
ACM Transactions on Algorithms (TALG)
Time of anonymous rendezvous in trees: determinism vs. randomization
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
Delays Induce an Exponential Memory Gap for Rendezvous in Trees
ACM Transactions on Algorithms (TALG)
How to meet asynchronously at polynomial cost
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Deterministic polynomial approach in the plane
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Price of asynchrony in mobile agents computing
Theoretical Computer Science
Hi-index | 0.00 |