Randomized Algorithms

Randomized Algorithms is an algorithmic design paradigm in which algorithms deliberately employ internal random choices during their execution, so that key performance measures such as running time or output correctness become random variables over these choices rather than being uniquely determined by the input alone.

1.6K

Publications

109.2K

Citations

2.6K

Authors

894

Institutions

Publications per year

2017–2026

214

Authors

2.6K

  1. AW
    Avi Wigderson

    Hebrew University of Jerusalem, Israel

    19 publications · 1.2K citations

    15

    h-index

  2. AF
    Alan Frieze

    Carnegie Mellon University, United States

    15 publications · 1.1K citations

    14

    h-index

  3. RT
    Roberto Tempo

    Politecnico di Torino, Italy

    18 publications · 851 citations

    13

    h-index

  4. CW
    Carsten Witt

    Technical University of Denmark, Denmark

    13 publications · 777 citations

    13

    h-index

  5. NN
    Noam Nisan

    Hebrew University of Jerusalem, Israel

    13 publications · 2.4K citations

    12

    h-index

1–5 of 2.6K

Venues

  1. SIAM Journal on Computing

    44 publications · 3.6K citations

    29

    h-index

  2. Theoretical Computer Science

    38 publications · 2.3K citations

    23

    h-index

  3. arXiv (Cornell University)

    Repository · 58 publications · 1.6K citations

    23

    h-index

  4. Random Structures and Algorithms

    27 publications · 1.9K citations

    21

    h-index

  5. Journal of the ACM

    JACM · 25 publications · 4.7K citations

    21

    h-index

1–5