Cover Image

Huffman-Bucket Sketch: A Simple $O(m)$ Algorithm for Cardinality Estimation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Karppa, Matti
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms 68W20, 94A45, 68P05, 68P30 G.3; E.4
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Classification via Two-Way Comparisons
by: Chrobak, Marek, et al.
Published: (2023)

Stochastic Indexing Primitives for Non-Deterministic Molecular Archives
by: Alpay, Faruk, et al.
Published: (2026)

Naively Sorting Evolving Data is Optimal and Robust
by: Giakkoupis, George, et al.
Published: (2024)

The Li-Chao Tree: Algorithm Specification and Analysis
by: Li, Chao
Published: (2026)

Residual-Entropy Accounting for Routed Atom-Budgeted Learned Indexes
by: Alpay, Faruk, et al.
Published: (2026)

Memento Filter: A Fast, Dynamic, and Robust Range Filter
by: Eslami, Navid, et al.
Published: (2024)

Distributed Hybrid Sketching for $\ell_2$-Embeddings
by: Charalambides, Neophytos, et al.
Published: (2024)

Optimizing Exact String Matching via Statistical Anchoring
by: Garraoui, Omar
Published: (2025)

CAFS: A Cache-Aware Frequency Sort for Low-Cardinality Integer Data on x86-64
by: Shlyk, Vasiliy S.
Published: (2026)

The Merkle Mountain Belt
by: Cevallos, Alfonso, et al.
Published: (2025)

Competitive Data-Structure Dynamization
by: Mathieu, Claire, et al.
Published: (2020)

An Allele-Centric Pan-Graph-Matrix Representation for Scalable Pangenome Analysis
by: Garrone, Roberto
Published: (2025)

Strongly Sublinear Algorithms for Testing Pattern Freeness
by: Newman, Ilan, et al.
Published: (2021)

Let them have CAKES: A Cutting-Edge Algorithm for Scalable, Efficient, and Exact Search on Big Data
by: Prior, Morgan E., et al.
Published: (2023)

Iterative Sketching for Secure Coded Regression
by: Charalambides, Neophytos, et al.
Published: (2023)

Hodge Laplacians and Hodge Diffusion Maps
by: Gomez, Alvaro Almeida, et al.
Published: (2025)

Shortest Paths without a Map, but with an Entropic Regularizer
by: Bubeck, Sébastien, et al.
Published: (2022)

Incremental-Decremental Maximization
by: Disser, Yann, et al.
Published: (2025)

Improved Randomized Approximation of Hard Universality and Emptiness Problems
by: Andreou, Pantelis, et al.
Published: (2024)

Random-Order Online Independent Set of Intervals and Hyperrectangles
by: Garg, Mohit, et al.
Published: (2024)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
by: Chen, Zongchen, et al.
Published: (2022)

An asymptotically optimal algorithm for generating bin cardinalities
by: Devroye, Luc, et al.
Published: (2024)

On Unique Error Patterns in the Levenshtein's Sequence Reconstruction Model
by: Junnila, Ville, et al.
Published: (2024)

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
by: Friggstad, Zachary, et al.
Published: (2018)

How to Compute a Moving Sum
by: Maslen, David K., et al.
Published: (2025)

Latent Objective Induction and Diversity-Constrained Selection: Algorithms for Multi-Locale Retrieval Pipelines
by: Alpay, Faruk, et al.
Published: (2026)

Gradient Coding with Iterative Block Leverage Score Sampling
by: Charalambides, Neophytos, et al.
Published: (2023)

XiSort: Deterministic Sorting via IEEE-754 Total Ordering and Entropy Minimization
by: Alpay, Faruk
Published: (2025)

Levenshtein's Sequence Reconstruction Problem and Results for Larger Alphabet Sizes
by: Junnila, Ville, et al.
Published: (2025)

Cardinality-Constrained Continuous Knapsack Problem with Concave Piecewise-Linear Utilities
by: Bai, Miao, et al.
Published: (2023)

On nonlinear compression costs: when Shannon meets Rényi
by: Somazzi, Andrea, et al.
Published: (2023)

The Distributional Tail of Worst-Case Quickselect
by: Płecha, Witold
Published: (2026)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
by: DasGupta, Bhaskar, et al.
Published: (2026)

Building a Nest by an Automaton
by: Czyzowicz, Jurek, et al.
Published: (2019)

Fast Dimensionality Reduction from $\ell_2$ to $\ell_p$
by: Chiclana, Rafael, et al.
Published: (2025)

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors
by: Coşa, Matei Gabriel, et al.
Published: (2025)

A Comparative Study of Recommender Systems under Big Data Constraints
by: Scrivano, Arimondo
Published: (2025)

Success probability in Shor's Algorithm
by: Abbassi, Ali, et al.
Published: (2025)

A Knowledge Compilation Map for Quantum Information
by: Vinkhuijzen, Lieuwe, et al.
Published: (2024)

The Power of Filling in Balanced Allocations
by: Los, Dimitrios, et al.
Published: (2022)