Big O Notation
Big O Notation is a formal asymptotic notation used in algorithm analysis to classify the upper bound growth rate of an algorithm's time or space complexity in relation to input size.
15
Publications
533
Citations
45
Authors
22
Institutions
Publications per year
2017–2026
6
Variants
Landau Notation
Parents
15
Anthony Lin · WikiJournal of Science · 2019 · 51 citations · Full text
Nico Döttling, Satrajit Ghosh, Jesper Buus Nielsen et al. · 2017 · 49 citations
1–5 of 15
45
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 45
22
Eindhoven University of Technology
Eindhoven, The Netherlands
1 h-index
2 publications
20 citations
University of Southern California
Los Angeles, United States
1 h-index
1 publications
44 citations
Dalhousie University
Halifax, Canada
1 h-index
1 publications
17 citations
Universiti Putra Malaysia
Seri Kembangan, Malaysia
1 h-index
4 publications
480 citations
Simon Fraser University
Burnaby, Canada
1 h-index
1 publications
17 citations

Huazhong University of Science and Technology
Wuhan, China
1 h-index
1 publications
44 citations
National Tsing Hua University
Hsinchu, Taiwan
1 h-index
1 publications
79 citations
Tianjin Normal University
Tianjin, China
1 h-index
1 publications
44 citations
1–8 of 22
1 publications · 35 citations
1
h-index
JMAC · 1 publications · 17 citations
1
h-index
JR · 1 publications · 12 citations
1
h-index
1 publications · 51 citations
1
h-index
1 publications · 10 citations
1
h-index
1–5