A Very Fast String Matching Algorithm Based on Condensed Alphabets

Simone Faro. A Very Fast String Matching Algorithm Based on Condensed Alphabets. In Riccardo Dondi, Guillaume Fertin, Giancarlo Mauri, editors, Algorithmic Aspects in Information and Management - 11th International Conference, AAIM 2016, Bergamo, Italy, July 18-20, 2016, Proceedings. Volume 9778 of Lecture Notes in Computer Science, pages 65-76, Springer, 2016. [doi]

@inproceedings{Faro16-0,
  title = {A Very Fast String Matching Algorithm Based on Condensed Alphabets},
  author = {Simone Faro},
  year = {2016},
  doi = {10.1007/978-3-319-41168-2_6},
  url = {http://dx.doi.org/10.1007/978-3-319-41168-2_6},
  researchr = {https://researchr.org/publication/Faro16-0},
  cites = {0},
  citedby = {0},
  pages = {65-76},
  booktitle = {Algorithmic Aspects in Information and Management - 11th International Conference, AAIM 2016, Bergamo, Italy, July 18-20, 2016, Proceedings},
  editor = {Riccardo Dondi and Guillaume Fertin and Giancarlo Mauri},
  volume = {9778},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-41167-5},
}