Randomized Computation Models

Randomized Computation Models is a theoretical framework in computer science that distinguishes itself from deterministic computation models by incorporating randomness as a fundamental resource in the execution and analysis of algorithms.

16

Publications

544

Citations

35

Authors

29

Institutions

Publications per year

2017–2026

1

Authors

35

  1. WM
    Wolfgang Mulzer

    Freie Universität Berlin, Germany

    2 publications · 45 citations

    2

    h-index

  2. KB
    Kevin Buchin

    Eindhoven University of Technology, Netherlands

    2 publications · 45 citations

    2

    h-index

  3. PK
    Pascal Koiran

    École Normale Supérieure de Lyon, France

    1 publications · 41 citations

    1

    h-index

  4. AU
    Arvind U. Raghunathan

    Mitsubishi Electric (United States), United States

    1 publications · 51 citations

    1

    h-index

  5. DF
    David Feldman

    Stanford University, United States

    1 publications · 17 citations

    1

    h-index

1–5 of 35

Venues

  1. Information and Computation

    2 publications · 36 citations

    2

    h-index

  2. Journal of Electronic Publishing

    JEP · 1 publications · 17 citations

    1

    h-index

  3. Theoretical Computer Science

    1 publications · 59 citations

    1

    h-index

  4. ACM SIGACT News

    1 publications · 27 citations

    1

    h-index

  5. Journal of the ACM

    JACM · 1 publications · 31 citations

    1

    h-index

1–5