Finding Periods in Cartesian Tree Matching. Bataa, M., Park, S. G., Amir, A., Landau, G. M., & Park, K. In Colbourn, C. J., Grossi, R., & Pisanti, N., editors, IWOCA, volume 11638, of Lecture Notes in Computer Science, pages 70-84, 2019. Springer.
Finding Periods in Cartesian Tree Matching. [link]Link  Finding Periods in Cartesian Tree Matching. [link]Paper  bibtex   
@inproceedings{conf/iwoca/BataaPALP19,
  added-at = {2019-07-15T00:00:00.000+0200},
  author = {Bataa, Magsarjav and Park, Sung Gwan and Amir, Amihood and Landau, Gad M. and Park, Kunsoo},
  biburl = {https://www.bibsonomy.org/bibtex/2bd7b93e0781b79c8b106e39907e2b56d/dblp},
  booktitle = {IWOCA},
  crossref = {conf/iwoca/2019},
  editor = {Colbourn, Charles J. and Grossi, Roberto and Pisanti, Nadia},
  ee = {https://doi.org/10.1007/978-3-030-25005-8_7},
  interhash = {0287471f3e462a297e2fa45af3eabf32},
  intrahash = {bd7b93e0781b79c8b106e39907e2b56d},
  isbn = {978-3-030-25005-8},
  keywords = {dblp},
  pages = {70-84},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  timestamp = {2019-07-16T11:38:54.000+0200},
  title = {Finding Periods in Cartesian Tree Matching.},
  url = {http://dblp.uni-trier.de/db/conf/iwoca/iwoca2019.html#BataaPALP19},
  volume = 11638,
  year = 2019
}

Downloads: 0