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
Parents
23
Moni Naor, Larry Stockmeyer · SIAM Journal on Computing · 1995 · 317 citations
Towards a complexity theory for local distributed computing
Pierre Fraigniaud, Amos Korman, David Peleg · Journal of the ACM · 2013 · 116 citations
Moni Naor, Larry Stockmeyer · 1993 · 108 citations
Fast Local Computation Algorithms
Ronitt Rubinfeld, Gil Tamir, Shai Vardi et al. · arXiv (Cornell University) · 2011 · 54 citations · Full text
1–5 of 23
43
3
h-index
3
h-index
3
h-index
2
h-index
2
h-index
1–5 of 43
23
Université Paris Cité
Paris, France
6 h-index
10 publications
512 citations

Centre National de la Recherche Scientifique
Paris, France
4 h-index
8 publications
478 citations
Délégation Paris 7
Bagnolet, France
4 h-index
5 publications
280 citations

Weizmann Institute of Science
Rehovot, Israel
4 h-index
4 publications
262 citations
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
6 publications
162 citations

Tel Aviv University
Tel Aviv, Israel
3 h-index
3 publications
103 citations
Technion – Israel Institute of Technology
Haifa, Israel
3 h-index
3 publications
100 citations
Laboratoire d'Informatique Algorithmique: Fondements et Applications
Paris, France
2 h-index
3 publications
122 citations
1–8 of 23
3 publications · 384 citations
3
h-index
1 publications · 16 citations
1
h-index
JACM · 1 publications · 116 citations
1
h-index
CC · 1 publications · 32 citations
1
h-index
Repository · 1 publications · 54 citations
1
h-index
1–5