Randomized Counting Algorithms
Randomized Counting Algorithms is a class of probabilistic algorithms designed to estimate the size of a solution space or the number of objects satisfying certain constraints by employing random sampling and statistical inference, distinguishing it from deterministic counting methods through its use of randomness to achieve efficiency and scalability in intractable counting problems.
79
Publications
3K
Citations
154
Authors
89
Institutions
Publications per year
2017–2026
8
Parents
79
Approximate counts and quantiles over sliding windows
Arvind Arasu, Gurmeet Singh Manku · 2004 · 346 citations
On Counting Independent Sets in Sparse Graphs
Martin Dyer, Alan Frieze, Mark Jerrum · SIAM Journal on Computing · 2002 · 143 citations
Generating Linear Extensions Fast
Gara Pruesse, Frank Ruskey · SIAM Journal on Computing · 1994 · 125 citations
Counting polyominoes: Yet another attack
DonaldA. Redelmeier · Discrete Mathematics · 1981 · 124 citations
1–5 of 79
154
8
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 154
89
Microsoft (United States)
Redmond, United States
8 h-index
11 publications
309 citations

University of Leeds
Leeds, United Kingdom
6 h-index
9 publications
363 citations
University of California, Berkeley
Berkeley, United States
4 h-index
6 publications
165 citations

University of Edinburgh
Edinburgh, United Kingdom
3 h-index
3 publications
76 citations
Microsoft Research (United Kingdom)
Cambridge, United Kingdom
3 h-index
4 publications
102 citations

Shanghai Jiao Tong University
Shanghai, China
3 h-index
5 publications
100 citations

University of Toronto
Toronto, Canada
3 h-index
5 publications
612 citations

Institute for Advanced Study
Princeton, United States
3 h-index
3 publications
65 citations
1–8 of 89
5 publications · 379 citations
5
h-index
3 publications · 141 citations
4
h-index
4 publications · 92 citations
4
h-index
2 publications · 32 citations
2
h-index
2 publications · 35 citations
2
h-index
1–5