Computing Maximal Lyndon Substrings of a String - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Frantisek Franek, Michael Liut. Computing Maximal Lyndon Substrings of a String. Algorithms, 13(11):294, 2020. [doi]

@article{FranekL20,
  title = {Computing Maximal Lyndon Substrings of a String},
  author = {Frantisek Franek and Michael Liut},
  year = {2020},
  doi = {10.3390/a13110294},
  url = {https://doi.org/10.3390/a13110294},
  researchr = {https://researchr.org/publication/FranekL20},
  cites = {0},
  citedby = {0},
  journal = {Algorithms},
  volume = {13},
  number = {11},
  pages = {294},
}

runs on WebDSL