:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Belazzougui, Djamal, Kucherov, Gregory, Walzer, Stefan
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2404.09607
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Smallest suffixient set maintenance in near-real-time
by: Köppl, Dominik, et al.
Published: (2026)

Near-real-time Solutions for Online String Problems
by: Köppl, Dominik, et al.
Published: (2026)

Online computation of normalized substring complexity
by: Kucherov, Gregory, et al.
Published: (2025)

The Probability to Hit Every Bin with a Linear Number of Balls
by: Walzer, Stefan
Published: (2024)

Testing Depth First Search Numbering
by: Czumaj, Artur, et al.
Published: (2025)

ShockHash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force
by: Lehmann, Hans-Peter, et al.
Published: (2023)

A Tight ($3/2 + \varepsilon$)-Approximation Algorithm for Demand Strip Packing
by: Eberle, Franziska, et al.
Published: (2024)

Combined Search and Encoding for Seeds, with an Application to Minimal Perfect Hashing
by: Lehmann, Hans-Peter, et al.
Published: (2025)

Engineering Minimal k-Perfect Hash Functions
by: Hermann, Stefan, et al.
Published: (2025)

Tree algorithms for set reconciliation
by: Lázaro, Francisco, et al.
Published: (2025)

PHOBIC: Perfect Hashing with Optimized Bucket Sizes and Interleaved Coding
by: Hermann, Stefan, et al.
Published: (2024)

A Simple yet Exact Analysis of the MultiQueue
by: Walzer, Stefan, et al.
Published: (2024)

Learned Static Function Data Structures
by: Hermann, Stefan, et al.
Published: (2025)

Modern Minimal Perfect Hashing: A Survey
by: Lehmann, Hans-Peter, et al.
Published: (2025)

On the adversarial robustness of Locality-Sensitive Hashing in Hamming space
by: Kapralov, Michael, et al.
Published: (2024)

Improved space-time tradeoff for TSP via extremal set systems
by: Dallant, Justin, et al.
Published: (2026)

A faster polynomial-space algorithm for Hamiltonian cycle parameterized by treedepth
by: Kratsch, Stefan
Published: (2026)

Space-time Trade-offs for the LCP Array of Wheeler DFAs
by: Cotumaccio, Nicola, et al.
Published: (2023)

Speed-robust scheduling revisited
by: Minařík, Josef, et al.
Published: (2024)

Privacy-Computation trade-offs in Private Repetition and Metaselection
by: Talwar, Kunal
Published: (2024)

Self-referential instances of the dominating set problem are irreducible
by: Zhou, Guangyan
Published: (2026)

Better Indexing for Rectangular Pattern Matching
by: Gawrychowski, Paweł, et al.
Published: (2025)

A fast and slightly robust covariance estimator
by: Duchi, John, et al.
Published: (2025)

Probabilistic analysis of arithmetic coding showing its robustness
by: Mahmoud, Hosam M., et al.
Published: (2025)

An adversarially robust data-market for spatial, crowd-sourced data
by: Kharman, Aida Manzano, et al.
Published: (2022)

Testable algorithms for approximately counting edges and triangles in sublinear time and space
by: Eden, Talya, et al.
Published: (2025)

Linear-space LCS enumeration with quadratic-time delay for two strings
by: Sakai, Yoshifumi
Published: (2025)

Better Decremental and Fully Dynamic Sensitivity Oracles for Subgraph Connectivity
by: Long, Yaowei, et al.
Published: (2024)

QuaRs: A Transform for Better Lossless Compression of Integers
by: Matt, Jonas G.
Published: (2025)

Steiner Forest: A Simplified Better-Than-2 Approximation
by: Gupta, Anupam, et al.
Published: (2025)

A Space-space Trade-off for Directed st-Connectivity
by: Edenhofer, Roman
Published: (2026)

Enumerating all minimal hitting sets in polynomial total time
by: Wild, Marcel
Published: (2023)

Better Diameter Bounds for Efficient Shortcuts and a Structural Criterion for Constructiveness
by: Haeupler, Bernhard, et al.
Published: (2026)

A Better-Than-$5/4$-Approximation for Two-Edge Connectivity
by: Hommelsheim, Felix, et al.
Published: (2025)

A Better-Than-2 Approximation for the Directed Tree Augmentation Problem
by: Neuwohner, Meike, et al.
Published: (2025)

A Better-Than-1.6-Approximation for Prize-Collecting TSP
by: Blauth, Jannis, et al.
Published: (2023)

Local Max-Cut on Sparse Graphs
by: Schwartzman, Gregory
Published: (2023)

Recoverable robust shortest path problem under interval budgeted uncertainty representations
by: Jackiewicz, Marcel, et al.
Published: (2024)

Better approximation guarantee for Asymmetric TSP
by: Vygen, Jens
Published: (2026)

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