Linear-time Suffix Sorting - A New Approach for Suffix Array Construction

Uwe Baier. Linear-time Suffix Sorting - A New Approach for Suffix Array Construction. In Roberto Grossi, Moshe Lewenstein, editors, 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, June 27-29, 2016, Tel Aviv, Israel. Volume 54 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. [doi]

@inproceedings{Baier16-0,
  title = {Linear-time Suffix Sorting - A New Approach for Suffix Array Construction},
  author = {Uwe Baier},
  year = {2016},
  doi = {10.4230/LIPIcs.CPM.2016.23},
  url = {http://dx.doi.org/10.4230/LIPIcs.CPM.2016.23},
  researchr = {https://researchr.org/publication/Baier16-0},
  cites = {0},
  citedby = {0},
  booktitle = {27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, June 27-29, 2016, Tel Aviv, Israel},
  editor = {Roberto Grossi and Moshe Lewenstein},
  volume = {54},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-95977-012-5},
}