Faster Fully Compressed Pattern Matching by Recompression

Artur Jez. Faster Fully Compressed Pattern Matching by Recompression. In Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitts, Roger Wattenhofer, editors, Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I. Volume 7391 of Lecture Notes in Computer Science, pages 533-544, Springer, 2012. [doi]

@inproceedings{Jez12,
  title = {Faster Fully Compressed Pattern Matching by Recompression},
  author = {Artur Jez},
  year = {2012},
  doi = {10.1007/978-3-642-31594-7_45},
  url = {http://dx.doi.org/10.1007/978-3-642-31594-7_45},
  researchr = {https://researchr.org/publication/Jez12},
  cites = {0},
  citedby = {0},
  pages = {533-544},
  booktitle = {Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I},
  editor = {Artur Czumaj and Kurt Mehlhorn and Andrew M. Pitts and Roger Wattenhofer},
  volume = {7391},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-31593-0},
}