book chapter · Lecture notes in computer science · 2023

Parallel Suffix Sorting for Large String Analytics

Cited by 1Abstract and details only

Abstract

The index has no abstract for this paper. The publisher’s page may have one.

Cite this paper

Du, Z., Zhang, S., & Bader, D. A. (2023). Parallel Suffix Sorting for Large String Analytics. Lecture notes in computer science, 71–82. https://doi.org/10.1007/978-3-031-30442-2_6

MLA 9

Du, Zhihui, et al. “Parallel Suffix Sorting for Large String Analytics.” Lecture notes in computer science, 2023, pp. 71–82, https://doi.org/10.1007/978-3-031-30442-2_6.

Chicago

Du, Zhihui, Sen Zhang, and David A. Bader. 2023. “Parallel Suffix Sorting for Large String Analytics.” Lecture notes in computer science: 71–82. https://doi.org/10.1007/978-3-031-30442-2_6.

Harvard

Du, Z., Zhang, S. and Bader, D.A. (2023) ‘Parallel Suffix Sorting for Large String Analytics’, Lecture notes in computer science, pp. 71–82. Available at: https://doi.org/10.1007/978-3-031-30442-2_6.

BibTeX

@incollection{du2023parallel,
  title = {{Parallel Suffix Sorting for Large String Analytics}},
  author = {Du, Zhihui and Zhang, Sen and Bader, David A.},
  booktitle = {Lecture notes in computer science},
  pages = {71--82},
  year = {2023},
  doi = {10.1007/978-3-031-30442-2_6}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.