@inproceedings{54651a67732748ce89e19877367cd2e6,
title = "Parallel lookups in string indexes",
abstract = "Recently, the first PRAM algorithms were presented for looking up a pattern in a suffix tree. We improve the bounds, achieving optimal results.",
keywords = "PRAM, Parallel, Pattern matching, Suffix trees",
author = "Christiansen, {Anders Roy} and Mart{\'i}n Farach-Colton",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG 2016.; 23rd International Symposium on String Processing and Information Retrieval, SPIRE 2016 ; Conference date: 18-10-2016 Through 20-10-2016",
year = "2016",
doi = "10.1007/978-3-319-46049-9_6",
language = "English (US)",
isbn = "9783319460482",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "61--67",
editor = "Shunsuke Inenaga and Kunihiko Sadakane and Tetsuya Sakai",
booktitle = "String Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Proceedings",
}