Published in: LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Antonio Molina Lovett and Jeffrey Shallit. Optimal Regular Expressions for Permutations (Track B: Automata, Logic, Semantics, and Theory of Programming). In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 132, pp. 121:1-121:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{molinalovett_et_al:LIPIcs.ICALP.2019.121,
author = {Molina Lovett, Antonio and Shallit, Jeffrey},
title = {{Optimal Regular Expressions for Permutations}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {121:1--121:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.121},
URN = {urn:nbn:de:0030-drops-106978},
doi = {10.4230/LIPIcs.ICALP.2019.121},
annote = {Keywords: regular expressions, lower bounds, divide-and-conquer}
}
Feedback for Dagstuhl Publishing