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

Authors

88

  1. SC
    Saar Cohen

    Johns Hopkins University Applied Physics Laboratory, United States

    2 publications · 532 citations

    2

    h-index

  2. DD
    Daniel D. Sleator

    Carnegie Mellon University, United States

    2 publications · 336 citations

    2

    h-index

  3. YM
    Yossi Matias

    Google (United States), United States

    2 publications · 532 citations

    2

    h-index

  4. YC
    Yang Chen

    Fudan University, China

    1 publications · 25 citations

    1

    h-index

  5. BX
    Bin Xiao

    Hong Kong Polytechnic University, Hong Kong SAR China

    1 publications · 64 citations

    1

    h-index

1–5 of 88

Venues

  1. Algorithmica

    3 publications · 371 citations

    3

    h-index

  2. Journal of Computer and System Sciences

    2 publications · 177 citations

    2

    h-index

  3. Information Processing Letters

    2 publications · 64 citations

    2

    h-index

  4. Internet Mathematics

    1 publications · 2K citations

    1

    h-index

  5. Distributed Computing

    1 publications · 23 citations

    1

    h-index

1–5