Inge Li Gørtz
Inge Li Gørtz
Verified email at
Cited by
Cited by
String matching with variable length gaps
P Bille, IL Gørtz, HW Vildhøj, DK Wind
Theoretical Computer Science 443, 25-34, 2012
Tree compression with top trees
P Bille, IL Gørtz, GM Landau, O Weimann
Information and Computation 243, 166-177, 2015
Time–space trade-offs for longest common extensions
P Bille, IL Gørtz, B Sach, HW Vildhøj
Journal of Discrete Algorithms 25, 42-50, 2014
The tree inclusion problem: In linear space and faster
P Bille, IL Gortz
ACM Transactions on Algorithms (TALG) 7 (3), 1-47, 2011
Time–space trade-offs for Lempel–Ziv compressed indexing
P Bille, MB Ettienne, IL Gørtz, HW Vildhøj
Theoretical Computer Science 713, 66-77, 2018
String indexing for patterns with wildcards
P Bille, IL Gørtz, HW Vildhøj, S Vind
Theory of Computing Systems 55 (1), 41-60, 2014
Minimum makespan multi-vehicle dial-a-ride
IL Gørtz, V Nagarajan, R Ravi
ACM Transactions on Algorithms (TALG) 11 (3), 1-29, 2015
Fingerprints in compressed strings
P Bille, IL Gørtz, PH Cording, B Sach, HW Vildhøj, S Vind
Journal of Computer and System Sciences 86, 171-180, 2017
Space-efficient re-pair compression
P Bille, IL Gørtz, N Prezza
2017 Data Compression Conference (DCC), 171-180, 2017
Longest common extensions in sublinear space
P Bille, IL Gørtz, MBT Knudsen, M Lewenstein, HW Vildhøj
Annual Symposium on Combinatorial Pattern Matching, 65-76, 2015
Union-find with constant time deletions
S Alstrup, M Thorup, IL Gørtz, T Rauhe, U Zwick
ACM Transactions on Algorithms (TALG) 11 (1), 1-28, 2014
Substring range reporting
P Bille, IL Gørtz
Algorithmica 69 (2), 384-396, 2014
Sparse text indexing in small space
P Bille, J Fischer, IL Gørtz, T Kopelowitz, B Sach, HW Vildhøj
ACM Transactions on Algorithms (TALG) 12 (3), 1-19, 2016
Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts
P Bille, R Fagerberg, IL Gørtz
ACM Transactions on Algorithms (TALG) 6 (1), 3, 2009
Dynamic relative compression, dynamic partial sums, and substring concatenation
P Bille, AR Christiansen, PH Cording, IL Gørtz, FR Skjoldjensen, ...
Algorithmica 80 (11), 3207-3224, 2018
Distance labeling schemes for trees
S Alstrup, IL Gørtz, EB Halvorsen, E Porat
arXiv preprint arXiv:1507.04046, 2015
Asymmetry in k-Center Variants
IL Gørtz, A Wirth
Approximation, Randomization, and Combinatorial Optimization.. Algorithms …, 2003
Time and space efficient multi-method dispatching
S Alstrup, GS Brodal, IL Gørtz, T Rauhe
Scandinavian Workshop on Algorithm Theory, 20-29, 2002
Finger search in grammar-compressed strings
P Bille, AR Christiansen, PH Cording, IL Gørtz
Theory of Computing Systems 62 (8), 1715-1735, 2018
Tight bounds for top tree compression
P Bille, F Fernstrøm, IL Gørtz
International Symposium on String Processing and Information Retrieval, 97-102, 2017
The system can't perform the operation now. Try again later.
Articles 1–20