Randomized Local Computation

Randomized Local Computation is a computational paradigm in randomized complexity theory that characterizes algorithms which, given a query about a specific part of the output, produce a localized response by performing randomized computations on a small portion of the input, ensuring consistency with a global solution while adhering to strict bounds on time and space resources.

23

Publications

1.1K

Citations

43

Authors

23

Institutions

Publications per year

2017–2026

3

Variants

Local Computation Algorithms

Authors

43

  1. AK
    Amos Korman

    Centre National de la Recherche Scientifique, France

    3 publications · 205 citations

    3

    h-index

  2. RR
    Ronitt Rubinfeld

    Massachusetts Institute of Technology, United States

    3 publications · 88 citations

    3

    h-index

  3. PF
    Pierre Fraigniaud

    Centre National de la Recherche Scientifique, France

    3 publications · 184 citations

    3

    h-index

  4. LS
    Larry Stockmeyer

    IBM Research - Almaden, United States

    2 publications · 425 citations

    2

    h-index

  5. AY
    Anak Yodpinyanee

    Tel Aviv University, Israel

    2 publications · 34 citations

    2

    h-index

1–5 of 43

Venues

  1. SIAM Journal on Computing

    3 publications · 384 citations

    3

    h-index

  2. 1

    h-index

  3. Journal of the ACM

    JACM · 1 publications · 116 citations

    1

    h-index

  4. Computational Complexity

    CC · 1 publications · 32 citations

    1

    h-index

  5. arXiv (Cornell University)

    Repository · 1 publications · 54 citations

    1

    h-index

1–5