@InProceedings{nishimoto_et_al:LIPIcs.ICALP.2021.101,
author = {Nishimoto, Takaaki and Tabei, Yasuo},
title = {{Optimal-Time Queries on BWT-Runs Compressed Indexes}},
booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
pages = {101:1--101:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-195-5},
ISSN = {1868-8969},
year = {2021},
volume = {198},
editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.101},
URN = {urn:nbn:de:0030-drops-141702},
doi = {10.4230/LIPIcs.ICALP.2021.101},
annote = {Keywords: Compressed text indexes, Burrows-Wheeler transform, highly repetitive text collections}
}