default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInge Li Gørtz
Person information
- affiliation: Technical University of Denmark
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j36]Philip Bille
, Inge Li Gørtz, Tord Stordalen:
Predecessor on the Ultra-Wide Word RAM. Algorithmica 86(5): 1578-1599 (2024)- [c61]Emil Toftegaard Gæde, Inge Li Gørtz, Ivor van der Hoog, Christoffer Krogh, Eva Rotenberg:
Simple and Robust Dynamic Two-Dimensional Convex Hull. ALENEX 2024: 144-156 - [c60]Giulia Bernardini, Huiping Chen, Inge Li Gørtz, Christoffer Krogh, Grigorios Loukides, Solon P. Pissis, Leen Stougie, Michelle Sweering:
Connecting de Bruijn Graphs. CPM 2024: 6:1-6:16 - [c59]Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Simon R. Tarnow:
Faster Sliding Window String Indexing in Streams. CPM 2024: 8:1-8:14 - [c58]Philip Bille, Christian Mikkelsen Fuglsang, Inge Li Gørtz:
Tight Bounds for Compressing Substring Samples. CPM 2024: 9:1-9:14 - [c57]Philip Bille, Inge Li Gørtz, Tord Stordalen:
Rank and Select on Degenerate Strings. DCC 2024: 283-292 - [c56]Philip Bille, Martín Farach-Colton, Inge Li Gørtz, Ivor van der Hoog:
Snake in Optimal Space and Time. FUN 2024: 3:1-3:15 - [c55]Philip Bille, Inge Li Gørtz:
Sparse Regular Expression Matching. SODA 2024: 3354-3375 - [c54]Philip Bille, Inge Li Gørtz, Moshe Lewenstein, Solon P. Pissis, Eva Rotenberg, Teresa Anna Steiner:
Gapped String Indexing in Subquadratic Space and Sublinear Query Time. STACS 2024: 16:1-16:21 - 2023
- [j35]Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Teresa Anna Steiner:
Gapped Indexing for Consecutive Occurrences. Algorithmica 85(4): 879-901 (2023) - [j34]Philip Bille, Inge Li Gørtz:
Random Access in Persistent Strings and Segment Selection. Theory Comput. Syst. 67(4): 694-713 (2023) - [j33]Philip Bille, Inge Li Gørtz, Teresa Anna Steiner:
String Indexing with Compressed Patterns. ACM Trans. Algorithms 19(4): 32:1-32:19 (2023) - [c53]Philip Bille, Johannes Fischer, Inge Li Gørtz, Max Rishøj Pedersen, Tord Joakim Stordalen:
Sliding Window String Indexing in Streams. CPM 2023: 4:1-4:18 - [c52]Philip Bille, Inge Li Gørtz, Simon J. Puglisi, Simon R. Tarnow:
Hierarchical Relative Lempel-Ziv Compression. SEA 2023: 18:1-18:16 - [e4]Inge Li Gørtz, Martin Farach-Colton, Simon J. Puglisi, Grzegorz Herman:
31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands. LIPIcs 274, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-295-2 [contents] - [i52]Philip Bille, Johannes Fischer, Inge Li Gørtz, Max Rishøj Pedersen, Tord Joakim Stordalen:
Sliding Window String Indexing in Streams. CoRR abs/2301.09477 (2023) - [i51]Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen:
Faster Compression of Deterministic Finite Automata. CoRR abs/2306.12771 (2023) - [i50]Emil Toftegaard Gæde, Inge Li Gørtz, Ivor van der Hoog, Christoffer Krogh, Eva Rotenberg:
Simple and Robust Dynamic Two-Dimensional Convex Hull. CoRR abs/2310.18068 (2023) - [i49]Philip Bille, Inge Li Gørtz, Tord Stordalen:
Rank and Select on Degenerate Strings. CoRR abs/2310.19702 (2023) - 2022
- [j32]Philip Bille, Inge Li Gørtz:
From regular expression matching to parsing. Acta Informatica 59(6): 709-724 (2022) - [j31]Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen:
Partial sums on the ultra-wide word RAM. Theor. Comput. Sci. 905: 99-105 (2022) - [j30]Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Eva Rotenberg, Teresa Anna Steiner:
String indexing for top-k close consecutive occurrences. Theor. Comput. Sci. 927: 133-147 (2022) - [c51]Philip Bille, Inge Li Gørtz, Shay Mozes, Teresa Anna Steiner, Oren Weimann:
The Fine-Grained Complexity of Episode Matching. CPM 2022: 4:1-4:12 - [c50]Philip Bille, Inge Li Gørtz, Tord Stordalen:
The Complexity of the Co-occurrence Problem. SPIRE 2022: 38-52 - [c49]Philip Bille, Inge Li Gørtz, Tord Stordalen:
Predecessor on the Ultra-Wide Word RAM. SWAT 2022: 18:1-18:15 - [i48]Philip Bille, Inge Li Gørtz, Tord Stordalen:
Predecessor on the Ultra-Wide Word RAM. CoRR abs/2201.11550 (2022) - [i47]Philip Bille, Inge Li Gørtz, Tord Stordalen:
The Complexity of the Co-Occurrence Problem. CoRR abs/2206.10383 (2022) - [i46]Philip Bille, Inge Li Gørtz, Simon J. Puglisi, Simon R. Tarnow:
Hierarchical Relative Lempel-Ziv Compression. CoRR abs/2208.11371 (2022) - [i45]Philip Bille, Inge Li Gørtz, Moshe Lewenstein, Solon P. Pissis, Eva Rotenberg, Teresa Anna Steiner:
Gapped String Indexing in Subquadratic Space and Sublinear Query Time. CoRR abs/2211.16860 (2022) - 2021
- [j29]Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Top Tree Compression of Tries. Algorithmica 83(12): 3602-3628 (2021) - [c48]Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Teresa Anna Steiner:
Gapped Indexing for Consecutive Occurrences. CPM 2021: 10:1-10:19 - [i44]Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Teresa Anna Steiner:
Gapped Indexing for Consecutive Occurrences. CoRR abs/2102.02505 (2021) - [i43]Philip Bille, Inge Li Gørtz, Shay Mozes, Teresa Anna Steiner, Oren Weimann:
A Conditional Lower Bound for Episode Matching. CoRR abs/2108.08613 (2021) - 2020
- [j28]Fatemeh Navidi, Inge Li Gørtz, Viswanath Nagarajan:
Approximation algorithms for the a priori traveling repairman. Oper. Res. Lett. 48(5): 599-606 (2020) - [c47]Philip Bille, Mikko Berggren Ettienne, Travis Gagie, Inge Li Gørtz, Nicola Prezza:
Decompressing Lempel-Ziv Compressed Text. DCC 2020: 143-152 - [c46]Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Eva Rotenberg, Teresa Anna Steiner:
String Indexing for Top-k Close Consecutive Occurrences. FSTTCS 2020: 14:1-14:17 - [c45]Philip Bille, Jonas Ellert, Johannes Fischer, Inge Li Gørtz, Florian Kurpicz, J. Ian Munro, Eva Rotenberg:
Space Efficient Construction of Lyndon Arrays in Linear Time. ICALP 2020: 14:1-14:18 - [c44]Philip Bille, Inge Li Gørtz:
Random Access in Persistent Strings. ISAAC 2020: 48:1-48:16 - [c43]Philip Bille, Inge Li Gørtz, Teresa Anna Steiner:
String Indexing with Compressed Patterns. STACS 2020: 10:1-10:13 - [c42]Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen:
Partial Sums on the Ultra-Wide Word RAM. TAMC 2020: 13-24 - [e3]Inge Li Gørtz, Oren Weimann:
31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020, June 17-19, 2020, Copenhagen, Denmark. LIPIcs 161, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-149-8 [contents] - [e2]Martin Farach-Colton, Inge Li Gørtz:
3rd Symposium on Simplicity in Algorithms, SOSA 2020, Salt Lake City, UT, USA, January 6-7, 2020. SIAM 2020, ISBN 978-1-61197-601-4 [contents] - [i42]Philip Bille, Inge Li Gørtz:
Random Access in Persistent Strings. CoRR abs/2006.15575 (2020) - [i41]Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Eva Rotenberg, Teresa Anna Steiner:
String Indexing for Top-k Close Consecutive Occurrences. CoRR abs/2007.04128 (2020)
2010 – 2019
- 2019
- [c41]Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Top Tree Compression of Tries. ISAAC 2019: 4:1-4:18 - [c40]Philip Bille, Inge Li Gørtz:
From Regular Expression Matching to Parsing. MFCS 2019: 71:1-71:14 - [i40]Philip Bille, Mikko Berggren Ettienne, Inge Li Gørtz:
Mergeable Dictionaries With Shifts. CoRR abs/1901.00718 (2019) - [i39]Inge Li Gørtz, Viswanath Nagarajan, Fatemeh Navidi:
Approximation Algorithms for the A Priori TravelingRepairman. CoRR abs/1901.06581 (2019) - [i38]Philip Bille, Inge Li Gørtz, Pawel Gawrychowski, Gad M. Landau, Oren Weimann:
Top Tree Compression of Tries. CoRR abs/1902.02187 (2019) - [i37]Philip Bille, Inge Li Gørtz:
Sparse Regular Expression Matching. CoRR abs/1907.04752 (2019) - [i36]Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen:
Partial Sums on the Ultra-Wide Word RAM. CoRR abs/1908.10159 (2019) - [i35]Philip Bille, Inge Li Gørtz, Teresa Anna Steiner:
String Indexing with Compressed Patterns. CoRR abs/1909.11930 (2019) - [i34]Philip Bille, Jonas Ellert, Johannes Fischer, Inge Li Gørtz, Florian Kurpicz, Ian Munro, Eva Rotenberg:
Space Efficient Construction of Lyndon Arrays in Linear Time. CoRR abs/1911.03542 (2019) - [i33]Martin Farach-Colton, Inge Li Gørtz, Rob Johnson, Donald E. Porter:
Theoretical Foundations of Storage Systems (Dagstuhl Seminar 19111). Dagstuhl Reports 9(3): 39-51 (2019) - 2018
- [j27]Philip Bille, Anders Roy Christiansen, Patrick Hagge Cording, Inge Li Gørtz, Frederik Rye Skjoldjensen, Hjalte Wedel Vildhøj, Søren Vind:
Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation. Algorithmica 80(11): 3207-3224 (2018) - [j26]Philip Bille, Travis Gagie, Inge Li Gørtz, Nicola Prezza:
A separation between RLSLPs and LZ77. J. Discrete Algorithms 50: 36-39 (2018) - [j25]Philip Bille, Anders Roy Christiansen, Patrick Hagge Cording, Inge Li Gørtz:
Finger Search in Grammar-Compressed Strings. Theory Comput. Syst. 62(8): 1715-1735 (2018) - [j24]Philip Bille, Mikko Berggren Ettienne, Inge Li Gørtz, Hjalte Wedel Vildhøj:
Time-space trade-offs for Lempel-Ziv compressed indexing. Theor. Comput. Sci. 713: 66-77 (2018) - [c39]Philip Bille, Mikko Berggren Ettienne, Roberto Grossi, Inge Li Gørtz, Eva Rotenberg:
Compressed Communication Complexity of Longest Common Prefixes. SPIRE 2018: 74-87 - [i32]Philip Bille, Mikko Berggren Ettienne, Travis Gagie, Inge Li Gørtz, Nicola Prezza:
Fast Lempel-Ziv Decompression in Linear Space. CoRR abs/1802.10347 (2018) - [i31]Philip Bille, Inge Li Gørtz:
From Regular Expression Matching to Parsing. CoRR abs/1804.02906 (2018) - [i30]Philip Bille, Mikko Berggren Ettienne, Roberto Grossi, Inge Li Gørtz, Eva Rotenberg:
Compressed Communication Complexity of Longest Common Prefixes. CoRR abs/1806.03102 (2018) - 2017
- [j23]Philip Bille, Patrick Hagge Cording, Inge Li Gørtz:
Compressed Subsequence Matching and Packed Tree Coloring. Algorithmica 77(2): 336-348 (2017) - [j22]Philip Bille, Inge Li Gørtz, Patrick Hagge Cording, Benjamin Sach, Hjalte Wedel Vildhøj, Søren Vind:
Fingerprints in compressed strings. J. Comput. Syst. Sci. 86: 171-180 (2017) - [j21]Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen:
Subsequence automata with default transitions. J. Discrete Algorithms 44: 48-55 (2017) - [c38]Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen:
Deterministic Indexing for Packed Strings. CPM 2017: 6:1-6:11 - [c37]Philip Bille, Patrick Hagge Cording, Johannes Fischer, Inge Li Gørtz:
Lempel-Ziv Compression in a Sliding Window. CPM 2017: 15:1-15:11 - [c36]Philip Bille, Mikko Berggren Ettienne, Inge Li Gørtz, Hjalte Wedel Vildhøj:
Time-Space Trade-Offs for Lempel-Ziv Compressed Indexing. CPM 2017: 16:1-16:17 - [c35]Philip Bille, Inge Li Gørtz, Nicola Prezza:
Space-Efficient Re-Pair Compression. DCC 2017: 171-180 - [c34]Philip Bille, Anders Roy Christiansen, Mikko Berggren Ettienne, Inge Li Gørtz:
Fast Dynamic Arrays. ESA 2017: 16:1-16:13 - [c33]Philip Bille, Inge Li Gørtz:
Immersive Algorithms: Better Visualization with Less Information. ITiCSE 2017: 80-81 - [c32]Philip Bille, Finn Fernstrøm, Inge Li Gørtz:
Tight Bounds for Top Tree Compression. SPIRE 2017: 97-102 - [i29]Philip Bille, Inge Li Gørtz, Nicola Prezza:
Practical and Effective Re-Pair Compression. CoRR abs/1704.08558 (2017) - [i28]Philip Bille, Mikko Berggren Ettienne, Inge Li Gørtz, Hjalte Wedel Vildhøj:
Time-Space Trade-Offs for Lempel-Ziv Compressed Indexing. CoRR abs/1706.10094 (2017) - [i27]Philip Bille, Anders Roy Christiansen, Mikko Berggren Ettienne, Inge Li Gørtz:
Fast Dynamic Arrays. CoRR abs/1711.00275 (2017) - [i26]Philip Bille, Travis Gagie, Inge Li Gørtz, Nicola Prezza:
A Separation Between Run-Length SLPs and LZ77. CoRR abs/1711.07270 (2017) - 2016
- [j20]Inge Li Gørtz, Marco Molinaro, Viswanath Nagarajan, R. Ravi:
Capacitated Vehicle Routing with Nonuniform Speeds. Math. Oper. Res. 41(1): 318-331 (2016) - [j19]Inge Li Gørtz, Viswanath Nagarajan:
Locating depots for capacitated vehicle routing. Networks 68(2): 94-103 (2016) - [j18]Philip Bille, Johannes Fischer, Inge Li Gørtz, Tsvi Kopelowitz, Benjamin Sach, Hjalte Wedel Vildhøj:
Sparse Text Indexing in Small Space. ACM Trans. Algorithms 12(3): 39:1-39:19 (2016) - [j17]Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Longest common extensions in trees. Theor. Comput. Sci. 638: 98-107 (2016) - [c31]Mika Amit, Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Hjalte Wedel Vildhøj:
Boxed Permutation Pattern Matching. CPM 2016: 20:1-20:11 - [c30]Philip Bille, Anders Roy Christiansen, Patrick Hagge Cording, Inge Li Gørtz:
Finger Search in Grammar-Compressed Strings. FSTTCS 2016: 36:1-36:16 - [c29]Stephen Alstrup, Inge Li Gørtz, Esben Bistrup Halvorsen, Ely Porat:
Distance Labeling Schemes for Trees. ICALP 2016: 132:1-132:16 - [c28]Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Frederik Rye Skjoldjensen, Hjalte Wedel Vildhøj, Søren Vind:
Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation. ISAAC 2016: 18:1-18:13 - [c27]Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen:
Subsequence Automata with Default Transitions. SOFSEM 2016: 208-216 - [i25]Philip Bille, Inge Li Gørtz, Nicola Prezza:
Space-Efficient Re-Pair Compression. CoRR abs/1611.01479 (2016) - [i24]Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen:
Deterministic Indexing for Packed Strings. CoRR abs/1612.01748 (2016) - 2015
- [j16]Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Tree compression with top trees. Inf. Comput. 243: 166-177 (2015) - [j15]Inge Li Gørtz, Viswanath Nagarajan, R. Ravi:
Minimum Makespan Multi-Vehicle Dial-a-Ride. ACM Trans. Algorithms 11(3): 23:1-23:29 (2015) - [c26]Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Longest Common Extensions in Trees. CPM 2015: 52-64 - [c25]Philip Bille, Inge Li Gørtz, Mathias Bæk Tejs Knudsen, Moshe Lewenstein, Hjalte Wedel Vildhøj:
Longest Common Extensions in Sublinear Space. CPM 2015: 65-76 - [c24]Philip Bille, Inge Li Gørtz, Søren Vind:
Compressed Data Structures for Range Searching. LATA 2015: 577-586 - [i23]Philip Bille, Inge Li Gørtz, Mathias Bæk Tejs Knudsen, Moshe Lewenstein, Hjalte Wedel Vildhøj:
Longest Common Extensions in Sublinear Space. CoRR abs/1504.02671 (2015) - [i22]Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Frederik Rye Skjoldjensen, Hjalte Wedel Vildhøj, Søren Vind:
Dynamic Relative Compression. CoRR abs/1504.07851 (2015) - [i21]Philip Bille, Anders Roy Christiansen, Patrick Hagge Cording, Inge Li Gørtz:
Finger Search, Random Access, and Longest Common Extensions in Grammar-Compressed Strings. CoRR abs/1507.02853 (2015) - [i20]Stephen Alstrup, Inge Li Gørtz, Esben Bistrup Halvorsen, Ely Porat:
Distance labeling schemes for trees. CoRR abs/1507.04046 (2015) - [i19]Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen:
Subsequence Automata with Default Transitions. CoRR abs/1510.08748 (2015) - 2014
- [j14]Philip Bille, Inge Li Gørtz:
Substring Range Reporting. Algorithmica 69(2): 384-396 (2014) - [j13]Philip Bille, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj:
Time-space trade-offs for longest common extensions. J. Discrete Algorithms 25: 42-50 (2014) - [j12]Philip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj, Søren Vind:
String Indexing for Patterns with Wildcards. Theory Comput. Syst. 55(1): 41-60 (2014) - [j11]Stephen Alstrup, Mikkel Thorup, Inge Li Gørtz, Theis Rauhe, Uri Zwick:
Union-Find with Constant Time Deletions. ACM Trans. Algorithms 11(1): 6:1-6:28 (2014) - [j10]Philip Bille, Patrick Hagge Cording, Inge Li Gørtz:
Compact q-gram profiling of compressed strings. Theor. Comput. Sci. 550: 51-58 (2014) - [c23]Philip Bille, Patrick Hagge Cording, Inge Li Gørtz:
Compressed Subsequence Matching and Packed Tree Coloring. CPM 2014: 40-49 - [c22]Søren Vind, Philip Bille, Inge Li Gørtz:
Indexing Motion Detection Data for Surveillance Video. ISM 2014: 24-27 - [e1]R. Ravi, Inge Li Gørtz:
Algorithm Theory - SWAT 2014 - 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014. Proceedings. Lecture Notes in Computer Science 8503, Springer 2014, ISBN 978-3-319-08403-9 [contents] - [i18]Philip Bille, Patrick Hagge Cording, Inge Li Gørtz:
Compact Subsequence Matching and Packed Tree Coloring. CoRR abs/1403.1065 (2014) - [i17]Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Longest Common Extensions in Trees. CoRR abs/1412.1254 (2014) - 2013
- [c21]Philip Bille, Patrick Hagge Cording, Inge Li Gørtz:
Compact q-Gram Profiling of Compressed Strings. CPM 2013: 62-73 - [c20]Philip Bille, Johannes Fischer, Inge Li Gørtz, Tsvi Kopelowitz, Benjamin Sach, Hjalte Wedel Vildhøj:
Sparse Suffix Tree Construction in Small Space. ICALP (1) 2013: 148-159 - [c19]Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Tree Compression with Top Trees. ICALP (1) 2013: 160-171 - [c18]Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj, Søren Vind:
Fingerprints in Compressed Strings. WADS 2013: 146-157 - [i16]Philip Bille, Patrick Hagge Cording, Inge Li Gørtz:
Compact q-gram Profiling of Compressed Strings. CoRR abs/1304.5373 (2013) - [i15]Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Tree Compression with Top Trees. CoRR abs/1304.5702 (2013) - [i14]Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj, Søren Vind:
Fingerprints in Compressed Strings. CoRR abs/1305.2777 (2013) - 2012
- [j9]Philip Bille, Inge Li Gørtz:
Fast Arc-Annotated Subsequence Matching in Linear Space. Algorithmica 62(1-2): 209-223 (2012) - [j8]Philip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj, David Kofoed Wind:
String matching with variable length gaps. Theor. Comput. Sci. 443: 25-34 (2012) - [c17]Philip Bille, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj:
Time-Space Trade-Offs for Longest Common Extensions. CPM 2012: 293-305 - [c16]Inge Li Gørtz, Viswanath Nagarajan, Rishi Saket:
Stochastic Vehicle Routing with Recourse. ICALP (1) 2012: 411-423 - [c15]Philip Bille, Inge Li Gørtz, Jesper Kristensen:
Longest Common Extensions via Fingerprinting. LATA 2012: 119-130 - [c14]