1 |
Dynamic Suffix Array with Polylogarithmic Queries and Updates ...
|
|
|
|
BASE
|
|
Show details
|
|
2 |
Breaking the $O(n)$-Barrier in the Construction of Compressed Suffix Arrays ...
|
|
|
|
BASE
|
|
Show details
|
|
6 |
Engineering External Memory LCP Array Construction: Parallel, In-Place and Large Alphabet
|
|
Kempa, Dominik. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. : LIPIcs - Leibniz International Proceedings in Informatics. 16th International Symposium on Experimental Algorithms (SEA 2017), 2017
|
|
BASE
|
|
Show details
|
|
7 |
Engineering External Memory LCP Array Construction: Parallel, In-Place and Large Alphabet ...
|
|
|
|
BASE
|
|
Show details
|
|
8 |
Optimal Construction of Compressed Indexes for Highly Repetitive Texts ...
|
|
|
|
BASE
|
|
Show details
|
|
9 |
Faster External Memory LCP Array Construction
|
|
Kempa, Dominik. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. : LIPIcs - Leibniz International Proceedings in Informatics. 24th Annual European Symposium on Algorithms (ESA 2016), 2016
|
|
BASE
|
|
Show details
|
|
11 |
Faster Sparse Suffix Sorting
|
|
I, Tomohiro; Kempa, Dominik. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2014. : LIPIcs - Leibniz International Proceedings in Informatics. 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014
|
|
BASE
|
|
Show details
|
|
|
|