Keyword

big O notation

Description: Big O notation describes an upper bound on the asymptotic growth of a function, commonly used to analyze algorithms and computational complexity.
Wikidata ID: wiki/Q269878
OpenAlex ID: keywords/big-o-notation
1976 · Donald E. Knuth · ACM SIGACT News · 721
2007 · Hong S. He · Forest Ecology and Management · 145
2015 · Ian Chivers, Jane Sleightholme · Springer eBooks · 113
1998 · Neal Koblitz · Algorithms and computation in mathematics · 59
2011 · S.G. Devi, K. Selvam, et al. · International Conference on Sustainable Energy and Intelligent Systems (SEISCON) · 56
2004 · A. K. Dewdney · International Linear Collider · 36
2004 · Jeremy Avigad, Kevin Donnelly · Lecture notes in computer science · 36
2022 · Firdous Ahmad Mala, Rouf Ali · Journal of Applied Mathematics and Computation · 34
2017 · Tandy Warnow · Cambridge University Press eBooks · 30
2003 · Mitchell Waite, Robert Lafore · CERN Document Server (European Organization for Nuclear Research) · 29
2015 · Oliver Faust, Wenwei Yu, et al. · Computers in Biology and Medicine · 27
2001 · David Ginat · Computer Science Education · 26
1985 · Gillea Brassard · ACM SIGACT News · 24
2023 · Achraf Djemal, Dhouha Bouchaala, et al. · Bioengineering · 22
2017 · Rob Farber · Elsevier eBooks · 22
2019 · Sammie Bae · Apress eBooks · 18
2018 · Simon Rubinstein-Salzedo · Springer undergraduate mathematics series · 17
2009 · Elvira Albert, Diego Alonso, et al. · Lecture notes in computer science · 17
2010 · Frank M. Carrano, Janet Prichard · 15
2020 · Linggis Galih Wiseso, Mahmud Imrona, et al. · International Conference on Science in Information Technology · 14
2023 · Zhanar Bimurat, Yekaterina Kim, et al. · Scientific Journal of Astana IT University · 12
2018 · Ian Chivers, Jane Sleightholme · Springer eBooks · 12
2017 · Benjamin Baka · Packt Publishing eBooks · 11
Works count: 387
Citation count: 1,859
Year
Topic
Type