Keyword

parallel complexity

Description: A measure of the computational resources, such as time or processors, required to solve a problem using parallel algorithms.
OpenAlex ID: keywords/parallel-complexity
1981 · Walter L. Ruzzo · Journal of Computer and System Sciences · 491
1992 · Paul Feautrier · International Journal of Parallel Programming · 476
1988 · Richard M. Karp · UC Berkeley · 359
1985 · John H. Reif · Information Processing Letters · 342
1980 · Walter L. Ruzzo · Journal of Computer and System Sciences · 296
1984 · Michael J. Quinn, Narsingh Deo · ACM Computing Surveys · 175
1992 · Tomás Feder · Journal of Computer and System Sciences · 149
1990 · David A. Mix Barrington, Howard Straubing, et al. · Information and Computation · 134
1989 · Neil Immerman · SIAM Journal on Computing · 133
1988 · Jeffrey D. Ullman, Allen Van Gelder · Algorithmica · 129
1988 · Christos Papadimitriou, Mihalis Yannakakis · ACM Symposium on Theory of Computing (STOC) · 122
1991 · Alicia Dickenstein, Noaï Fitchas, et al. · Discrete Applied Mathematics · 106
2011 · Paraschos Koutris, Dan Suciu · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · 102
1987 · Victor Pan · Theoretical Computer Science · 100
2016 · Julian Shun, Farbod Roosta-Khorasani, et al. · Proceedings of the VLDB Endowment · 94
1993 · Mariano P. Consens, Alberto O. Mendelzon · Theoretical Computer Science · 94
2000 · Kurt S. Anderson, Shanzhong Duan · Journal of Guidance Control and Dynamics · 83
1984 · Uzi Vishkin · ACM Symposium on Theory of Computing (STOC) · 79
1995 · E. Kaltofen · Journal of Computer and System Sciences · 76
2013 · Shad Kirmani, Padma Raghavan · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · 66
1987 · F. Afrati, C. Papadimitriou · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · 64
1989 · Richard J. Anderson, Ernst W. Mayr, et al. · Information and Computation · 63
Works count: 554
Citation count: 9,137
Year
Topic
Type