Cover Image

Multi-dimensional Approximate Counting

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Wang, Dingyu
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Optimal Protocols for 2-Party Contention Resolution
by: Wang, Dingyu
Published: (2024)

Fast Approximate Counting of Cycles
by: Censor-Hillel, Keren, et al.
Published: (2024)

A Unified Construction of Streaming Sketches via the Lévy-Khintchine Representation Theorem
by: Pettie, Seth, et al.
Published: (2024)

Universal Perfect Samplers for Incremental Streams
by: Pettie, Seth, et al.
Published: (2024)

Approximate Counting for Spin Systems in Sub-Quadratic Time
by: Anand, Konrad, et al.
Published: (2023)

Approximately Counting Knapsack Solutions in Subquadratic Time
by: Feng, Weiming, et al.
Published: (2024)

Approximate Butterfly Counting in Sublinear Time
by: Luo, Chi, et al.
Published: (2026)

Approximately Counting and Sampling Hamiltonian Motifs in Sublinear Time
by: Eden, Talya, et al.
Published: (2025)

Differentially Private High-Dimensional Approximate Range Counting, Revisited
by: Aumüller, Martin, et al.
Published: (2024)

Approximate Spanning Tree Counting from Uncorrelated Edge Sets
by: Liu, Yang P., et al.
Published: (2025)

Information Theoretic Limits of Cardinality Estimation: Fisher Meets Shannon
by: Pettie, Seth, et al.
Published: (2020)

Fair-Count-Min: Frequency Estimation under Equal Group-wise Approximation Factor
by: Shahbazi, Nima, et al.
Published: (2025)

Near-Optimal Parallel Approximate Counting via Sampling
by: Harris, David G., et al.
Published: (2026)

Tight Streaming Lower Bounds for Deterministic Approximate Counting
by: Wang, Yichuan
Published: (2024)

Harmonic Decomposition in Data Sketches
by: Wang, Dingyu
Published: (2024)

Scalable Algorithms for Approximate DNF Model Counting
by: Burkhardt, Paul, et al.
Published: (2026)

Counting Cohesive Subgraphs with Hereditary Properties
by: Li, Rong-Hua, et al.
Published: (2024)

ExaLogLog: Space-Efficient and Practical Approximate Distinct Counting up to the Exa-Scale
by: Ertl, Otmar
Published: (2024)

Tight Space Lower Bound for Pseudo-Deterministic Approximate Counting
by: Grossman, Ofer, et al.
Published: (2023)

Parallel $(1+ε)$-Approximate Multi-Commodity Mincost Flow in Almost Optimal Depth and Work
by: Haeupler, Bernhard, et al.
Published: (2025)

Inapproximability of Counting Permutation Patterns
by: Opler, Michal
Published: (2026)

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges
by: Meng, Lingkai, et al.
Published: (2024)

Counting on General Run-Length Grammars
by: Navarro, Gonzalo, et al.
Published: (2024)

Counting distinct (non-)crossing substrings
by: Umezaki, Haruki, et al.
Published: (2025)

Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs
by: Cai, Xinwei, et al.
Published: (2023)

UltraLogLog: A Practical and More Space-Efficient Alternative to HyperLogLog for Approximate Distinct Counting
by: Ertl, Otmar
Published: (2023)

Congestion-Approximators from the Bottom Up
by: Li, Jason, et al.
Published: (2024)

Cover Edge-Based Novel Triangle Counting
by: Bader, David A., et al.
Published: (2024)

Counting Patterns in Degenerate Graphs in Constant Space
by: Komarath, Balagopal, et al.
Published: (2025)

Counting perfect matchings and Hamiltonian cycles faster
by: Li, Baitian
Published: (2023)

Counting Distinct Square Substrings in Sublinear Time
by: Charalampopoulos, Panagiotis, et al.
Published: (2025)

Fast Biclique Counting on Bipartite Graphs: A Node Pivot-based Approach
by: Ye, Xiaowei, et al.
Published: (2024)

FlexFlood: Efficiently Updatable Learned Multi-dimensional Index
by: Hidaka, Fuma, et al.
Published: (2024)

Counting and Sampling Labeled Chordal Graphs in Polynomial Time
by: Hebert-Johnson, Ursula, et al.
Published: (2023)

Near-Optimal Four-Cycle Counting in Graph Streams
by: Lüderssen, Sebastian, et al.
Published: (2026)

Enhanced Approximation Algorithms for the Capacitated Location Routing Problem
by: Zhao, Jingyang, et al.
Published: (2025)

Approximate Counting in Local Lemma Regimes
by: Mann, Ryan L., et al.
Published: (2025)

Optimal Approximate Matrix Multiplication over Sliding Window
by: Xian, Haoming, et al.
Published: (2025)

Approximating $δ$-Covering
by: Hartmann, Tim A., et al.
Published: (2024)

On Approximating Cutwidth and Pathwidth
by: Bansal, Nikhil, et al.
Published: (2023)