Dany Breslauer, Livio Colussi, Laura Toniolo. On the Exact Complexity of the String Prefix-Matching Problem (Extended Abstract). In Jan van Leeuwen, editor, Algorithms - ESA 94, Second Annual European Symposium, Utrecht, The Netherlands, September 26-28, 1994, Proceedings. Volume 855 of Lecture Notes in Computer Science, pages 483-494, Springer, 1994.
@inproceedings{BreslauerCT94,
title = {On the Exact Complexity of the String Prefix-Matching Problem (Extended Abstract)},
author = {Dany Breslauer and Livio Colussi and Laura Toniolo},
year = {1994},
researchr = {https://researchr.org/publication/BreslauerCT94},
cites = {0},
citedby = {0},
pages = {483-494},
booktitle = {Algorithms - ESA 94, Second Annual European Symposium, Utrecht, The Netherlands, September 26-28, 1994, Proceedings},
editor = {Jan van Leeuwen},
volume = {855},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-58434-X},
}