Keyword

logarithmic time algorithms

Description: Algorithms whose running time grows in proportion to the logarithm of the input size, typically indicating efficient computation.
OpenAlex ID: keywords/logarithmic-time-algorithms
1986 · Noga Alon, László Babai, et al. · Journal of Algorithms · 970
1982 · Irene Gargantini · Communications of the ACM · 719
1982 · J. Misra, David Gries · Science of Computer Programming · 636
2010 · Guillaume Duclos-Cianci, David Poulin · Physical Review Letters · 314
1989 · Richard Cole, Uzi Vishkin · Information and Computation · 221
1983 · David P. Dobkin, David G. Kirkpatrick · Theoretical Computer Science · 210
1986 · Richard Cole, Uzi Vishkin · Annual Symposium on Foundations of Computer Science · 203
1993 · Angel E. García, Lewis Stiller · Journal of Computational Chemistry · 159
1986 · Yael Maon, Baruch Schieber, et al. · Theoretical Computer Science · 135
1990 · Dany Breslauer, Zvi Galil · SIAM Journal on Computing · 79
2001 · Ka Wong Chong, Yijie Han, et al. · Journal of the ACM · 77
2004 · D. Barbosa, A.O. Mendelzon, et al. · IEEE International Conference on Data Engineering (ICDE) · 76
2004 · Damien Woods, Thomas J. Naughton · Theoretical Computer Science · 51
2003 · Steven Eker · Lecture notes in computer science · 51
1998 · L. Szirmay-Kalos, G. Márton · Computing · 49
1987 · Michael T. Goodrich · Information Processing Letters · 48
1993 · J. Zerovnik, T. Pisanski · Journal of Algorithms · 42
2000 · Chin-Hsiung Wu, Shi-Jinn Horng, et al. · Journal of Parallel and Distributed Computing · 41
1994 · Helmut Alt, David Hsu, et al. · Canadian Conference on Computational Geometry · 41
· Umut A. Acar, Alexander T. Ihler, et al. · 39
2003 · J. Jang, H. Park, et al. · Symposium on the Frontiers of Massively Parallel Computation (Frontiers) · 37
1991 · M.M. Eshaghian · IEEE Transactions on Computers · 37
Works count: 200
Citation count: 5,673
Year
Topic
Type