Author:
Marco Gianluca De,Gargano Luisa,Kranakis Evangelos,Krizanc Danny,Pelc Andrzej,Vaccaro Ugo
Subject
General Computer Science,Theoretical Computer Science
Reference24 articles.
1. R. Aleliunas, R.M. Karp, R.J. Lipton, L. Lovász, C. Rackoff, Random walks, universal traversal sequences, and the complexity of maze problems, in: Proc. Annu. Symp. on Foundations of Computer Science FOCS’1979, pp. 218–223.
2. The rendezvous search problem;Alpern;SIAM J. Control Optim.,1995
3. Rendezvous search on labelled networks;Alpern;Naval Res. Logist.,2002
4. Rendezvous search on a graph;Alpern;J. Appl. Probab.,1999
5. Rendezvous search on the line with distinguishable players;Alpern;SIAM J. Control Optim.,1995
Cited by
112 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献