Author:
Feinerman Ofer,Korman Amos
Publisher
Springer Berlin Heidelberg
Reference54 articles.
1. Afek, Y., Alon, N., Barad, O., Hornstein, E., Barkai, N., Bar-Joseph, Z.: A biological solution to a fundamental distributed computing problem. Science 331(6014), 183–185 (2011)
2. Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous, 319 p. Kluwer (now Springer) Academic Publishers (2003)
3. Albers, S., Henzinger, M.R.: Exploring unknown environments. SIAM J. on Computing 29, 1164–1188 (2000)
4. Averbakh, I., Berman, O.: (p − 1)/(p + 1)-approximate algorithms for p-traveling salesmen problems on a tree with minmax objective. Discr. Appl. Mathematics 75, 201–216 (1997)
5. Baeza-Yates, R.A., Culberson, J.C., Rawlins, G.J.E.: Searching in The Plane. Information and Computation 106(2), 234–252 (1991)
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An Upper and Lower Bound for the Convergence Time of House-Hunting in Temnothorax Ant Colonies;Journal of Computational Biology;2022-04-01
2. Two-Agent Tree Evacuation;Structural Information and Communication Complexity;2021
3. Probably Approximately Knowing;Proceedings of the 39th Symposium on Principles of Distributed Computing;2020-07-31
4. ANTS on a Plane;Structural Information and Communication Complexity;2020
5. Parallel Bayesian Search with No Coordination;Journal of the ACM;2019-06-30