Approximation In Parallel Computation
Approximation in Parallel Computation is a theoretical framework in parallel complexity theory that characterizes the efficiency and accuracy of parallel algorithms designed to compute near-optimal solutions for problems where exact solutions are computationally infeasible under polylogarithmic time and polynomial processor constraints.
63
Publications
2.5K
Citations
125
Authors
79
Institutions
Publications per year
2017–2026
15
Parents
63
Approximating total flow time on parallel machines
Stefano Leonardi, Danny Raz · 1997 · 148 citations
Towards a theory of nearly constant time parallel algorithms
J. Gil, Yossi Matias, Uzi Vishkin · 2002 · 146 citations
1–5 of 63
125
4
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 125
79

Tel Aviv University
Tel Aviv, Israel
6 h-index
11 publications
1.1K citations
National University of Singapore
Singapore, Singapore
4 h-index
6 publications
137 citations
ETH Zurich
Zurich, Switzerland
4 h-index
5 publications
158 citations

University of Waterloo
Waterloo, Canada
3 h-index
3 publications
71 citations
Stanford University
Stanford, United States
3 h-index
3 publications
57 citations
Max Planck Institute for Informatics
Saarbrücken, Germany
3 h-index
5 publications
125 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
3 publications
49 citations
University of Maryland, College Park
College Park, United States
2 h-index
3 publications
309 citations
1–8 of 79
Repository · 6 publications · 106 citations
6
h-index
2 publications · 48 citations
2
h-index
2 publications · 267 citations
2
h-index
TPDS · 2 publications · 55 citations
2
h-index
2 publications · 156 citations
2
h-index
1–5