Divide-and-conquer algorithm (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Divide-and-conquer algorithm" in English language version.

refsWebsite

Global rank English rank

3semanticscholar.org

11^th place

8^th place

2books.google.com

3^rd place

2psu.edu

207^th place

136^th place

2harvard.edu

18^th place

17^th place

2doi.org

2^nd place

2mit.edu

415^th place

327^th place

1archive.org

6^th place

1pearson.com

low place

8,600^th place

1fftw.org

low place

archive.org (Global: 6^th place; English: 6^th place)

Knuth, Donald (1998). The Art of Computer Programming: Volume 3 Sorting and Searching. Addison-Wesley. p. 159. ISBN 0-201-89685-0.

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

Thomas H. Cormen; Charles E. Leiserson; Ronald L. Rivest; Clifford Stein (31 July 2009). Introduction to Algorithms. MIT Press. ISBN 978-0-262-53305-8.
Karatsuba, Anatolii A.; Yuri P. Ofman (1962). "Умножение многозначных чисел на автоматах". Doklady Akademii Nauk SSSR. 146: 293–294. Translated in Karatsuba, A.; Ofman, Yu. (1963). "Multiplication of Multidigit Numbers on Automata". Soviet Physics Doklady. 7: 595–596. Bibcode:1963SPhD....7..595K.

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

M. Frigo; C. E. Leiserson; H. Prokop (1999). "Cache-oblivious algorithms". 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039). pp. 285–297. doi:10.1109/SFFCS.1999.814600. ISBN 0-7695-0409-4. S2CID 62758836.
Frigo, M.; Johnson, S. G. (February 2005). "The design and implementation of FFTW3" (PDF). Proceedings of the IEEE. 93 (2): 216–231. Bibcode:2005IEEEP..93..216F. CiteSeerX 10.1.1.66.3097. doi:10.1109/JPROC.2004.840301. S2CID 6644892.

fftw.org (Global: low place; English: low place)

Frigo, M.; Johnson, S. G. (February 2005). "The design and implementation of FFTW3" (PDF). Proceedings of the IEEE. 93 (2): 216–231. Bibcode:2005IEEEP..93..216F. CiteSeerX 10.1.1.66.3097. doi:10.1109/JPROC.2004.840301. S2CID 6644892.

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

ui.adsabs.harvard.edu

Karatsuba, Anatolii A.; Yuri P. Ofman (1962). "Умножение многозначных чисел на автоматах". Doklady Akademii Nauk SSSR. 146: 293–294. Translated in Karatsuba, A.; Ofman, Yu. (1963). "Multiplication of Multidigit Numbers on Automata". Soviet Physics Doklady. 7: 595–596. Bibcode:1963SPhD....7..595K.
Frigo, M.; Johnson, S. G. (February 2005). "The design and implementation of FFTW3" (PDF). Proceedings of the IEEE. 93 (2): 216–231. Bibcode:2005IEEEP..93..216F. CiteSeerX 10.1.1.66.3097. doi:10.1109/JPROC.2004.840301. S2CID 6644892.

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

dspace.mit.edu

M. Frigo; C. E. Leiserson; H. Prokop (1999). "Cache-oblivious algorithms". 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039). pp. 285–297. doi:10.1109/SFFCS.1999.814600. ISBN 0-7695-0409-4. S2CID 62758836.

people.csail.mit.edu

Radu Rugina and Martin Rinard, "Recursion unrolling for divide and conquer programs" in Languages and Compilers for Parallel Computing, chapter 3, pp. 34–48. Lecture Notes in Computer Science vol. 2017 (Berlin: Springer, 2001).

pearson.com (Global: low place; English: 8,600^th place)

Kleinberg, Jon; Tardos, Eva (March 16, 2005). Algorithm Design (1 ed.). Pearson Education. pp. 214–220. ISBN 9780321295354. Retrieved 26 January 2025.

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

citeseerx.ist.psu.edu

Heideman, M. T., D. H. Johnson, and C. S. Burrus, "Gauss and the history of the fast Fourier transform", IEEE ASSP Magazine, 1, (4), 14–21 (1984).
Frigo, M.; Johnson, S. G. (February 2005). "The design and implementation of FFTW3" (PDF). Proceedings of the IEEE. 93 (2): 216–231. Bibcode:2005IEEEP..93..216F. CiteSeerX 10.1.1.66.3097. doi:10.1109/JPROC.2004.840301. S2CID 6644892.

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

api.semanticscholar.org

M. Frigo; C. E. Leiserson; H. Prokop (1999). "Cache-oblivious algorithms". 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039). pp. 285–297. doi:10.1109/SFFCS.1999.814600. ISBN 0-7695-0409-4. S2CID 62758836.
Frigo, M.; Johnson, S. G. (February 2005). "The design and implementation of FFTW3" (PDF). Proceedings of the IEEE. 93 (2): 216–231. Bibcode:2005IEEEP..93..216F. CiteSeerX 10.1.1.66.3097. doi:10.1109/JPROC.2004.840301. S2CID 6644892.

pdfs.semanticscholar.org

Nicholas J. Higham, "The accuracy of floating-point summation", SIAM J. Scientific Computing 14 (4), 783–799 (1993).

Divide-and-conquer algorithm (English Wikipedia)

archive.org (Global: 6th place; English: 6th place)

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

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