Information and Computation
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Rendezvous Search on the Line With Distinguishable Players
SIAM Journal on Control and Optimization
SIAM Journal on Control and Optimization
Rendezvous Search on the Line with Indistinguishable Players
SIAM Journal on Control and Optimization
The Symmetric Rendezvous-Evasion Game
SIAM Journal on Control and Optimization
An improved approximation ratio for the minimum latency problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Operations Research
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Pursuit-evasion with imprecise target location
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Asynchronous deterministic rendezvous in graphs
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
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
Almost optimal asynchronous rendezvous in infinite multidimensional grids
DISC'10 Proceedings of the 24th international conference on Distributed computing
Asynchronous deterministic rendezvous in bounded terrains
Theoretical Computer Science
Synchronous rendezvous for location-aware agents
DISC'11 Proceedings of the 25th international conference on Distributed computing
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
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
Asynchronous deterministic rendezvous in bounded terrains
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
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
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)
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
Price of asynchrony in mobile agents computing
Theoretical Computer Science
| Hi-index | 0.00 |