The Beachcombers' Problem: Walking and Searching from an Inner Point of a Line.
https://doi.org/10.1007/978-3-319-30000-9_21
@inproceedings{DBLP:conf/lata/ChenDJL16,
author = {Yu Chen and
Xiaotie Deng and
Ziwei Ji and
Chao Liao},
editor = {Adrian{-}Horia Dediu and
Jan Janousek and
Carlos Mart{\'{\i}}n{-}Vide and
Bianca Truthe},
title = {The Beachcombers' Problem: Walking and Searching from an Inner Point
of a Line},
booktitle = {Language and Automata Theory and Applications - 10th International
Conference, {LATA} 2016, Prague, Czech Republic, March 14-18, 2016,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9618},
pages = {270--282},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-30000-9\_21},
doi = {10.1007/978-3-319-30000-9\_21},
timestamp = {Fri, 27 Mar 2020 08:52:54 +0100},
biburl = {https://dblp.org/rec/conf/lata/ChenDJL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
本页面没有标签