A fast algorithm for finding the positions of all squares in a run-length encoded string

J. J. Liu, G. S. Huang, Y. L. Wang. A fast algorithm for finding the positions of all squares in a run-length encoded string. Theoretical Computer Science, 410(38-40):3942-3948, 2009. [doi]

@article{LiuHW09,
  title = {A fast algorithm for finding the positions of all squares in a run-length encoded string},
  author = {J. J. Liu and G. S. Huang and Y. L. Wang},
  year = {2009},
  doi = {10.1016/j.tcs.2009.05.032},
  url = {http://dx.doi.org/10.1016/j.tcs.2009.05.032},
  researchr = {https://researchr.org/publication/LiuHW09},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {410},
  number = {38-40},
  pages = {3942-3948},
}