Notația Big O (Romanian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Notația Big O" in Romanian language version.

refsWebsite

Global rank Romanian rank

4archive.org

6^th place

23^rd place

3wikidata.org

43^rd place

2^nd place

3doi.org

2^nd place

3^rd place

2books.google.com

3^rd place

6^th place

2web.archive.org

1^st place

1austinmohr.com

low place

1mcgraw-hill.com

low place

6,391^st place

1ksu.edu

low place

1ams.org

451^st place

697^th place

1stanford.edu

179^th place

36^th place

1texblog.org

low place

1projecteuclid.org

3,707^th place

8,468^th place

1uu.nl

2,467^th place

5,733^rd place

1numdam.org

8,650^th place

low place

1worldcat.org

5^th place

11^th place

1kestrel.edu

low place

1uiuc.edu

3,087^th place

688^th place

ams.org

Donald Knuth (1998). „Teach Calculus with Big O” (PDF). Notices of the American Mathematical Society^⁠(d). 45 (6): 687. (Unabridged version Arhivat în 13 mai 2008, la Wayback Machine.)

archive.org

Bachmann, Paul (1894). Analytische Zahlentheorie [Analytic Number Theory] (în germană). 2. Leipzig: Teubner.
Landau, Edmund (1909). Handbuch der Lehre von der Verteilung der Primzahlen [Manual de teoria distribuției numerelor prime] (în germană). Leipzig: B. G. Teubner. p. 883.
Landau, Edmund (1909). Handbuch der Lehre von der Verteilung der Primzahlen [Manual de teoria distribuției numerelor prime] (în germană). Leipzig: B. G. Teubner. p. 31.
Landau, Edmund (1909). Handbuch der Lehre von der Verteilung der Primzahlen [Handbook on the theory of the distribution of the primes] (în germană). Leipzig: B. G. Teubner. p. 61.

austinmohr.com

Mohr, Austin. „Quantum Computing in Complexity Theory and Theory of Computation” (PDF) (în engleză). p. 2. Accesat în 7 iunie 2014.

books.google.com

Nicolaas Govert de Bruijn^⁠(d) (1958). Asymptotic Methods in Analysis. Amsterdam: North-Holland. pp. 5–7. ISBN 978-0-486-64221-5.
Graham, Ronald; Knuth, Donald; Patashnik, Oren (1994). Concrete Mathematics (ed. 2). Reading, Massachusetts: Addison–Wesley. p. 446. ISBN 978-0-201-55802-9.

doi.org

Hardy, G. H.; Littlewood, J. E. (1914). „Some problems of diophantine approximation: Part II. The trigonometrical series associated with the elliptic ϑ-functions”. Acta Mathematica (în engleză). 37: 225. doi:10.1007/BF02401834.
Cucker, Felipe; Bürgisser, Peter (2013). „A.1 Big Oh, Little Oh, and Other Comparisons”. Condition: The Geometry of Numerical Algorithms. Berlin, Heidelberg: Springer. pp. 467–468. doi:10.1007/978-3-642-38896-5. ISBN 978-3-642-38896-5.
Vitányi, Paul; Meertens, Lambert (aprilie 1985). „Big Omega versus the wild functions” (PDF). ACM SIGACT News (în engleză). 16 (4): 56–59. doi:10.1145/382242.382835.

kestrel.edu

Vitányi, Paul; Meertens, Lambert (aprilie 1985). „Big Omega versus the wild functions” (PDF). ACM SIGACT News (în engleză). 16 (4): 56–59. doi:10.1145/382242.382835.

ksu.edu

people.cis.ksu.edu

Howell, Rodney. „On Asymptotic Notation with Multiple Variables” (PDF). Accesat în 23 aprilie 2015.

mcgraw-hill.com

highered.mcgraw-hill.com

Thomas H. Cormen et al., 2001, Introduction to Algorithms, Second Edition^{[necesită pagina]}

numdam.org

archive.numdam.org

Balcázar, José L.; Gabarró, Joaquim. „Nonuniform complexity classes specified by lower and upper bounds” (PDF). RAIRO – Theoretical Informatics and Applications – Informatique Théorique et Applications (în engleză). 23 (2): 180. ISSN 0988-3754. Accesat în 14 martie 2017.

projecteuclid.org

Hardy, G. H.; Littlewood, J. E. (1914). „Some problems of diophantine approximation: Part II. The trigonometrical series associated with the elliptic ϑ-functions”. Acta Mathematica (în engleză). 37: 225. doi:10.1007/BF02401834.

stanford.edu

www-cs-staff.stanford.edu

Donald Knuth (1998). „Teach Calculus with Big O” (PDF). Notices of the American Mathematical Society^⁠(d). 45 (6): 687. (Unabridged version Arhivat în 13 mai 2008, la Wayback Machine.)

texblog.org

Tom (24 iunie 2014). „Big O and related notations in LaTeX”. texblog (în engleză).

uiuc.edu

math.uiuc.edu

de exemplu, este omisă în: Hildebrand, A.J. „Asymptotic Notations” (PDF). Asymptotic Methods in Analysis (în engleză). Math 595, Fall 2009. Accesat în 14 martie 2017.

uu.nl

phil.uu.nl

Donald Knuth. " Big Omicron and big Omega and big Theta Arhivat în 30 noiembrie 2021, la Wayback Machine. ", SIGACT News, aprilie-iunie 1976, 18-24.

web.archive.org

Donald Knuth (1998). „Teach Calculus with Big O” (PDF). Notices of the American Mathematical Society^⁠(d). 45 (6): 687. (Unabridged version Arhivat în 13 mai 2008, la Wayback Machine.)
Donald Knuth. " Big Omicron and big Omega and big Theta Arhivat în 30 noiembrie 2021, la Wayback Machine. ", SIGACT News, aprilie-iunie 1976, 18-24.

wikidata.org

Nicolaas Govert de Bruijn^⁠(d) (1958). Asymptotic Methods in Analysis. Amsterdam: North-Holland. pp. 5–7. ISBN 978-0-486-64221-5.
Donald Knuth (1998). „Teach Calculus with Big O” (PDF). Notices of the American Mathematical Society^⁠(d). 45 (6): 687. (Unabridged version Arhivat în 13 mai 2008, la Wayback Machine.)
Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001) [1990]. Introduction to Algorithms^⁠(d) (ed. 2nd). MIT Press and McGraw-Hill. pp. 41–50. ISBN 0-262-03293-7.

worldcat.org

Balcázar, José L.; Gabarró, Joaquim. „Nonuniform complexity classes specified by lower and upper bounds” (PDF). RAIRO – Theoretical Informatics and Applications – Informatique Théorique et Applications (în engleză). 23 (2): 180. ISSN 0988-3754. Accesat în 14 martie 2017.