Inge Li Gørtz
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Inge Li Gørtz has a total of 98 co-authors. Here are the top co-authors by number of shared publications:
- Philip Bille
Technical University of Denmark
77 shared publications Hjalte Wedel Vildhøj
Technical University of Denmark
11 shared publications- Oren Weimann
University of Haifa
9 shared publications Patrick Hagge Cording
Technical University of Denmark
7 shared publicationsPhilip Bille
Department of Informatics and Mathematical Modelling Department of Informatics and Mathematical Modelling Technical University of Denmark Technical University of Denmark Build- ing 322 Office 124 DK-2800 Kongens Lyngby Denmark
7 shared publications- Teresa Anna Steiner
University of Southern Denmark, Odense, Denmark
6 shared publications
Latest Publications
- 5 November 2026
- Published by Springer Nature
- p. 204-212
Tighter Bounds for Wheeler Determinization
- 5 November 2026
- Published by Springer Nature
- p. 18-33
$k^2$-octopus: An Adaptive Data Structure for Binary Matrices- 5 November 2026
- Published by Springer Nature
- p. 18-33
$k^2$-octopus: An Adaptive Data Structure for Binary Matrices- 5 November 2026
- Published by Springer Nature
- p. 1-17
Average-Case Optimal Encodings and Efficient Worst-Case Indices for Element Distinctness Queries
- 5 November 2026
- Published by Springer Nature
- p. 1-17
Average-Case Optimal Encodings and Efficient Worst-Case Indices for Element Distinctness Queries
- 9 October 2026
- Published by Springer Nature
- p. 16-26
Data Stream Algorithms Unplugged
- Open Access
- 18 September 2026
- Published by Elsevier in Information and Computation
- Vol. 313
Dynamic range minimum queries on the ultra-wide word RAM
- 18 September 2026
- Published by Elsevier in Information and Computation
- Vol. 313
Open AccessDynamic range minimum queries on the ultra-wide word RAM
- Open Access
- 6 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 405-415
The Local/Global Disk Problem: How to Use Shared High-Bandwidth Storage Economically
- 6 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 405-415
Open AccessThe Local/Global Disk Problem: How to Use Shared High-Bandwidth Storage Economically
- Open Access
- 9 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 1548-1557
An Optimal Algorithm for Stochastic Vertex Cover
- 9 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 1548-1557
Open AccessAn Optimal Algorithm for Stochastic Vertex Cover
- Open Access
- 28 May 2026
- Published by Springer Nature in Algorithmica
- Vol. 88 (3) , 50
Compressed Dictionary Matching on Run-Length Encoded Strings
Given a set of pattern strings $$\mathcal {P}=\{P_1, P_2,\ldots P_k\}$$ and a text string S , the classic dictionary matching problem is to report all occurrences of each pattern in S . We study the dictionary problem in the compressed setting, where the pattern strings and the text string are compressed using run-length encoding, and the goal is to solve the problem without decompression and achieve efficient time and space in the size of the compressed strings. Let m and n be the total length of the patterns $$\mathcal {P}$$ and the length of the text string S , respectively, and let $$\overline{m}$$ and $$\overline{n}$$ be the total number of runs in the run-length encoding of the patterns in $$\mathcal {P}$$ and S , respectively. Our main result is an algorithm that achieves $$O( (\overline{m} + \overline{n})\log \log m + \textrm{occ})$$ expected time, and $$O(\overline{m})$$ space, where $$\textrm{occ}$$ is the total number of occurrences of patterns in S . This is the first non-trivial solution to the problem. Since any solution must read the input, our time bound is optimal within a $$\log \log m$$ factor. We introduce several new techniques to achieve our bounds, including a new compressed representation of the classic Aho-Corasick automaton and a new efficient string index that supports fast queries in run-length encoded strings.- 28 May 2026
- Published by Springer Nature in Algorithmica
- Vol. 88 (3) , 50
Open AccessCompressed Dictionary Matching on Run-Length Encoded Strings
Given a set of pattern strings $$\mathcal {P}=\{P_1, P_2,\ldots P_k\}$$ and a text string S , the classic dictionary matching problem is to report all occurrences of each pattern in S . We study the dictionary problem in the compressed setting, where the pattern strings and the text string are compressed using run-length encoding, and the goal is to solve the problem without decompression and achieve efficient time and space in the size of the compressed strings. Let m and n be the total length of the patterns $$\mathcal {P}$$ and the length of the text string S , respectively, and let $$\overline{m}$$ and $$\overline{n}$$ be the total number of runs in the run-length encoding of the patterns in $$\mathcal {P}$$ and S , respectively. Our main result is an algorithm that achieves $$O( (\overline{m} + \overline{n})\log \log m + \textrm{occ})$$ expected time, and $$O(\overline{m})$$ space, where $$\textrm{occ}$$ is the total number of occurrences of patterns in S . This is the first non-trivial solution to the problem. Since any solution must read the input, our time bound is optimal within a $$\log \log m$$ factor. We introduce several new techniques to achieve our bounds, including a new compressed representation of the classic Aho-Corasick automaton and a new efficient string index that supports fast queries in run-length encoded strings. - Open Access
- 4 December 2025
- Published by Springer Nature in Research Square
Compressed Dictionary Matching on Run-Length Encoded Strings
Given a set of pattern strings P = {P1, P2, . . . Pk} and a text string S, the classic dictionary matching problem is to report all occurrences of each pattern in S. We study the dictionary problem in the compressed setting, where the pattern strings and the text string are compressed using run-length encoding, and the goal is to solve the problem without decompression and achieve efficient time and space in the size of the compressed strings. Let m and n be the total length of the patterns P and the length of the text string S, respectively, and let m and n be the total number of runs in the run-length encoding of the patterns in P and S, respectively. Our main result is an algorithm that achieves O((m+n) log logm+occ) expected time, and O(m) space, where occ is the total number of occurrences of patterns in S. This is the first non-trivial solution to the problem. Since any solution must read the input, our time bound is optimal within an log logm factor. We introduce several new techniques to achieve our bounds, including a new compressed representation of the classic Aho-Corasick automaton and a new efficient string index that supports fast queries in runlength encoded strings.
- 4 December 2025
- Published by Springer Nature in Research Square
Open AccessCompressed Dictionary Matching on Run-Length Encoded Strings
Given a set of pattern strings P = {P1, P2, . . . Pk} and a text string S, the classic dictionary matching problem is to report all occurrences of each pattern in S. We study the dictionary problem in the compressed setting, where the pattern strings and the text string are compressed using run-length encoding, and the goal is to solve the problem without decompression and achieve efficient time and space in the size of the compressed strings. Let m and n be the total length of the patterns P and the length of the text string S, respectively, and let m and n be the total number of runs in the run-length encoding of the patterns in P and S, respectively. Our main result is an algorithm that achieves O((m+n) log logm+occ) expected time, and O(m) space, where occ is the total number of occurrences of patterns in S. This is the first non-trivial solution to the problem. Since any solution must read the input, our time bound is optimal within an log logm factor. We introduce several new techniques to achieve our bounds, including a new compressed representation of the classic Aho-Corasick automaton and a new efficient string index that supports fast queries in runlength encoded strings.
- Open Access
Compressed Dictionary Matching on Run-Length Encoded Strings
Given a set of pattern strings $\mathcal{P}=\{P_1, P_2,\ldots P_k\}$ and a text string $S$, the classic dictionary matching problem is to report all occurrences of each pattern in $S$. We study the dictionary problem in the compressed setting, where the pattern strings and the text string are compressed using run-length encoding, and the goal is to solve the problem without decompression and achieve efficient time and space in the size of the compressed strings. Let $m$ and $n$ be the total length of the patterns $\mathcal{P}$ and the length of the text string $S$, respectively, and let $\overline{m}$ and $\overline{n}$ be the total number of runs in the run-length encoding of the patterns in $\mathcal{P}$ and $S$, respectively. Our main result is an algorithm that achieves $O( (\overline{m} + \overline{n})\log \log m + \mathrm{occ})$ expected time, and $O(\overline{m})$ space, where $\mathrm{occ}$ is the total number of occurrences of patterns in $S$. This is the first non-trivial solution to the problem. Since any solution must read the input, our time bound is optimal within an $\log \log m$ factor. We introduce several new techniques to achieve our bounds, including a new compressed representation of the classic Aho-Corasick automaton and a new efficient string index that supports fast queries in run-length encoded strings.Open AccessCompressed Dictionary Matching on Run-Length Encoded Strings
Given a set of pattern strings $\mathcal{P}=\{P_1, P_2,\ldots P_k\}$ and a text string $S$, the classic dictionary matching problem is to report all occurrences of each pattern in $S$. We study the dictionary problem in the compressed setting, where the pattern strings and the text string are compressed using run-length encoding, and the goal is to solve the problem without decompression and achieve efficient time and space in the size of the compressed strings. Let $m$ and $n$ be the total length of the patterns $\mathcal{P}$ and the length of the text string $S$, respectively, and let $\overline{m}$ and $\overline{n}$ be the total number of runs in the run-length encoding of the patterns in $\mathcal{P}$ and $S$, respectively. Our main result is an algorithm that achieves $O( (\overline{m} + \overline{n})\log \log m + \mathrm{occ})$ expected time, and $O(\overline{m})$ space, where $\mathrm{occ}$ is the total number of occurrences of patterns in $S$. This is the first non-trivial solution to the problem. Since any solution must read the input, our time bound is optimal within an $\log \log m$ factor. We introduce several new techniques to achieve our bounds, including a new compressed representation of the classic Aho-Corasick automaton and a new efficient string index that supports fast queries in run-length encoded strings.