@inproceedings{a82d81278b6a4bd4acf4aa14bb717607,
title = "Longest common extensions in sublinear space",
abstract = "The longest common extension problem (LCE problem) is to construct a data structure for an input string T of length n that supports LCE(i, j) queries. Such a query returns the length of the longest common prefix of the suffixes starting at positions i and j in T. This classic problem has a well-known solution that uses (n) space and O(1) query time. In this paper we show that for any trade-off parameter 1 ≤ τ ≤ n, the problem can be solved in O(image found) space and O(τ) query time. This significantly improves the previously best known time-space trade-offs, and almost matches the best known time-space product lower bound.",
author = "Philip Bille and G{\o}rtz, {Inge Li} and Knudsen, {Mathias B{\ae}k Tejs} and Moshe Lewenstein and Vildh{\o}j, {Hjalte Wedel}",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2015.; 26th Annual Symposium on Combinatorial Pattern Matching, CPM 2015 ; Conference date: 29-06-2015 Through 01-07-2015",
year = "2015",
doi = "10.1007/978-3-319-19929-0_6",
language = "الإنجليزيّة",
isbn = "9783319199283",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "65--76",
editor = "Ugo Vaccaro and Ely Porat and Ferdinando Cicalese",
booktitle = "Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Proceedings",
address = "ألمانيا",
}