Keyword

comparison complexity

Description: A measure of an algorithm’s computational cost that counts the comparisons it performs, especially in string and search problems.
OpenAlex ID: keywords/comparison-complexity
1977 · C. D. Thompson, H. T. Kung · Communications of the ACM · 521
1983 · Kruskal · IEEE Transactions on Computers · 181
2004 · Ricardo Baeza-Yates · Lecture notes in computer science · 128
1984 · Jeff Kahn, Michael Saks · Order · 113
2002 · H. Buhrman, C. Durr, et al. · IEEE Conference on Computational Complexity (CCC) · 112
1999 · Dorit Dor, Uri Zwick · SIAM Journal on Computing · 97
1975 · Michael L. Fredman · ACM Symposium on Theory of Computing (STOC) · 83
1985 · J. Komlós · COMBINATORICA · 66
2001 · Dorit Dor, Uri Zwick · SIAM Journal on Discrete Mathematics · 44
1989 · Vladimir Estivill-Castro, Derick Wood · Information and Computation · 36
1976 · C. D. Thompson, H. T. Kung · ACM Symposium on Theory of Computing (STOC) · 36
1976 · Chee K. Yap · Communications of the ACM · 35
2023 · Xingjian Bai, Christian Coester · neural information processing systems · 34
1984 · Udi Manber, Martin Tompa · SIAM Journal on Computing · 30
1983 · Pavol Hell, Moshe Rosenfeld · Journal of Algorithms · 30
1999 · Jyrki Katajainen, Tomi A. Pasanen · Information Processing Letters · 29
1996 · Janice Lent, Hosam M. Mahmoud · Statistics & Probability Letters · 29
1995 · Dorit Dor, Uri Zwick · Symposium on Discrete Algorithms · 29
1995 · Leszek Gasieniec, Wojciech Plandowski, et al. · Lecture notes in computer science · 28
1996 · H. Petersen · Theoretical Computer Science · 27
1992 · Peter Bürgisser, Thomas Lickteig, et al. · Journal of Complexity · 27
1990 · Svante Carlsson, Christos Levcopoulos, et al. · Lecture notes in computer science · 27
2003 · Jingchao Chen · Theoretical Computer Science · 26
2010 · Ricardo Baeza-Yates, Alejandro Salinger · Lecture notes in computer science · 24
Works count: 145
Citation count: 2,398
Year
Topic
Type