A General Lower Bound for Collaborative Tree Exploration-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A General Lower Bound for Collaborative Tree Exploration

Published:2017 Issue: Volume: Page:125-139
ISSN:0302-9743
Container-title:Structural Information and Communication Complexity
language:
Short-container-title:

Author:

Disser Yann,Mousset Frank,Noever Andreas,Škorić Nemanja,Steger Angelika

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-72050-0_8

Reference25 articles.

1. Albers, S., Henzinger, M.R.: Exploring unknown environments. SIAM J. Comput. 29(4), 1164–1188 (2000)

2. Aleliunas, R., Karp, R.M., Lipton, R.J., Lovász, L., Rackoff, C.: Random walks, universal traversal sequences, and the complexity of maze problems. In: Proceedings of the 20th Annual Symposium on Foundations of Computer Science (FOCS), pp. 218–223 (1979)

3. Alon, N., Avin, C., Koucký, M., Kozma, G., Lotker, Z., Tuttle, M.R.: Many random walks are faster than one. Comb. Probab. Comput. 20(4), 481–502 (2011)

4. Ambühl, C., Gąsieniec, L., Pelc, A., Radzik, T., Zhang, X.: Tree exploration with logarithmic memory. ACM Trans. Algorithms 7(2), 1–21 (2011)

5. Awerbuch, B., Betke, M., Rivest, R.L., Singh, M.: Piecemeal graph exploration by a mobile robot. Inf. Comput. 152(2), 155–172 (1999)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16

2. Multi-robot exploration on grids with a bounded time;SCI IRAN;2021

3. Minimizing the Cost of Team Exploration;SOFSEM 2019: Theory and Practice of Computer Science;2019

4. Fast Graph Exploration by a Mobile Robot;2018 IEEE First International Conference on Artificial Intelligence and Knowledge Engineering (AIKE);2018-09

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3