Approximate Counting

Approximate Counting is a probabilistic algorithmic technique in sublinear algorithms that belongs to the class of streaming algorithms, distinguished by its ability to estimate the number of distinct elements or events in a data stream using significantly less memory than exact counting, typically with bounded approximation error.

174

Publications

12.4K

Citations

330

Authors

161

Institutions

Publications per year

2017–2026

38

Authors

330

  1. MD
    Martin Dyer

    University of Leeds, United Kingdom

    11 publications · 685 citations

    11

    h-index

  2. MJ
    Mark Jerrum

    University of Edinburgh, United Kingdom

    7 publications · 1.2K citations

    7

    h-index

  3. EV
    Eric Vigoda

    Georgia Institute of Technology, United States

    6 publications · 262 citations

    6

    h-index

  4. HP
    Helmut Prodinger

    TU Wien, Austria

    5 publications · 89 citations

    5

    h-index

  5. PL
    Pinyan Lu

    Microsoft Research Asia (China), China

    5 publications · 131 citations

    5

    h-index

1–5 of 330

Venues

  1. SIAM Journal on Computing

    10 publications · 1.3K citations

    10

    h-index

  2. arXiv (Cornell University)

    Repository · 9 publications · 189 citations

    9

    h-index

  3. ACM Transactions on Algorithms

    TALG · 5 publications · 65 citations

    5

    h-index

  4. Proceedings of the AAAI Conference on Artificial Intelligence

    Conference · 5 publications · 153 citations

    5

    h-index

  5. Theoretical Computer Science

    4 publications · 229 citations

    4

    h-index

1–5