%0 Conference Paper %1 conf/wia/FaroS21 %A Faro, Simone %A Scafiti, Stefano %B CIAA %D 2021 %E Maneth, Sebastian %I Springer %K dblp %P 165-177 %T Efficient String Matching Based on a Two-Step Simulation of the Suffix Automaton. %U http://dblp.uni-trier.de/db/conf/wia/ciaa2021.html#FaroS21 %V 12803 %@ 978-3-030-79121-6

@inproceedings{conf/wia/FaroS21, added-at = {2022-06-23T00:00:00.000+0200}, author = {Faro, Simone and Scafiti, Stefano}, biburl = {https://www.bibsonomy.org/bibtex/2528801599ced46183abf1c8a7226d0be/dblp}, booktitle = {CIAA}, crossref = {conf/wia/2021}, editor = {Maneth, Sebastian}, ee = {https://doi.org/10.1007/978-3-030-79121-6_14}, interhash = {9bc981026947fdff96845903f14cb67a}, intrahash = {528801599ced46183abf1c8a7226d0be}, isbn = {978-3-030-79121-6}, keywords = {dblp}, pages = {165-177}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2024-04-09T16:56:17.000+0200}, title = {Efficient String Matching Based on a Two-Step Simulation of the Suffix Automaton.}, url = {http://dblp.uni-trier.de/db/conf/wia/ciaa2021.html#FaroS21}, volume = 12803, year = 2021 }