Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach. Space Lower Bounds for Online Pattern Matching. In Raffaele Giancarlo, Giovanni Manzini, editors, Combinatorial Pattern Matching - 22nd Annual Symposium, CPM 2011, Palermo, Italy, June 27-29, 2011. Proceedings. Volume 6661 of Lecture Notes in Computer Science, pages 184-196, Springer, 2011. [doi]
@inproceedings{CliffordJPS11,
title = {Space Lower Bounds for Online Pattern Matching},
author = {Raphaël Clifford and Markus Jalsenius and Ely Porat and Benjamin Sach},
year = {2011},
doi = {10.1007/978-3-642-21458-5_17},
url = {http://dx.doi.org/10.1007/978-3-642-21458-5_17},
tags = {pattern matching},
researchr = {https://researchr.org/publication/CliffordJPS11},
cites = {0},
citedby = {0},
pages = {184-196},
booktitle = {Combinatorial Pattern Matching - 22nd Annual Symposium, CPM 2011, Palermo, Italy, June 27-29, 2011. Proceedings},
editor = {Raffaele Giancarlo and Giovanni Manzini},
volume = {6661},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-21457-8},
}