Image de couverture de livre

DynamicLogLog: Faster, Smaller, and More Accurate Cardinality Estimation

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Bushnell, Brian
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms E.1; E.2; F.2.1
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

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

Optimal Preprocessing for Answering On-Line Product Queries
par: Alon, Noga, et autres
Publié: (2024)

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

An 8- and 12-bit block AES cipher
par: Breuer, Peter T.
Publié: (2025)

New Entropy Measures for Tries with Applications to the XBWT
par: Carfagna, Lorenzo, et autres
Publié: (2025)

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

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

FlipHash: A Constant-Time Consistent Range-Hashing Algorithm
par: Masson, Charles, et autres
Publié: (2024)

A Space Lower Bound for Approximate Membership with Duplicate Insertions or Deletions of Nonelements
par: Agarwala, Aryan, et autres
Publié: (2024)

Dynamic Indexing Through Learned Indices with Worst-case Guarantees
par: Gæde, Emil Toftegaard, et autres
Publié: (2025)

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

Engineering Compressed Matrix Multiplication with the Fast Walsh-Hadamard Transform
par: Andersson, Joel, et autres
Publié: (2026)

Selective algorithm processing of subset sum distributions
par: Dawes, Nick
Publié: (2024)

An O(nlogn) approximate knapsack algorithm
par: Dawes, Nick
Publié: (2025)

Beating Meet-in-the-Middle for Subset Balancing Problems
par: Randolph, Tim, et autres
Publié: (2025)

Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM
par: Randolph, Tim, et autres
Publié: (2024)

Classic Round-Up Variant of Fast Unsigned Division by Constants: Algorithm and Full Proof
par: Li, Yifei
Publié: (2024)

On generating $k$-factorable graphic sequences with connected (resp.no connected) $k$-factors
par: Mukhopadhyay, Asish, et autres
Publié: (2024)

Approximating Graphic Multi-Path TSP and Graphic Ordered TSP
par: Alimi, Morteza, et autres
Publié: (2025)

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

An Efficient Algorithm for Unbalanced 1D Transportation
par: Gouvine, Gabriel
Publié: (2023)

Splittable Spanning Trees and Balanced Forests in Dense Random Graphs
par: Gillman, David, et autres
Publié: (2025)

The Constrained Layer Tree Problem and Applications to Solar Farm Cabling
par: Bläsius, Thomas, et autres
Publié: (2024)

static_maps: consteval std::map and std::unordered_map Implementations in C++23
par: Myhal, Isaac D., et autres
Publié: (2026)

Min-CSPs on Complete Instances
par: Anand, Aditya, et autres
Publié: (2024)

Predicting Memory Demands of BDD Operations using Maximum Graph Cuts (Extended Paper)
par: Sølvsten, Steffan Christ, et autres
Publié: (2023)

Better Algorithms for Constructing Minimum Cost Markov Chains and AIFV Codes
par: Dolatabadi, Reza Hosseini, et autres
Publié: (2024)

An Efficient Algorithm for Permutation Iteration Using a Singly Linked List
par: Baruchel, Thomas
Publié: (2025)

Zip-zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent
par: Gila, Ofek, et autres
Publié: (2023)

Even Faster Kernel Matrix Linear Algebra via Density Estimation
par: Shah, Rikhav, et autres
Publié: (2025)

A (Weakly) Polynomial Algorithm for AIVF Coding
par: Dolatabadi, Reza Hosseini, et autres
Publié: (2024)

Faster Linear-Space Data Structures for Path Frequency Queries
par: Rata, Ovidiu
Publié: (2026)

Sublime: Sublinear Error & Space for Unbounded Skewed Streams
par: Eslami, Navid, et autres
Publié: (2026)

A Computational Proof of the Highest-Scoring Boggle Board
par: Vanderkam, Dan
Publié: (2025)

A Knowledge Compilation Map for Quantum Information
par: Vinkhuijzen, Lieuwe, et autres
Publié: (2024)

Unsplittable Multicommodity Flows in Outerplanar Graphs
par: Alemán-Espinosa, David, et autres
Publié: (2025)

A Heuristic for Direct Product Graph Decomposition
par: Calderoni, Luca, et autres
Publié: (2021)

When Votes Change and Committees Should (Not)
par: Bredereck, Robert, et autres
Publié: (2020)

Faster Algorithms for Structured Matrix Multiplication via Flip Graph Search
par: Khoruzhii, Kirill, et autres
Publié: (2025)