Inge Li Gørtz

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

String Indexing with Compressed Patterns.

[BibT_eX]

[DOI]

Teresa Anna Steiner

ACM Trans. Algorithms, October, 2023

Random Access in Persistent Strings and Segment Selection.

[BibT_eX]

[DOI]

Theory Comput. Syst., August, 2023

Gapped Indexing for Consecutive Occurrences.

[BibT_eX]

[DOI]

Algorithmica, April, 2023

Rank and Select on Degenerate Strings.

[BibT_eX]

[DOI]

Tord Stordalen

CoRR, 2023

Simple and Robust Dynamic Two-Dimensional Convex Hull.

[BibT_eX]

[DOI]

CoRR, 2023

Faster Compression of Deterministic Finite Automata.

[BibT_eX]

[DOI]

Max Rishøj Pedersen

CoRR, 2023

Hierarchical Relative Lempel-Ziv Compression.

[BibT_eX]

[DOI]

Proceedings of the 21st International Symposium on Experimental Algorithms, 2023

Sliding Window String Indexing in Streams.

[BibT_eX]

[DOI]

Tord Joakim Stordalen

Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

2022

Partial sums on the ultra-wide word RAM.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

String indexing for top-<i>k</i> close consecutive occurrences.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

From regular expression matching to parsing.

[BibT_eX]

[DOI]

Acta Informatica, 2022

Predecessor on the Ultra-Wide Word RAM.

[BibT_eX]

[DOI]

Tord Stordalen

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

The Complexity of the Co-occurrence Problem.

[BibT_eX]

[DOI]

Tord Stordalen

Proceedings of the String Processing and Information Retrieval, 2022

The Fine-Grained Complexity of Episode Matching.

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021

A Conditional Lower Bound for Episode Matching.

[BibT_eX]

[DOI]

CoRR, 2021

Top Tree Compression of Tries.

[BibT_eX]

[DOI]

Algorithmica, 2021

2020

Approximation algorithms for the a priori traveling repairman.

[BibT_eX]

[DOI]

Fatemeh Navidi

Oper. Res. Lett., 2020

Random Access in Persistent Strings.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Space Efficient Construction of Lyndon Arrays in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

String Indexing for Top-k Close Consecutive Occurrences.

[BibT_eX]

[DOI]

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

Decompressing Lempel-Ziv Compressed Text.

[BibT_eX]

[DOI]

Travis Gagie

Proceedings of the Data Compression Conference, 2020

2019

Theoretical Foundations of Storage Systems (Dagstuhl Seminar 19111).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2019

Approximation Algorithms for the A Priori TravelingRepairman.

[BibT_eX]

[DOI]

Fatemeh Navidi

CoRR, 2019

Mergeable Dictionaries With Shifts.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Time-space trade-offs for Lempel-Ziv compressed indexing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Finger Search in Grammar-Compressed Strings.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2018

A separation between RLSLPs and LZ77.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2018

Fast Lempel-Ziv Decompression in Linear Space.

[BibT_eX]

[DOI]

Travis Gagie

CoRR, 2018

Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation.

[BibT_eX]

[DOI]

Algorithmica, 2018

Compressed Communication Complexity of Longest Common Prefixes.

[BibT_eX]

[DOI]

Roberto Grossi

Eva Rotenberg

Proceedings of the String Processing and Information Retrieval, 2018

2017

Subsequence automata with default transitions.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2017

Fingerprints in compressed strings.

[BibT_eX]

[DOI]

Benjamin Sach

J. Comput. Syst. Sci., 2017

A Separation Between Run-Length SLPs and LZ77.

[BibT_eX]

[DOI]

CoRR, 2017

Practical and Effective Re-Pair Compression.

[BibT_eX]

[DOI]

CoRR, 2017

Compressed Subsequence Matching and Packed Tree Coloring.

[BibT_eX]

[DOI]

Algorithmica, 2017

Tight Bounds for Top Tree Compression.

[BibT_eX]

[DOI]

Finn Fernstrøm

Proceedings of the String Processing and Information Retrieval, 2017

Immersive Algorithms: Better Visualization with Less Information.

[BibT_eX]

[DOI]

Proceedings of the 2017 ACM Conference on Innovation and Technology in Computer Science Education, 2017

Fast Dynamic Arrays.

[BibT_eX]

[DOI]

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Space-Efficient Re-Pair Compression.

[BibT_eX]

[DOI]

Proceedings of the 2017 Data Compression Conference, 2017

Deterministic Indexing for Packed Strings.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

Lempel-Ziv Compression in a Sliding Window.

[BibT_eX]

[DOI]

Johannes Fischer

Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2016

Longest common extensions in trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Sparse Text Indexing in Small Space.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

Locating depots for capacitated vehicle routing.

[BibT_eX]

[DOI]

Networks, 2016

Capacitated Vehicle Routing with Nonuniform Speeds.

[BibT_eX]

[DOI]

Math. Oper. Res., 2016

Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

Distance Labeling Schemes for Trees.

[BibT_eX]

[DOI]

Stephen Alstrup

Esben Bistrup Halvorsen

Ely Porat

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Boxed Permutation Pattern Matching.

[BibT_eX]

[DOI]

Mika Amit

Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

2015

Minimum Makespan Multi-Vehicle Dial-a-Ride.

[BibT_eX]

[DOI]

R. Ravi

ACM Trans. Algorithms, 2015

Tree compression with top trees.

[BibT_eX]

[DOI]

Inf. Comput., 2015

Dynamic Relative Compression.

[BibT_eX]

[DOI]

CoRR, 2015

Finger Search, Random Access, and Longest Common Extensions in Grammar-Compressed Strings.

[BibT_eX]

[DOI]

CoRR, 2015

Compressed Data Structures for Range Searching.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2015

Longest Common Extensions in Sublinear Space.

[BibT_eX]

[DOI]

Mathias Bæk Tejs Knudsen

Moshe Lewenstein

Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

2014

Compact q-gram profiling of compressed strings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Union-Find with Constant Time Deletions.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2014

String Indexing for Patterns with Wildcards.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2014

Time-space trade-offs for longest common extensions.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2014

Longest Common Extensions in Trees.

[BibT_eX]

[DOI]

CoRR, 2014

Compact Subsequence Matching and Packed Tree Coloring.

[BibT_eX]

[DOI]

CoRR, 2014

Substring Range Reporting.

[BibT_eX]

[DOI]

Algorithmica, 2014

Indexing Motion Detection Data for Surveillance Video.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Multimedia, 2014

2013

Sparse Suffix Tree Construction in Small Space.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

String matching with variable length gaps.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Sparse Suffix Tree Construction with Small Space

[BibT_eX]

[DOI]

CoRR, 2012

Fast Arc-Annotated Subsequence Matching in Linear Space.

[BibT_eX]

[DOI]

Algorithmica, 2012

Longest Common Extensions via Fingerprinting.

[BibT_eX]

[DOI]

Jesper Kristensen

Proceedings of the Language and Automata Theory and Applications, 2012

Stochastic Vehicle Routing with Recourse.

[BibT_eX]

[DOI]

Rishi Saket

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011

The tree inclusion problem: In linear space and faster.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2011

Capacitated Vehicle Routing with Non-uniform Speeds.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatoral Optimization, 2011

2009

Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts.

[BibT_eX]

[DOI]

Rolf Fagerberg

ACM Trans. Algorithms, 2009

Matching subsequences in trees.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2009

2008

Asymmetric k-center with minimum coverage.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

2007

Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs.

[BibT_eX]

[DOI]

Jørgen Bang-Jensen

Daniel Gonçalves

Discret. Optim., 2007

2006

Asymmetry in <i>k</i>-center variants.

[BibT_eX]

[DOI]

Anthony Wirth

Theor. Comput. Sci., 2006

Hardness of Preemptive Finite Capacity Dial-a-Ride.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2006

2005

The Tree Inclusion Problem: In Optimal Space and Faster.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2003

Strong Normalization from Weak Normalization by Translation into the Lambda-I-Calculus.

[BibT_eX]

[DOI]

Signe Reuss

Morten Heine Sørensen

High. Order Symb. Comput., 2003

Asymmetry in k-Center Variants.

[BibT_eX]

[DOI]

Anthony Wirth

Proceedings of the Approximation, 2003

2002

Time and Space Efficient Multi-method Dispatching.

[BibT_eX]

[DOI]

Stephen Alstrup

Gerth Stølting Brodal