@InProceedings{bojko_et_al:LIPIcs.MFCS.2022.22,
author = {Bojko, Dominik and Gotfryd, Karol and Kowalski, Dariusz R. and Paj\k{a}k, Dominik},
title = {{Tree Exploration in Dual-Memory Model}},
booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)},
pages = {22:1--22:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-256-3},
ISSN = {1868-8969},
year = {2022},
volume = {241},
editor = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.22},
URN = {urn:nbn:de:0030-drops-168207},
doi = {10.4230/LIPIcs.MFCS.2022.22},
annote = {Keywords: Graph exploration, agent, memory, tree, deterministic algorithms, lower bound}
}