Donald Knuth's 1976 note setting out precise, standard definitions for the Big O, Big Omega and Big Theta asymptotic notations used to describe how an algorithm's running time and memory use grow with its input, published in ACM SIGACT News, volume 8, issue 2, pages 18 to 24.
Facts
AuthorDonald Knuth
PublisherACM SIGACT News
Publication Year1976
URLhttps://dl.acm.org/doi/10.1145/1008328.1008329
Source TypeJournal article
Reliability Tier1
The primary published note fixing the standard meaning of the asymptotic notations for computer science, the field's own foundational terminology source, its volume, issue and page numbers cross-checked against the ACM Digital Library's own listing. Sources
Claims Backed By This Source (14 claims)
This source backs 14 claims across the atlas. As facts: 10 well-attested. As cited relationships: 1 holds, 1 connected. Plus 2 entities citing it as a general reference with no single fact or relationship attached.
Disposition By Topic
- Sources, 7 claims: 7 well-attested.
- Theories, 5 claims: 3 well-attested, 1 connected, 1 general references.
- Scientists, 2 claims: 1 holds, 1 general references.
Reader Challenges (0 open reader challenges)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.
View At A Past Year
The atlas records no dated fact of its own for this entry, so there is no other year to choose.