Imagen de Portada

String Indexing for Top-$k$ Close Consecutive Occurrences

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bille, Philip, Gørtz, Inge Li, Pedersen, Max Rishøj, Rotenberg, Eva, Steiner, Teresa Anna
Formato:	Preprint
Publicado:	2020
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

String Indexing with Compressed Patterns
por: Bille, Philip, et al.
Publicado: (2019)

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

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

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

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

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

Succinct Data Structures for Segments
por: Bille, Philip, et al.
Publicado: (2024)

Improved Extended Regular Expression Matching
por: Bille, Philip, et al.
Publicado: (2025)

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

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

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

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

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

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

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

Indexing Strings with Utilities
por: Bernardini, Giulia, et al.
Publicado: (2025)

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

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

Online String Attractors
por: Whittington, Philip
Publicado: (2024)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Generalized Top-k Mallows Model for Ranked Choices
por: Haddadan, Shahrzad, et al.
Publicado: (2025)

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