:: Library Catalog

Saved in:

Bibliographic Details
Main Authors:	Bille, Philip, Gørtz, Inge Li, Pedersen, Max Rishøj, Rotenberg, Eva, Steiner, Teresa Anna
Format:	Preprint
Published:	2020
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2007.04128
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

String Indexing with Compressed Patterns
by: Bille, Philip, et al.
Published: (2019)

Fast Practical Compression of Deterministic Finite Automata
by: Bille, Philip, et al.
Published: (2023)

Gapped String Indexing in Subquadratic Space and Sublinear Query Time
by: Bille, Philip, et al.
Published: (2022)

Differentially Private Substring and Document Counting with Near-Optimal Error
by: Bernardini, Giulia, et al.
Published: (2024)

The Fine-Grained Complexity of Episode Matching
by: Bille, Philip, et al.
Published: (2021)

Compressed Dictionary Matching on Run-Length Encoded Strings
by: Bille, Philip, et al.
Published: (2025)

Succinct Data Structures for Segments
by: Bille, Philip, et al.
Published: (2024)

Improved Extended Regular Expression Matching
by: Bille, Philip, et al.
Published: (2025)

Dynamic Range Minimum Queries on the Ultra-Wide Word RAM
by: Bille, Philip, et al.
Published: (2024)

Private graph colouring with limited defectiveness
by: Christiansen, Aleksander B. G., et al.
Published: (2024)

Fast and Compact Graph Cuts for the Boykov-Kolmogorov Algorithm
by: Mikkelstrup, Christian Møller, et al.
Published: (2026)

How many users have been here for a long time? Efficient solutions for counting long aggregated visits
by: Afshani, Peyman, et al.
Published: (2026)

Size-constrained Weighted Ancestors with Applications
by: Bille, Philip, et al.
Published: (2023)

Data Structures for Range Sorted Consecutive Occurrence Queries
by: Akram, Waseem, et al.
Published: (2024)

Indexing Strings with Utilities
by: Bernardini, Giulia, et al.
Published: (2025)

Space-Efficient Online Computation of String Net Occurrences
by: Mieno, Takuya, et al.
Published: (2024)

Simpler Optimal Sorting from a Directed Acyclic Graph
by: van der Hoog, Ivor, et al.
Published: (2024)

Tight Better-Than-Worst-Case Bounds for Element Distinctness and Set Intersection
by: van der Hoog, Ivor, et al.
Published: (2025)

Sparsity-Parameterised Dynamic Edge Colouring
by: Christiansen, Aleksander B. G., et al.
Published: (2023)

Fully dynamic biconnectivity in $\tilde{\mathcal{O}}(\log^2 n)$ time
by: Holm, Jacob, et al.
Published: (2025)

Simpler Universally Optimal Dijkstra
by: van der Hoog, Ivor, et al.
Published: (2025)

Fully Dynamic Graph Algorithms with Edge Differential Privacy
by: Raskhodnikova, Sofya, et al.
Published: (2024)

Effective Index Construction Algorithm for Optimal $(k,η)$-cores Computation
by: Sun, Shengli, et al.
Published: (2025)

An Optimal Algorithm for Stochastic Vertex Cover
by: Brand, Jan van den, et al.
Published: (2026)

Faster ED-String Matching with $k$ Mismatches
by: Gawrychowski, Paweł, et al.
Published: (2025)

Online String Attractors
by: Whittington, Philip
Published: (2024)

The CDAWG Index and Pattern Matching on Grammar-Compressed Strings
by: Cleary, Alan M., et al.
Published: (2024)

Space-Efficient Indexes for Uncertain Strings
by: Gabory, Esteban, et al.
Published: (2024)

Near-Optimal Heaps and Dijkstra on Pointer Machines
by: van der Hoog, Ivor, et al.
Published: (2026)

Fairness in Aggregation: Optimal Top-$k$ and Improved Full Ranking
by: Chakraborty, Diptarka, et al.
Published: (2026)

Differentially Private Continual Release of Histograms and Related Queries
by: Henzinger, Monika, et al.
Published: (2023)

Private Counting of Distinct Elements in the Turnstile Model and Extensions
by: Henzinger, Monika, et al.
Published: (2024)

Top-k Stabbing Interval Queries
by: Akram, Waseem, et al.
Published: (2024)

Tight Universal Bounds for Partially Presorted Pareto Front and Convex Hull
by: van der Hoog, Ivor, et al.
Published: (2025)

On computing the (exact) Fréchet distance with a frog
by: Conradi, Jacobus, et al.
Published: (2025)

Engineering Fully Dynamic Convex Hulls
by: van der Hoog, Ivor, et al.
Published: (2026)

Data Structures for Approximate Discrete Fréchet Distance
by: van der Hoog, Ivor, et al.
Published: (2022)

Space-Efficient k-Mismatch Text Indexes
by: Kociumaka, Tomasz, et al.
Published: (2025)

Dimension-Accuracy Tradeoffs in Contrastive Embeddings for Triplets, Terminals & Top-k Nearest Neighbors
by: Chatziafratis, Vaggos, et al.
Published: (2023)

From Theory to Practice: Engineering Approximation Algorithms for Dynamic Orientation
by: Großmann, Ernestine, et al.
Published: (2025)