Randomized Space Complexity
Randomized Space Complexity is a complexity measure in computational theory that characterizes the minimum amount of memory space required by a probabilistic Turing machine to solve a decision problem with bounded error probability.
41
Publications
5K
Citations
76
Authors
52
Institutions
Publications per year
2017–2026
2
Parents
41
The space complexity of approximating the frequency moments
Noga Alon, Yossi Matias, Márió Szegedy · 1996 · 847 citations
Noam Nisan, David Zuckerman · Journal of Computer and System Sciences · 1996 · 652 citations
Saar Cohen, Yossi Matias · 2003 · 395 citations
1–5 of 41
76
4
h-index
3
h-index
Johns Hopkins University Applied Physics Laboratory, United States
2 publications · 532 citations
2
h-index
2
h-index
2
h-index
1–5 of 76
52

Tel Aviv University
Tel Aviv, Israel
3 h-index
5 publications
1.9K citations
Stanford University
Stanford, United States
2 h-index
3 publications
100 citations
The University of Texas at Austin
Austin, United States
2 h-index
2 publications
715 citations
Hebrew University of Jerusalem
Jerusalem, Israel
2 h-index
2 publications
721 citations

Lund University
Lund, Sweden
2 h-index
2 publications
57 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
3 publications
66 citations
Yale University
New Haven, United States
2 h-index
4 publications
286 citations
RTI International
Durham, United States
1 h-index
1 publications
32 citations
1–8 of 52
4 publications · 1.9K citations
4
h-index
3 publications · 238 citations
3
h-index
2 publications · 35 citations
2
h-index
Repository · 2 publications · 47 citations
2
h-index
2 publications · 110 citations
2
h-index
1–5