Keyword

expected time complexity

Description: The expected computational resources, usually running time, required by an algorithm under a specified distribution or source of randomness.
OpenAlex ID: keywords/expected-time-complexity
1985 · Jeffrey S. Vitter · ACM Transactions on Mathematical Software · 2,212
1993 · Sunil Arya, David M. Mount · Symposium on Discrete Algorithms · 482
1990 · Jon Louis Bentley · Annual Symposium on Computational Geometry (SoCG) · 432
1995 · Luděk Kučera · Discrete Applied Mathematics · 253
2006 · Luc Devroye · Handbooks in operations research and management science · 234
1992 · Micha Sharir, Emo Welzl · Lecture notes in computer science · 227
1990 · Brendan D McKay, Nicholas C Wormald · Journal of Algorithms · 179
2010 · L. Brim, J. Chaloupka, et al. · Formal Methods in System Design · 177
2003 · Yijie Han, M. Thorup · Annual Symposium on Foundations of Computer Science · 149
1999 · T. M. Chan · Discrete & Computational Geometry · 127
1993 · Kenneth L. Clarkson · Lecture notes in computer science · 121
1995 · W. Ludwig · Information and Computation · 120
1986 · Baek S. Kim, Song B. Park · IEEE Transactions on Pattern Analysis and Machine Intelligence · 120
1987 · B. Bollobás, T. I. Fenner, et al. · COMBINATORICA · 119
1984 · Herbert S. Wilf · Information Processing Letters · 110
2010 · Claus Diem · Compositio Mathematica · 107
1996 · Rajeev Raman · Lecture notes in computer science · 106
2018 · Pasi Fränti · Journal Of Big Data · 105
2004 · Buhrman, Harry, Spalek, Robert · UvA-DARE (University of Amsterdam) · 103
1993 · Jorma Tarhio, Esko Ukkonen · SIAM Journal on Computing · 100
1992 · Jean-Daniel Boissonnat, Olivier Devillers, et al. · Discrete & Computational Geometry · 100
2011 · Joel C. Miller, Aric Hagberg · Lecture notes in computer science · 99
1992 · Pankaj K. Agarwal, Jiří Matoušek, et al. · Computational Geometry · 96
Works count: 374
Citation count: 11,180
Year
Topic
Type