Concepedia

Randomness-efficient Algorithms

Randomness-Efficient Algorithms is a computational method that belongs to the class of randomized algorithms and is distinguished by its minimization of the number of random bits required to achieve a desired level of performance or correctness.

42

Publications

3.1K

Citations

72

Authors

41

Institutions

Publications per year

2017–2026

3

Parents

Publications

42

Randomness and Mathematical Proof

Gregory J. Chaitin · Scientific American · 1975 · 677 citations

, , +10

Linear degree extractors and the inapproximability of max clique and chromatic number

David Zuckerman · 2006 · 404 citations

, , +16

Insights into randomized algorithms for neural networks: Practical issues and common pitfalls

Ming Li, Dianhui Wang · Information Sciences · 2016 · 216 citations

, , +16

Removing randomness in parallel computation without a processor penalty

Michael Luby · Journal of Computer and System Sciences · 1993 · 194 citations

, , +16

Randomness-efficient oblivious sampling

Mihir Bellare, John Rompel · 2002 · 158 citations

, , +5

1–5 of 42

Authors

72

  1. MP
    Mike Paterson

    University of Warwick, United Kingdom

    3 publications · 276 citations

    3

    h-index

  2. MJ
    Marcin Jurdziński

    University of Warwick, United Kingdom

    3 publications · 276 citations

    3

    h-index

  3. DZ
    David Zuckerman

    The University of Texas at Austin, United States

    3 publications · 550 citations

    3

    h-index

  4. UZ
    Uri Zwick

    Tel Aviv University, Israel

    3 publications · 276 citations

    3

    h-index

  5. AC
    Amin Coja‐Oghlan

    Goethe University Frankfurt, Germany

    2 publications · 105 citations

    2

    h-index

1–5 of 72

Institutions

41

  1. The University of Texas at Austin

    Austin, United States

    4 h-index

    7 publications

    742 citations

  2. Tel Aviv University

    Tel Aviv, Israel

    3 h-index

    3 publications

    191 citations

  3. University of Warwick

    Coventry, United Kingdom

    3 h-index

    5 publications

    438 citations

  4. University of California, Berkeley

    Berkeley, United States

    2 h-index

    2 publications

    60 citations

  5. Yale University

    New Haven, United States

    2 h-index

    3 publications

    84 citations

  6. The Institute of Statistical Mathematics

    Tokyo, Japan

    1 h-index

    1 publications

    18 citations

  7. Nanjing University of Aeronautics and Astronautics

    Nanjing, China

    1 h-index

    2 publications

    32 citations

  8. University of Hong Kong

    Pok Fu Lam, Hong Kong

    1 h-index

    1 publications

    33 citations

1–8 of 41

Venues

  1. SIAM Journal on Computing

    5 publications · 363 citations

    5

    h-index

  2. Theoretical Computer Science

    3 publications · 58 citations

    3

    h-index

  3. Information and Computation

    2 publications · 47 citations

    2

    h-index

  4. Information Sciences

    2 publications · 243 citations

    2

    h-index

  5. The Astrophysical Journal

    ApJ · 1 publications · 31 citations

    1

    h-index

1–5