Keyword

logarithmic time complexity

Description: A computational complexity class in which an algorithm's running time grows proportionally to the logarithm of input size.
OpenAlex ID: keywords/logarithmic-time-complexity
2018 · Yu A. Malkov, D. A. Yashunin · IEEE Transactions on Pattern Analysis and Machine Intelligence · 3,727
1973 · Peter M. Kogge, Harold S. Stone · IEEE Transactions on Computers · 1,446
1982 · Brent, Kung · IEEE Transactions on Computers · 1,288
1988 · Richard Cole · SIAM Journal on Computing · 828
1986 · J R Driscoll, N Sarnak, et al. · ACM Symposium on Theory of Computing (STOC) · 756
1989 · James R. Driscoll, Neil Sarnak, et al. · Journal of Computer and System Sciences · 619
1988 · Baruch Schieber, Uzi Vishkin · SIAM Journal on Computing · 575
1972 · Rudolf Bayer · Acta Informatica · 572
1986 · Richard Cole, Uzi Vishkin · Information and Control · 512
1977 · P. van Emde Boas · Information Processing Letters · 470
1976 · L. Csanky · SIAM Journal on Computing · 458
2011 · Boris N. Khoromskij · Constructive Approximation · 387
1991 · Noga Alon, Amotz Bar-Noy, et al. · Journal of Computer and System Sciences · 380
1983 · L. G. Valiant, S. Skyum, et al. · SIAM Journal on Computing · 324
1994 · Cai‐Cheng Lu, Weng Cho Chew · Microwave and Optical Technology Letters · 318
1979 · D. S. Hirschberg, A. K. Chandra, et al. · Communications of the ACM · 285
1982 · Allan Borodin, Joachim von zur Gathen, et al. · Information and Control · 278
2001 · Florin Baboescu, George Varghese · ACM SIGCOMM Conference (SIGCOMM) · 272
1986 · Amos Israeli, A. Itai · Information Processing Letters · 263
1977 · D. T. Lee, F. P. Preparata · SIAM Journal on Computing · 239
1987 · Abhiram G. Ranade · Annual Symposium on Foundations of Computer Science · 236
1975 · P. van Emde Boas · Annual Symposium on Foundations of Computer Science · 233
1984 · R.E. Tarjan, U. Vishkin · Annual Symposium on Foundations of Computer Science · 224
Works count: 944
Citation count: 24,280
Year
Topic
Type