Image de couverture de livre

Compressibility Measures and Succinct Data Structures for Piecewise Linear Approximations

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Ferragina, Paolo, Lari, Filippo
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Succinct Data Structures for Segments
par: Bille, Philip, et autres
Publié: (2024)

Balanced Learned Sort: a new learned model for fast and balanced item bucketing
par: Ferragina, Paolo, et autres
Publié: (2024)

Succinct Data Structures for Baxter Permutation and Related Families
par: Chakraborty, Sankardeep, et autres
Publié: (2024)

Succinct Data Structure for Graphs with $d$-Dimensional $t$-Representation
par: Balakrishnan, Girish, et autres
Publié: (2023)

Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage
par: Balakrishnan, Girish, et autres
Publié: (2024)

Grafite: Taming Adversarial Queries with Optimal Range Filters
par: Costa, Marco, et autres
Publié: (2023)

Toward Greener Matrix Operations by Lossless Compressed Formats
par: Tosoni, Francesco, et autres
Publié: (2024)

Succinct Dynamic Rank/Select: Bypassing the Tree-Structure Bottleneck
par: Kuszmaul, William, et autres
Publié: (2025)

Succinct Planar Encoding with Minor Operations
par: Kammer, Frank, et autres
Publié: (2023)

Succinct Graph Representations and Algorithmic Applications
par: Ullah, Ahammed, et autres
Publié: (2026)

Cut Sparsification and Succinct Representation of Submodular Hypergraphs
par: Kenneth, Yotam, et autres
Publié: (2023)

SPIDER: Improved Succinct Rank and Select Performance
par: Laws, Matthew D., et autres
Publié: (2024)

Space-Efficient Graph Coarsening with Applications to Succinct Planar Encodings
par: Hammer, Nina, et autres
Publié: (2022)

Space-Efficient Depth-First Search via Augmented Succinct Graph Encodings
par: Elberfeld, Michael, et autres
Publié: (2025)

Succinct Encodings of Binary Trees with Application to AVL Trees
par: Chizewer, Jeremy, et autres
Publié: (2023)

Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space
par: Kempa, Dominik, et autres
Publié: (2023)

CARAMEL: A Succinct Read-Only Lookup Table via Compressed Static Functions
par: Coleman, Benjamin, et autres
Publié: (2023)

Succinct Preferential Attachment Graphs
par: Alaoui, Ziad Ismaili, et autres
Publié: (2025)

Parameterized Approximability for Modular Linear Equations
par: Dabrowski, Konrad K., et autres
Publié: (2025)

Approximating Partition in Near-Linear Time
par: Chen, Lin, et autres
Publié: (2024)

Faster Approximate Linear Matroid Intersection
par: Terao, Tatsuya
Publié: (2026)

Towards Efficient Data Structures for Approximate Search with Range Queries
par: Kian, Ladan, et autres
Publié: (2026)

Approximating Directed Connectivity in Almost-Linear Time
par: Quanrud, Kent
Publié: (2025)

Optimal FPT-Approximability for Modular Linear Equations
par: Dabrowski, Konrad K., et autres
Publié: (2026)

An Efficient Data Structure and Algorithm for Long-Match Query in Run-Length Compressed BWT
par: Sanaullah, Ahsan, et autres
Publié: (2025)

An Improved Quality Hierarchical Congestion Approximator in Near-Linear Time
par: Henzinger, Monika, et autres
Publié: (2025)

Approximating the Geometric Knapsack Problem in Near-Linear Time and Dynamically
par: Buchem, Moritz, et autres
Publié: (2024)

Rooting Out Entropy: Optimal Tree Extraction for Ultra-Succinct Graphs
par: Alaoui, Ziad Ismaili, et autres
Publié: (2026)

Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth
par: Agarwal, Arpit, et autres
Publié: (2024)

Near Linear Time Approximation Schemes for Clustering of Partially Doubling Metrics
par: Driemel, Anne, et autres
Publié: (2026)

A Linear Time Gap-ETH-Tight Approximation Scheme for Euclidean TSP
par: Mömke, Tobias, et autres
Publié: (2024)

Cardinality-Constrained Continuous Knapsack Problem with Concave Piecewise-Linear Utilities
par: Bai, Miao, et autres
Publié: (2023)

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth
par: Koh, Zhuan Khye, et autres
Publié: (2024)

A Nearly Linear Time Construction of Approximate Single-Source Distance Sensitivity Oracles
par: Harada, Kaito, et autres
Publié: (2024)

Data Structures for Approximate Discrete Fréchet Distance
par: van der Hoog, Ivor, et autres
Publié: (2022)

Deterministic $(2/3-\varepsilon)$-Approximation of Matroid Intersection Using Nearly-Linear Independence-Oracle Queries
par: Terao, Tatsuya
Publié: (2024)

Combining Crown Structures for Vulnerability Measures
par: Casel, Katrin, et autres
Publié: (2024)

AGIS: Fast Approximate Graph Pattern Mining with Structure-Informed Sampling
par: Lee, Seoyong, et autres
Publié: (2026)

Faster Approximation Algorithms for k-Center via Data Reduction
par: Filtser, Arnold, et autres
Publié: (2025)

Kd-tree Based Wasserstein Distance Approximation for High-Dimensional Data
par: Teshigawara, Kanata, et autres
Publié: (2026)