default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Inge Li Gørtz
Technical University of Denmark
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 153 matches
- 2024
- Philip Bille, Inge Li Gørtz, Tord Stordalen:
Predecessor on the Ultra-Wide Word RAM. Algorithmica 86(5): 1578-1599 (2024) - 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 - 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 - Philip Bille, Christian Mikkelsen Fuglsang, Inge Li Gørtz:
Tight Bounds for Compressing Substring Samples. CPM 2024: 9:1-9:14 - Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Simon R. Tarnow:
Faster Sliding Window String Indexing in Streams. CPM 2024: 8:1-8:14 - Philip Bille, Inge Li Gørtz, Tord Stordalen:
Rank and Select on Degenerate Strings. DCC 2024: 283-292 - 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 - Philip Bille, Inge Li Gørtz:
Sparse Regular Expression Matching. SODA 2024: 3354-3375 - 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
- Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Teresa Anna Steiner:
Gapped Indexing for Consecutive Occurrences. Algorithmica 85(4): 879-901 (2023) - Philip Bille, Inge Li Gørtz:
Random Access in Persistent Strings and Segment Selection. Theory Comput. Syst. 67(4): 694-713 (2023) - Philip Bille, Inge Li Gørtz, Teresa Anna Steiner:
String Indexing with Compressed Patterns. ACM Trans. Algorithms 19(4): 32:1-32:19 (2023) - 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 - Philip Bille, Inge Li Gørtz, Simon J. Puglisi, Simon R. Tarnow:
Hierarchical Relative Lempel-Ziv Compression. SEA 2023: 18:1-18:16 - 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] - 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) - Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen:
Faster Compression of Deterministic Finite Automata. CoRR abs/2306.12771 (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 abs/2310.18068 (2023) - Philip Bille, Inge Li Gørtz, Tord Stordalen:
Rank and Select on Degenerate Strings. CoRR abs/2310.19702 (2023) - 2022
- Philip Bille, Inge Li Gørtz:
From regular expression matching to parsing. Acta Informatica 59(6): 709-724 (2022) - 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) - Philip Bille, Inge Li Gørtz, Frederik Rye Skjoldjensen:
Partial sums on the ultra-wide word RAM. Theor. Comput. Sci. 905: 99-105 (2022) - 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 - Philip Bille, Inge Li Gørtz, Tord Stordalen:
The Complexity of the Co-occurrence Problem. SPIRE 2022: 38-52 - Philip Bille, Inge Li Gørtz, Tord Stordalen:
Predecessor on the Ultra-Wide Word RAM. SWAT 2022: 18:1-18:15 - Philip Bille, Inge Li Gørtz, Tord Stordalen:
Predecessor on the Ultra-Wide Word RAM. CoRR abs/2201.11550 (2022) - Philip Bille, Inge Li Gørtz, Tord Stordalen:
The Complexity of the Co-Occurrence Problem. CoRR abs/2206.10383 (2022) - Philip Bille, Inge Li Gørtz, Simon J. Puglisi, Simon R. Tarnow:
Hierarchical Relative Lempel-Ziv Compression. CoRR abs/2208.11371 (2022) - 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
- Philip Bille, Pawel Gawrychowski, Inge Li Gørtz, Gad M. Landau, Oren Weimann:
Top Tree Compression of Tries. Algorithmica 83(12): 3602-3628 (2021)
skipping 123 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-12-09 08:54 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint