Author:
Miller Avery,Pelc Andrzej
Publisher
Springer International Publishing
Reference40 articles.
1. Abiteboul, S., Kaplan, H., Milo, T.: Compact labeling schemes for ancestor queries. In: Proc. 12th ACM-SIAM Symp. on Discrete Algorithms (SODA ), pp. 547–556 (2001)
2. Alpern, S.: The rendezvous search problem. SIAM J. on Control and Optimization 33, 673–683 (1995)
3. Alpern, S.: Rendezvous search on labelled networks. Naval Reaserch Logistics 49, 256–274 (2002)
4. Alpern, S., Gal, S.: The theory of search games and rendezvous. Int. Series in Operations research and Management Science. Kluwer Academic Publisher (2002)
5. Anderson, E., Weber, R.: The rendezvous problem on discrete locations. Journal of Applied Probability 28, 839–851 (1990)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Pebble guided optimal treasure hunt in anonymous graphs;Theoretical Computer Science;2022-06
2. Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs;Structural Information and Communication Complexity;2021
3. Treasure Hunt with Advice;Structural Information and Communication Complexity;2015