@InProceedings{golovnev_et_al:LIPIcs.APPROX-RANDOM.2019.56,
author = {Golovnev, Alexander and G\"{o}\"{o}s, Mika and Reichman, Daniel and Shinkar, Igor},
title = {{String Matching: Communication, Circuits, and Learning}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)},
pages = {56:1--56:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-125-2},
ISSN = {1868-8969},
year = {2019},
volume = {145},
editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2019.56},
URN = {urn:nbn:de:0030-drops-112717},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.56},
annote = {Keywords: string matching, communication complexity, circuit complexity, PAC learning}
}