Algorithm (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Algorithm" in English language version.

refsWebsite

Global rank English rank

8web.archive.org

1^st place

7doi.org

2^nd place

4books.google.com

3^rd place

4worldcat.org

5^th place

4semanticscholar.org

11^th place

8^th place

2oed.com

360^th place

231^st place

2nist.gov

355^th place

454^th place

2springer.com

274^th place

309^th place

1merriam-webster.com

209^th place

191^st place

1harvard.edu

18^th place

17^th place

1britannica.com

40^th place

58^th place

1jstor.org

26^th place

20^th place

1nthu.edu.tw

low place

1wichita.edu

low place

1discovermagazine.com

3,042^nd place

2,171^st place

1omnibooksonline.com

low place

1mit.edu

415^th place

327^th place

1algorithmdesign.net

low place

1khanacademy.org

3,659^th place

2,881^st place

1wsj.com

79^th place

65^th place

1psu.edu

207^th place

136^th place

algorithmdesign.net (Global: low place; English: low place)

ww3.algorithmdesign.net

Goodrich, Michael T.; Tamassia, Roberto (2002). Algorithm Design: Foundations, Analysis, and Internet Examples. John Wiley & Sons, Inc. ISBN 978-0-471-38365-9. Archived from the original on April 28, 2015. Retrieved June 14, 2018.

books.google.com (Global: 3^rd place; English: 3^rd place)

Skeat, Walter William (1914). "agrim, agrum". In Mayhew, Anthony Lawson (ed.). A Glossary of Tudor and Stuart Words: Especially from the Dramatists. Clarendon Press. pp. 5–6.
Simanowski, Roberto (2018). The Death Algorithm and Other Digital Dilemmas. Untimely Meditations. Vol. 14. Translated by Chase, Jefferson. Cambridge, Massachusetts: MIT Press. p. 147. ISBN 9780262536370. Archived from the original on December 22, 2019. Retrieved May 27, 2019. [...] the next level of abstraction of central bureaucracy: globally operating algorithms.
Dietrich, Eric (1999). "Algorithm". In Wilson, Robert Andrew; Keil, Frank C. (eds.). The MIT Encyclopedia of the Cognitive Sciences. MIT Cognet library. Cambridge, Massachusetts: MIT Press (published 2001). p. 11. ISBN 9780262731447. Retrieved July 22, 2020. An algorithm is a recipe, method, or technique for doing something.
Sriram, M. S. (2005). "Algorithms in Indian Mathematics". In Emch, Gerard G.; Sridharan, R.; Srinivas, M. D. (eds.). Contributions to the History of Indian Mathematics. Springer. p. 153. ISBN 978-93-86279-25-5.

britannica.com (Global: 40^th place; English: 58^th place)

Hayashi, T. (2023, January 1). Brahmagupta. Encyclopedia Britannica.

discovermagazine.com (Global: 3,042^nd place; English: 2,171^st place)

Gillian Conahan (January 2013). "Better Math Makes Faster Data Networks". discovermagazine.com. Archived from the original on May 13, 2014. Retrieved May 13, 2014.

doi.org (Global: 2^nd place; English: 2^nd place)

Grabiner, Judith V. (December 2013). "The role of mathematics in liberal arts education". In Matthews, Michael R. (ed.). International Handbook of Research in History, Philosophy and Science Teaching. Springer. pp. 793–836. doi:10.1007/978-94-007-7654-8_25. ISBN 9789400776548.
Zaslavsky, Claudia (1970). "Mathematics of the Yoruba People and of Their Neighbors in Southern Nigeria". The Two-Year College Mathematics Journal. 1 (2): 76–99. doi:10.2307/3027363. ISSN 0049-4925. JSTOR 3027363.
Chabert, Jean-Luc, ed. (1999). A History of Algorithms. doi:10.1007/978-3-642-18192-4. ISBN 978-3-540-63369-3.
Knuth, Donald E. (1972). "Ancient Babylonian Algorithms" (PDF). Commun. ACM. 15 (7): 671–677. doi:10.1145/361454.361514. ISSN 0001-0782. S2CID 7829945. Archived from the original (PDF) on December 24, 2012.
Kriegel, Hans-Peter; Schubert, Erich; Zimek, Arthur (2016). "The (black) art of run-time evaluation: Are we comparing algorithms or implementations?". Knowledge and Information Systems. 52 (2): 341–378. doi:10.1007/s10115-016-1004-2. ISSN 0219-1377. S2CID 40772241.
Kellerer, Hans; Pferschy, Ulrich; Pisinger, David (2004). Knapsack Problems | Hans Kellerer | Springer. Springer. doi:10.1007/978-3-540-24777-7. ISBN 978-3-540-40286-2. S2CID 28836720. Archived from the original on October 18, 2017. Retrieved September 19, 2017.
For instance, the volume of a convex polytope (described using a membership oracle) can be approximated to high accuracy by a randomized polynomial time algorithm, but not by a deterministic one: see Dyer, Martin; Frieze, Alan; Kannan, Ravi (January 1991). "A Random Polynomial-time Algorithm for Approximating the Volume of Convex Bodies". J. ACM. 38 (1): 1–17. CiteSeerX 10.1.1.145.4600. doi:10.1145/102782.102783. S2CID 13268711.

harvard.edu (Global: 18^th place; English: 17^th place)

chaucer.fas.harvard.edu

Chaucer, Geoffrey. "The Miller's Tale". Line 3210.

jstor.org (Global: 26^th place; English: 20^th place)

Zaslavsky, Claudia (1970). "Mathematics of the Yoruba People and of Their Neighbors in Southern Nigeria". The Two-Year College Mathematics Journal. 1 (2): 76–99. doi:10.2307/3027363. ISSN 0049-4925. JSTOR 3027363.

khanacademy.org (Global: 3,659^th place; English: 2,881^st place)

"Big-O notation (article) | Algorithms". Khan Academy. Retrieved June 3, 2024.

merriam-webster.com (Global: 209^th place; English: 191^st place)

"Definition of ALGORITHM". Merriam-Webster Online Dictionary. Archived from the original on February 14, 2020. Retrieved November 14, 2019.

mit.edu (Global: 415^th place; English: 327^th place)

groups.csail.mit.edu

Haitham Hassanieh, Piotr Indyk, Dina Katabi, and Eric Price, "ACM-SIAM Symposium On Discrete Algorithms (SODA) Archived July 4, 2013, at the Wayback Machine, Kyoto, January 2012. See also the sFFT Web Page Archived February 21, 2012, at the Wayback Machine.

nist.gov (Global: 355^th place; English: 454^th place)

xlinux.nist.gov

"Best Case". Dictionary of Algorithms and Data Structures. National Institute of Standards and Technology (NIST). National Institute of Standards and Technology. Retrieved May 29, 2025.
"worst case". Dictionary of Algorithms and Data Structures. National Institute of Standards and Technology (NIST). National Institute of Standards and Technology (NIST). Retrieved May 29, 2025.

nthu.edu.tw (Global: low place; English: low place)

steiner.math.nthu.edu.tw

Knuth, Donald E. (1972). "Ancient Babylonian Algorithms" (PDF). Commun. ACM. 15 (7): 671–677. doi:10.1145/361454.361514. ISSN 0001-0782. S2CID 7829945. Archived from the original (PDF) on December 24, 2012.

oed.com (Global: 360^th place; English: 231^st place)

"algorism". Oxford English Dictionary. Retrieved May 18, 2025.
"algorithm". Oxford English Dictionary. Retrieved May 18, 2025.

omnibooksonline.com (Global: low place; English: low place)

siam.omnibooksonline.com

Haitham Hassanieh, Piotr Indyk, Dina Katabi, and Eric Price, "ACM-SIAM Symposium On Discrete Algorithms (SODA) Archived July 4, 2013, at the Wayback Machine, Kyoto, January 2012. See also the sFFT Web Page Archived February 21, 2012, at the Wayback Machine.

psu.edu (Global: 207^th place; English: 136^th place)

citeseerx.ist.psu.edu

For instance, the volume of a convex polytope (described using a membership oracle) can be approximated to high accuracy by a randomized polynomial time algorithm, but not by a deterministic one: see Dyer, Martin; Frieze, Alan; Kannan, Ravi (January 1991). "A Random Polynomial-time Algorithm for Approximating the Volume of Convex Bodies". J. ACM. 38 (1): 1–17. CiteSeerX 10.1.1.145.4600. doi:10.1145/102782.102783. S2CID 13268711.

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Knuth, Donald E. (1972). "Ancient Babylonian Algorithms" (PDF). Commun. ACM. 15 (7): 671–677. doi:10.1145/361454.361514. ISSN 0001-0782. S2CID 7829945. Archived from the original (PDF) on December 24, 2012.
Kriegel, Hans-Peter; Schubert, Erich; Zimek, Arthur (2016). "The (black) art of run-time evaluation: Are we comparing algorithms or implementations?". Knowledge and Information Systems. 52 (2): 341–378. doi:10.1007/s10115-016-1004-2. ISSN 0219-1377. S2CID 40772241.
Kellerer, Hans; Pferschy, Ulrich; Pisinger, David (2004). Knapsack Problems | Hans Kellerer | Springer. Springer. doi:10.1007/978-3-540-24777-7. ISBN 978-3-540-40286-2. S2CID 28836720. Archived from the original on October 18, 2017. Retrieved September 19, 2017.
For instance, the volume of a convex polytope (described using a membership oracle) can be approximated to high accuracy by a randomized polynomial time algorithm, but not by a deterministic one: see Dyer, Martin; Frieze, Alan; Kannan, Ravi (January 1991). "A Random Polynomial-time Algorithm for Approximating the Volume of Convex Bodies". J. ACM. 38 (1): 1–17. CiteSeerX 10.1.1.145.4600. doi:10.1145/102782.102783. S2CID 13268711.

springer.com (Global: 274^th place; English: 309^th place)

link.springer.com

Chabert, Jean-Luc, ed. (1999). A History of Algorithms. doi:10.1007/978-3-642-18192-4. ISBN 978-3-540-63369-3.

springer.com

Kellerer, Hans; Pferschy, Ulrich; Pisinger, David (2004). Knapsack Problems | Hans Kellerer | Springer. Springer. doi:10.1007/978-3-540-24777-7. ISBN 978-3-540-40286-2. S2CID 28836720. Archived from the original on October 18, 2017. Retrieved September 19, 2017.

web.archive.org (Global: 1^st place; English: 1^st place)

"Definition of ALGORITHM". Merriam-Webster Online Dictionary. Archived from the original on February 14, 2020. Retrieved November 14, 2019.
Simanowski, Roberto (2018). The Death Algorithm and Other Digital Dilemmas. Untimely Meditations. Vol. 14. Translated by Chase, Jefferson. Cambridge, Massachusetts: MIT Press. p. 147. ISBN 9780262536370. Archived from the original on December 22, 2019. Retrieved May 27, 2019. [...] the next level of abstraction of central bureaucracy: globally operating algorithms.
Knuth, Donald E. (1972). "Ancient Babylonian Algorithms" (PDF). Commun. ACM. 15 (7): 671–677. doi:10.1145/361454.361514. ISSN 0001-0782. S2CID 7829945. Archived from the original (PDF) on December 24, 2012.
Ast, Courtney. "Eratosthenes". Wichita State University: Department of Mathematics and Statistics. Archived from the original on February 27, 2015. Retrieved February 27, 2015.
Gillian Conahan (January 2013). "Better Math Makes Faster Data Networks". discovermagazine.com. Archived from the original on May 13, 2014. Retrieved May 13, 2014.
Haitham Hassanieh, Piotr Indyk, Dina Katabi, and Eric Price, "ACM-SIAM Symposium On Discrete Algorithms (SODA) Archived July 4, 2013, at the Wayback Machine, Kyoto, January 2012. See also the sFFT Web Page Archived February 21, 2012, at the Wayback Machine.
Goodrich, Michael T.; Tamassia, Roberto (2002). Algorithm Design: Foundations, Analysis, and Internet Examples. John Wiley & Sons, Inc. ISBN 978-0-471-38365-9. Archived from the original on April 28, 2015. Retrieved June 14, 2018.
Kellerer, Hans; Pferschy, Ulrich; Pisinger, David (2004). Knapsack Problems | Hans Kellerer | Springer. Springer. doi:10.1007/978-3-540-24777-7. ISBN 978-3-540-40286-2. S2CID 28836720. Archived from the original on October 18, 2017. Retrieved September 19, 2017.

wichita.edu (Global: low place; English: low place)

math.wichita.edu

Ast, Courtney. "Eratosthenes". Wichita State University: Department of Mathematics and Statistics. Archived from the original on February 27, 2015. Retrieved February 27, 2015.

worldcat.org (Global: 5^th place; English: 5^th place)

search.worldcat.org

Zaslavsky, Claudia (1970). "Mathematics of the Yoruba People and of Their Neighbors in Southern Nigeria". The Two-Year College Mathematics Journal. 1 (2): 76–99. doi:10.2307/3027363. ISSN 0049-4925. JSTOR 3027363.
Knuth, Donald E. (1972). "Ancient Babylonian Algorithms" (PDF). Commun. ACM. 15 (7): 671–677. doi:10.1145/361454.361514. ISSN 0001-0782. S2CID 7829945. Archived from the original (PDF) on December 24, 2012.
Kriegel, Hans-Peter; Schubert, Erich; Zimek, Arthur (2016). "The (black) art of run-time evaluation: Are we comparing algorithms or implementations?". Knowledge and Information Systems. 52 (2): 341–378. doi:10.1007/s10115-016-1004-2. ISSN 0219-1377. S2CID 40772241.
"The Experts: Does the Patent System Encourage Innovation?". The Wall Street Journal. May 16, 2013. ISSN 0099-9660. Retrieved March 29, 2017.

wsj.com (Global: 79^th place; English: 65^th place)

"The Experts: Does the Patent System Encourage Innovation?". The Wall Street Journal. May 16, 2013. ISSN 0099-9660. Retrieved March 29, 2017.

Algorithm (English Wikipedia)

algorithmdesign.net (Global: low place; English: low place)

ww3.algorithmdesign.net

books.google.com (Global: 3rd place; English: 3rd place)

britannica.com (Global: 40th place; English: 58th place)

discovermagazine.com (Global: 3,042nd place; English: 2,171st place)

doi.org (Global: 2nd place; English: 2nd place)

harvard.edu (Global: 18th place; English: 17th place)

chaucer.fas.harvard.edu

jstor.org (Global: 26th place; English: 20th place)

khanacademy.org (Global: 3,659th place; English: 2,881st place)

merriam-webster.com (Global: 209th place; English: 191st place)

mit.edu (Global: 415th place; English: 327th place)

groups.csail.mit.edu

nist.gov (Global: 355th place; English: 454th place)

xlinux.nist.gov

nthu.edu.tw (Global: low place; English: low place)

steiner.math.nthu.edu.tw

oed.com (Global: 360th place; English: 231st place)

omnibooksonline.com (Global: low place; English: low place)

siam.omnibooksonline.com

psu.edu (Global: 207th place; English: 136th place)

citeseerx.ist.psu.edu

semanticscholar.org (Global: 11th place; English: 8th place)

api.semanticscholar.org

springer.com (Global: 274th place; English: 309th place)

link.springer.com

springer.com

web.archive.org (Global: 1st place; English: 1st place)

wichita.edu (Global: low place; English: low place)

math.wichita.edu

worldcat.org (Global: 5th place; English: 5th place)

search.worldcat.org

wsj.com (Global: 79th place; English: 65th place)

books.google.com (Global: 3^rd place; English: 3^rd place)

britannica.com (Global: 40^th place; English: 58^th place)

discovermagazine.com (Global: 3,042^nd place; English: 2,171^st place)

doi.org (Global: 2^nd place; English: 2^nd place)

harvard.edu (Global: 18^th place; English: 17^th place)

jstor.org (Global: 26^th place; English: 20^th place)

khanacademy.org (Global: 3,659^th place; English: 2,881^st place)

merriam-webster.com (Global: 209^th place; English: 191^st place)

mit.edu (Global: 415^th place; English: 327^th place)

nist.gov (Global: 355^th place; English: 454^th place)

oed.com (Global: 360^th place; English: 231^st place)

psu.edu (Global: 207^th place; English: 136^th place)

semanticscholar.org (Global: 11^th place; English: 8^th place)

springer.com (Global: 274^th place; English: 309^th place)

web.archive.org (Global: 1^st place; English: 1^st place)

worldcat.org (Global: 5^th place; English: 5^th place)

wsj.com (Global: 79^th place; English: 65^th place)