Inge Li Gørtz

ORCID

Publication Activity (10 Years)

Years Active: 2002-2024
Publications (10 Years): 84

Top Venues

Publications

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)
Philip Bille, Christian Mikkelsen Fuglsang, Inge Li Gørtz
Tight Bounds for Compressing Substring Samples. CPM (2024)
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)
Philip Bille, Inge Li Gørtz
Sparse Regular Expression Matching. SODA (2024)
Philip Bille, Martín Farach-Colton, Inge Li Gørtz, Ivor van der Hoog
Snake in Optimal Space and Time. FUN (2024)
Philip Bille, Inge Li Gørtz, Tord Stordalen
Predecessor on the Ultra-Wide Word RAM. Algorithmica 86 (5) (2024)
Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Simon R. Tarnow
Faster Sliding Window String Indexing in Streams. CPM (2024)
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)
Philip Bille, Inge Li Gørtz, Tord Stordalen
Rank and Select on Degenerate Strings. DCC (2024)
Philip Bille, Inge Li Gørtz, Simon J. Puglisi, Simon R. Tarnow
Hierarchical Relative Lempel-Ziv Compression. SEA (2023)
Philip Bille, Johannes Fischer, Inge Li Gørtz, Max Rishøj Pedersen, Tord Joakim Stordalen
Sliding Window String Indexing in Streams. CPM (2023)
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 (2023)
Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen
Faster Compression of Deterministic Finite Automata. CoRR (2023)
Philip Bille, Inge Li Gørtz
Random Access in Persistent Strings and Segment Selection. Theory Comput. Syst. 67 (4) (2023)
Philip Bille, Inge Li Gørtz, Teresa Anna Steiner
String Indexing with Compressed Patterns. ACM Trans. Algorithms 19 (4) (2023)
Philip Bille, Johannes Fischer, Inge Li Gørtz, Max Rishøj Pedersen, Tord Joakim Stordalen
Sliding Window String Indexing in Streams. CoRR (2023)
Philip Bille, Inge Li Gørtz, Tord Stordalen
Rank and Select on Degenerate Strings. CoRR (2023)
Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Teresa Anna Steiner
Gapped Indexing for Consecutive Occurrences. Algorithmica 85 (4) (2023)
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 (2022)
Philip Bille, Inge Li Gørtz, Shay Mozes, Teresa Anna Steiner, Oren Weimann
The Fine-Grained Complexity of Episode Matching. CPM (2022)
Philip Bille, Inge Li Gørtz
From regular expression matching to parsing. Acta Informatica 59 (6) (2022)
Philip Bille, Inge Li Gørtz, Tord Stordalen
The Complexity of the Co-occurrence Problem. SPIRE (2022)
Philip Bille, Inge Li Gørtz, Tord Stordalen
The Complexity of the Co-Occurrence Problem. CoRR (2022)
Philip Bille, Inge Li Gørtz, Tord Stordalen
Predecessor on the Ultra-Wide Word RAM. SWAT (2022)
Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen
Partial sums on the ultra-wide word RAM. Theor. Comput. Sci. 905 (2022)
Philip Bille, Inge Li Gørtz, Simon J. Puglisi, Simon R. Tarnow
Hierarchical Relative Lempel-Ziv Compression. CoRR (2022)
Philip Bille, Inge Li Gørtz, Tord Stordalen
Predecessor on the Ultra-Wide Word RAM. CoRR (2022)
Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Eva Rotenberg, Teresa Anna Steiner
close consecutive occurrences. Theor. Comput. Sci. 927 (2022)
Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Teresa Anna Steiner
Gapped Indexing for Consecutive Occurrences. CPM (2021)
Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Teresa Anna Steiner
Gapped Indexing for Consecutive Occurrences. CoRR (2021)
Philip Bille, Inge Li Gørtz, Shay Mozes, Teresa Anna Steiner, Oren Weimann
A Conditional Lower Bound for Episode Matching. CoRR (2021)
Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann
Top Tree Compression of Tries. Algorithmica 83 (12) (2021)
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)
Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Eva Rotenberg, Teresa Anna Steiner
String Indexing for Top-k Close Consecutive Occurrences. CoRR (2020)
Fatemeh Navidi, Inge Li Gørtz, Viswanath Nagarajan
Approximation algorithms for the a priori traveling repairman. Oper. Res. Lett. 48 (5) (2020)
Philip Bille, Inge Li Gørtz, Teresa Anna Steiner
String Indexing with Compressed Patterns. STACS (2020)
Philip Bille, Inge Li Gørtz
Random Access in Persistent Strings. ISAAC (2020)
Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen
Partial Sums on the Ultra-Wide Word RAM. TAMC (2020)
Philip Bille, Mikko Berggren Ettienne, Travis Gagie, Inge Li Gørtz, Nicola Prezza
Decompressing Lempel-Ziv Compressed Text. DCC (2020)
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)
Philip Bille, Inge Li Gørtz
Random Access in Persistent Strings. CoRR (2020)
Martin Farach-Colton, Inge Li Gørtz, Rob Johnson, Donald E. Porter
Theoretical Foundations of Storage Systems (Dagstuhl Seminar 19111). Dagstuhl Reports 9 (3) (2019)
Philip Bille, Inge Li Gørtz
From Regular Expression Matching to Parsing. MFCS (2019)
Philip Bille, Inge Li Gørtz, Teresa Anna Steiner
String Indexing with Compressed Patterns. CoRR (2019)
Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen
Partial Sums on the Ultra-Wide Word RAM. CoRR (2019)
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 (2019)
Philip Bille, Inge Li Gørtz, Pawel Gawrychowski, Gad M. Landau, Oren Weimann
Top Tree Compression of Tries. CoRR (2019)
Inge Li Gørtz, Viswanath Nagarajan, Fatemeh Navidi
Approximation Algorithms for the A Priori TravelingRepairman. CoRR (2019)
Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann
Top Tree Compression of Tries. ISAAC (2019)
Philip Bille, Inge Li Gørtz
Sparse Regular Expression Matching. CoRR (2019)
Philip Bille, Mikko Berggren Ettienne, Inge Li Gørtz
Mergeable Dictionaries With Shifts. CoRR (2019)
Philip Bille, Mikko Berggren Ettienne, Roberto Grossi, Inge Li Gørtz, Eva Rotenberg
Compressed Communication Complexity of Longest Common Prefixes. SPIRE (2018)
Philip Bille, Travis Gagie, Inge Li Gørtz, Nicola Prezza
A separation between RLSLPs and LZ77. J. Discrete Algorithms 50 (2018)
Philip Bille, Anders Roy Christiansen, Patrick Hagge Cording, Inge Li Gørtz
Finger Search in Grammar-Compressed Strings. Theory Comput. Syst. 62 (8) (2018)
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) (2018)
Philip Bille, Inge Li Gørtz
From Regular Expression Matching to Parsing. CoRR (2018)
Philip Bille, Mikko Berggren Ettienne, Roberto Grossi, Inge Li Gørtz, Eva Rotenberg
Compressed Communication Complexity of Longest Common Prefixes. CoRR (2018)
Philip Bille, Mikko Berggren Ettienne, Travis Gagie, Inge Li Gørtz, Nicola Prezza
Fast Lempel-Ziv Decompression in Linear Space. CoRR (2018)
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 (2018)
Philip Bille, Travis Gagie, Inge Li Gørtz, Nicola Prezza
A Separation Between Run-Length SLPs and LZ77. CoRR (2017)
Philip Bille, Mikko Berggren Ettienne, Inge Li Gørtz, Hjalte Wedel Vildhøj
Time-Space Trade-Offs for Lempel-Ziv Compressed Indexing. CoRR (2017)
Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen
Deterministic Indexing for Packed Strings. CPM (2017)
Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen
Subsequence automata with default transitions. J. Discrete Algorithms 44 (2017)
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 (2017)
Philip Bille, Anders Roy Christiansen, Mikko Berggren Ettienne, Inge Li Gørtz
Fast Dynamic Arrays. CoRR (2017)
Philip Bille, Anders Roy Christiansen, Mikko Berggren Ettienne, Inge Li Gørtz
Fast Dynamic Arrays. ESA (2017)
Philip Bille, Inge Li Gørtz, Nicola Prezza
Space-Efficient Re-Pair Compression. DCC (2017)
Philip Bille, Inge Li Gørtz
Immersive Algorithms: Better Visualization with Less Information. ITiCSE (2017)
Philip Bille, Patrick Hagge Cording, Inge Li Gørtz
Compressed Subsequence Matching and Packed Tree Coloring. Algorithmica 77 (2) (2017)
Philip Bille, Mikko Berggren Ettienne, Inge Li Gørtz, Hjalte Wedel Vildhøj
Time-Space Trade-Offs for Lempel-Ziv Compressed Indexing. CPM (2017)
Philip Bille, Patrick Hagge Cording, Johannes Fischer, Inge Li Gørtz
Lempel-Ziv Compression in a Sliding Window. CPM (2017)
Philip Bille, Finn Fernstrøm, Inge Li Gørtz
Tight Bounds for Top Tree Compression. SPIRE (2017)
Philip Bille, Inge Li Gørtz, Nicola Prezza
Practical and Effective Re-Pair Compression. CoRR (2017)
Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen
Deterministic Indexing for Packed Strings. CoRR (2016)
Philip Bille, Inge Li Gørtz, Nicola Prezza
Space-Efficient Re-Pair Compression. CoRR (2016)
Philip Bille, Anders Roy Christiansen, Patrick Hagge Cording, Inge Li Gørtz
Finger Search in Grammar-Compressed Strings. FSTTCS (2016)
Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen
Subsequence Automata with Default Transitions. SOFSEM (2016)
Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann
Longest common extensions in trees. Theor. Comput. Sci. 638 (2016)
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)
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) (2016)
Mika Amit, Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Hjalte Wedel Vildhøj
Boxed Permutation Pattern Matching. CPM (2016)
Inge Li Gørtz, Marco Molinaro, Viswanath Nagarajan, R. Ravi
Capacitated Vehicle Routing with Nonuniform Speeds. Math. Oper. Res. 41 (1) (2016)
Stephen Alstrup, Inge Li Gørtz, Esben Bistrup Halvorsen, Ely Porat
Distance Labeling Schemes for Trees. ICALP (2016)
Inge Li Gørtz, Viswanath Nagarajan
Locating depots for capacitated vehicle routing. Networks 68 (2) (2016)
Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Frederik Rye Skjoldjensen, Hjalte Wedel Vildhøj, Søren Vind
Dynamic Relative Compression. CoRR (2015)
Philip Bille, Inge Li Gørtz, Mathias Bæk Tejs Knudsen, Moshe Lewenstein, Hjalte Wedel Vildhøj
Longest Common Extensions in Sublinear Space. CoRR (2015)
Philip Bille, Inge Li Gørtz, Søren Vind
Compressed Data Structures for Range Searching. LATA (2015)
Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann
Tree compression with top trees. Inf. Comput. 243 (2015)
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)
Inge Li Gørtz, Viswanath Nagarajan, R. Ravi
Minimum Makespan Multi-Vehicle Dial-a-Ride. ACM Trans. Algorithms 11 (3) (2015)
Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen
Subsequence Automata with Default Transitions. CoRR (2015)
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 (2015)
Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann
Longest Common Extensions in Trees. CPM (2015)
Stephen Alstrup, Inge Li Gørtz, Esben Bistrup Halvorsen, Ely Porat
Distance labeling schemes for trees. CoRR (2015)
Stephen Alstrup, Mikkel Thorup, Inge Li Gørtz, Theis Rauhe, Uri Zwick
Union-Find with Constant Time Deletions. ACM Trans. Algorithms 11 (1) (2014)
Philip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj, Søren Vind
String Indexing for Patterns with Wildcards. Theory Comput. Syst. 55 (1) (2014)
Philip Bille, Inge Li Gørtz, Gad M. Landau, Oren Weimann
Longest Common Extensions in Trees. CoRR (2014)
Philip Bille, Patrick Hagge Cording, Inge Li Gørtz
Compact Subsequence Matching and Packed Tree Coloring. CoRR (2014)
Philip Bille, Patrick Hagge Cording, Inge Li Gørtz
Compact q-gram profiling of compressed strings. Theor. Comput. Sci. 550 (2014)
Philip Bille, Patrick Hagge Cording, Inge Li Gørtz
Compressed Subsequence Matching and Packed Tree Coloring. CPM (2014)

Inge Li Gørtz.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Inge Li Gørtz