Cover Image

New Entropy Measures for Tries with Applications to the XBWT

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Carfagna, Lorenzo, Tosoni, Carlo
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms E.1; E.4; F.2.0
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Indexing Tries within Entropy-Bounded Space
by: Carfagna, Lorenzo, et al.
Published: (2025)

A (Weakly) Polynomial Algorithm for AIVF Coding
by: Dolatabadi, Reza Hosseini, et al.
Published: (2024)

DynamicLogLog: Faster, Smaller, and More Accurate Cardinality Estimation
by: Bushnell, Brian
Published: (2026)

Better Algorithms for Constructing Minimum Cost Markov Chains and AIFV Codes
by: Dolatabadi, Reza Hosseini, et al.
Published: (2024)

Clustering Permutations: New Techniques with Streaming Applications
by: Chakraborty, Diptarka, et al.
Published: (2022)

On generating $k$-factorable graphic sequences with connected (resp.no connected) $k$-factors
by: Mukhopadhyay, Asish, et al.
Published: (2024)

On the structure of normalized models of circular-arc graphs -- Hsu's approach revisited
by: Krawczyk, Tomasz
Published: (2024)

On the I/O Complexity of the CYK Algorithm and of a Family of Related DP Algorithms
by: De Stefani, Lorenzo, et al.
Published: (2024)

Optimal Preprocessing for Answering On-Line Product Queries
by: Alon, Noga, et al.
Published: (2024)

Engineering Practical Succinct Bit Vectors: A Space-Time Pareto Analysis on Apple Silicon ARM64 Cores
by: Garg, Ishant
Published: (2026)

Bottom-up Rebalancing Binary Search Trees by Flipping a Coin
by: Brodal, Gerth Stølting
Published: (2024)

Online Paging with Heterogeneous Cache Slots
by: Chrobak, Marek, et al.
Published: (2022)

Comments on "$\mathcal{O}(m\cdot n)$ algorithms for the recognition and isomorphism problems on circular-arc graphs"
by: Krawczyk, Tomasz
Published: (2024)

Deterministic Longest Common Subsequence Approximation in Near-Linear Time
by: Boneh, Itai, et al.
Published: (2025)

Planar Multiway Cut with Terminals on Few Faces
by: Pandey, Sukanya, et al.
Published: (2025)

Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View
by: Hušek, Radek, et al.
Published: (2020)

Calculation of the Comparative Efficiency of Algorithms Using a Single Metric
by: Chakraborty, Arya
Published: (2024)

Arcee: An OCM-Solver
by: Boehmer, Kimon, et al.
Published: (2024)

The Pareto Frontier of Randomized Learning-Augmented Online Bidding
by: Degryse, Mathis, et al.
Published: (2026)

FlipHash: A Constant-Time Consistent Range-Hashing Algorithm
by: Masson, Charles, et al.
Published: (2024)

A Space Lower Bound for Approximate Membership with Duplicate Insertions or Deletions of Nonelements
by: Agarwala, Aryan, et al.
Published: (2024)

An $n^{O(\log\log n)}$ time approximation scheme for capacitated VRP in the Euclidean plane
by: Sitters, René
Published: (2025)

Rateless Bloom Filters: Set Reconciliation for Divergent Replicas with Variable-Sized Elements
by: Gomes, Pedro Silva, et al.
Published: (2025)

The Chonkers Algorithm: Content-Defined Chunking with Provable Strict Guarantees on Size and Locality
by: Berger, Benjamin
Published: (2025)

Weakly acyclic diagrams: A data structure for infinite-state symbolic verification
by: Blondin, Michael, et al.
Published: (2024)

Dynamic Indexing Through Learned Indices with Worst-case Guarantees
by: Gæde, Emil Toftegaard, et al.
Published: (2025)

Provably Small Portfolios for Multiobjective Optimization with Application to Subsidized Facility Location
by: Gupta, Swati, et al.
Published: (2025)

Maximum Partial List H-Coloring on P_5-free graphs in polynomial time
by: Lokshtanov, Daniel, et al.
Published: (2024)

LatticeHashForest: An Efficient Data Structure for Repetitive Data and Operations
by: Ghorui, Anamitra, et al.
Published: (2025)

An Efficient Algorithm for Unbalanced 1D Transportation
by: Gouvine, Gabriel
Published: (2023)

Generalized compression and compressive search of large datasets
by: Prior, Morgan E., et al.
Published: (2024)

The World's Fastest Matching Engine Algorithm
by: Yoon, Jake
Published: (2026)

Finding the Center and Centroid of a Graph with Multiple Sources
by: Chou, Matthew
Published: (2024)

static_maps: consteval std::map and std::unordered_map Implementations in C++23
by: Myhal, Isaac D., et al.
Published: (2026)

On the formalization of the notion of an algorithm
by: Middelburg, C. A.
Published: (2024)

MorphisHash: Improving Space Efficiency of ShockHash for Minimal Perfect Hashing
by: Hermann, Stefan
Published: (2025)

Fast Geographic Routing in Fixed-Growth Graphs
by: Gila, Ofek, et al.
Published: (2025)

Highway Preferential Attachment Models for Geographic Routing
by: Gila, Ofek, et al.
Published: (2024)

Zip-zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent
by: Gila, Ofek, et al.
Published: (2023)

Cache-Oblivious Representation of B-Tree Structures
by: Ondráček, Lukáš, et al.
Published: (2022)