Inge Li Gørtz

682 total citations
42 papers, 158 citations indexed

About

Inge Li Gørtz is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Hardware and Architecture. According to data from OpenAlex, Inge Li Gørtz has authored 42 papers receiving a total of 158 indexed citations (citations by other indexed papers that have themselves been cited), including 32 papers in Artificial Intelligence, 14 papers in Computational Theory and Mathematics and 13 papers in Hardware and Architecture. Recurrent topics in Inge Li Gørtz's work include Algorithms and Data Compression (31 papers), Network Packet Processing and Optimization (12 papers) and Data Management and Algorithms (9 papers). Inge Li Gørtz is often cited by papers focused on Algorithms and Data Compression (31 papers), Network Packet Processing and Optimization (12 papers) and Data Management and Algorithms (9 papers). Inge Li Gørtz collaborates with scholars based in Denmark, Israel and United States. Inge Li Gørtz's co-authors include Philip Bille, Benjamin Sach, Viswanath Nagarajan, Gad M. Landau, Nicola Prezza, Rolf Fagerberg, Oren Weimann, Anthony Wirth, Stephen Alstrup and R. Ravi and has published in prestigious journals such as Theoretical Computer Science, Journal of Computer and System Sciences and Mathematics of Operations Research.

In The Last Decade

Inge Li Gørtz

37 papers receiving 151 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Inge Li Gørtz Denmark 7 120 62 47 42 16 42 158
Benjamin Sach United Kingdom 7 89 0.7× 52 0.8× 37 0.8× 16 0.4× 34 2.1× 13 168
Tomasz Kociumaka Poland 9 155 1.3× 113 1.8× 77 1.6× 31 0.7× 42 2.6× 54 224
Edson N. Cáceres Brazil 7 83 0.7× 32 0.5× 31 0.7× 29 0.7× 52 3.3× 32 135
Jeong Seop Sim South Korea 7 129 1.1× 41 0.7× 72 1.5× 51 1.2× 20 1.3× 28 190
Radu Nicolescu New Zealand 8 47 0.4× 50 0.8× 92 2.0× 10 0.2× 28 1.8× 34 174
Ola Petersson Sweden 8 110 0.9× 48 0.8× 29 0.6× 24 0.6× 52 3.3× 20 157
Simone Tini Italy 10 162 1.4× 193 3.1× 68 1.4× 16 0.4× 45 2.8× 54 275
Simone Faro Italy 9 243 2.0× 58 0.9× 107 2.3× 149 3.5× 19 1.2× 46 270
Madhavan Mukund India 10 88 0.7× 166 2.7× 31 0.7× 18 0.4× 35 2.2× 28 223
Stefan Naujokat Germany 7 62 0.5× 32 0.5× 23 0.5× 10 0.2× 26 1.6× 20 141

Countries citing papers authored by Inge Li Gørtz

Since Specialization
Citations

This map shows the geographic impact of Inge Li Gørtz's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Inge Li Gørtz with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Inge Li Gørtz more than expected).

Fields of papers citing papers by Inge Li Gørtz

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Inge Li Gørtz. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Inge Li Gørtz. The network helps show where Inge Li Gørtz may publish in the future.

Co-authorship network of co-authors of Inge Li Gørtz

This figure shows the co-authorship network connecting the top 25 collaborators of Inge Li Gørtz. A scholar is included among the top collaborators of Inge Li Gørtz based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Inge Li Gørtz. Inge Li Gørtz is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Bille, Philip, et al.. (2024). Predecessor on the Ultra-Wide Word RAM. Algorithmica. 86(5). 1578–1599.
2.
Bille, Philip, et al.. (2024). Rank and Select on Degenerate Strings. 283–292. 1 indexed citations
3.
Bille, Philip, et al.. (2022). Predecessor on the Ultra-Wide Word RAM. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
4.
Bille, Philip, et al.. (2020). String Indexing with Compressed Patterns. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
5.
Bille, Philip, et al.. (2020). String Indexing for Top-k Close Consecutive Occurrences. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 17. 1 indexed citations
6.
Navidi, Fatemeh, Inge Li Gørtz, & Viswanath Nagarajan. (2020). Approximation algorithms for the a priori traveling repairman. Operations Research Letters. 48(5). 599–606. 4 indexed citations
7.
Bille, Philip & Inge Li Gørtz. (2020). Random Access in Persistent Strings and Segment Selection. arXiv (Cornell University). 1 indexed citations
8.
Bille, Philip, Travis Gagie, Inge Li Gørtz, & Nicola Prezza. (2018). A separation between RLSLPs and LZ77. Journal of Discrete Algorithms. 50. 36–39. 5 indexed citations
9.
Bille, Philip, Inge Li Gørtz, & Nicola Prezza. (2017). Space-Efficient Re-Pair Compression. IRIS - Institutional Research Information System (Libera Università Internazionale degli Studi Sociali Guido Carli). 6 indexed citations
10.
Bille, Philip, et al.. (2017). Time–space trade-offs for Lempel–Ziv compressed indexing. Theoretical Computer Science. 713. 66–77. 12 indexed citations
11.
Alstrup, Stephen, et al.. (2016). Distance labeling schemes for trees. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 16. 1 indexed citations
12.
Bille, Philip, et al.. (2016). Sparse Text Indexing in Small Space. ACM Transactions on Algorithms. 12(3). 1–19. 6 indexed citations
13.
Gørtz, Inge Li & Viswanath Nagarajan. (2016). Locating depots for capacitated vehicle routing. Networks. 68(2). 94–103. 4 indexed citations
14.
Bille, Philip, et al.. (2015). Dynamic Relative Compression.. arXiv (Cornell University). 2 indexed citations
15.
Bille, Philip, Paweł Gawrychowski, Inge Li Gørtz, Gad M. Landau, & Oren Weimann. (2015). Longest common extensions in trees. Theoretical Computer Science. 638. 98–107. 3 indexed citations
16.
Bille, Philip, et al.. (2014). Compact q-gram profiling of compressed strings. Theoretical Computer Science. 550. 51–58.
17.
Bille, Philip, et al.. (2012). String matching with variable length gaps. Theoretical Computer Science. 443. 25–34. 20 indexed citations
18.
Bille, Philip & Inge Li Gørtz. (2011). The tree inclusion problem. ACM Transactions on Algorithms. 7(3). 1–47. 11 indexed citations
19.
Bille, Philip & Inge Li Gørtz. (2009). Matching subsequences in trees. Journal of Discrete Algorithms. 7(3). 306–314. 1 indexed citations
20.
Gørtz, Inge Li, et al.. (2003). Strong Normalization from Weak Normalization by Translation into the Lambda-I-Calculus. LISP and Symbolic Computation. 16(3). 253–285. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026