@InProceedings{he_et_al:LIPIcs.ESA.2018.45,
author = {He, Xiaoyu and Huang, Neng and Sun, Xiaoming},
title = {{On the Decision Tree Complexity of String Matching}},
booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)},
pages = {45:1--45:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-081-1},
ISSN = {1868-8969},
year = {2018},
volume = {112},
editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.45},
URN = {urn:nbn:de:0030-drops-95082},
doi = {10.4230/LIPIcs.ESA.2018.45},
annote = {Keywords: String Matching, Decision Tree Complexity, Boolean Function, Algebraic Method}
}