Randomized Data Structures
Randomized Data Structures is a data structure that incorporates randomness into its construction, update, or query processes to achieve probabilistic guarantees on performance or complexity.
37
Publications
4.2K
Citations
88
Authors
59
Institutions
Publications per year
2017–2026
1
37
Network Applications of Bloom Filters: A Survey
Andrei Broder, Michael Mitzenmacher · Internet Mathematics · 2004 · 2K citations · Full text
Saar Cohen, Yossi Matias · 2003 · 395 citations
A strongly competitive randomized paging algorithm
Lyle A. McGeoch, Daniel D. Sleator · Algorithmica · 1991 · 241 citations · Full text
Saar Cohen, Yossi Matias · 2003 · 137 citations
1–5 of 37
88
Johns Hopkins University Applied Physics Laboratory, United States
2 publications · 532 citations
2
h-index
2
h-index
2
h-index
1
h-index
1
h-index
1–5 of 88
59

Saarland University
Saarbrücken, Germany
2 h-index
2 publications
85 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
2 publications
336 citations

Tel Aviv University
Tel Aviv, Israel
2 h-index
4 publications
1.1K citations
Stanford University
Stanford, United States
2 h-index
2 publications
65 citations
AT&T (United States)
Bedminster, United States
2 h-index
2 publications
126 citations

The University of Queensland
Brisbane, Australia
1 h-index
1 publications
21 citations
Princeton University
Princeton, United States
1 h-index
2 publications
24 citations
Iowa State University
Ames, United States
1 h-index
3 publications
42 citations
1–8 of 59
3 publications · 371 citations
3
h-index
2 publications · 177 citations
2
h-index
2 publications · 64 citations
2
h-index
1 publications · 2K citations
1
h-index
1 publications · 23 citations
1
h-index
1–5