Merge algorithm (English Wikipedia)

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

Last modified: 20:32:51, 11 November 2025 (UTC)

Ref.Un. Ref.Website

Global rank English rank

43doi.org

2^nd place

41uno.edu

low place

32semanticscholar.org

15^th place

8^th place

31mpg.de

1,722^nd place

1,710^th place

22psu.edu

299^th place

159^th place

21arxiv.org

49^th place

31^st place

21hdl.handle.net

66^th place

34^th place

11drdobbs.com

low place

11cppreference.com

low place

11python.org

4,399^th place

3,941^st place

arxiv.org (Global: 49^th place; English: 31^st place)

Papaphilippou, Philippos; Luk, Wayne; Brooks, Chris (2022). "FLiMS: a Fast Lightweight 2-way Merger for Sorting". IEEE Transactions on Computers: 1–12. arXiv:2112.05607. doi:10.1109/TC.2022.3146509. hdl:10044/1/95271. S2CID 245669103.

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

en.cppreference.com

"std:merge". cppreference.com. 2018-01-08. Retrieved 2018-04-28.

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

Kim, Pok-Son; Kutzner, Arne (2004). Stable Minimum Storage Merging by Symmetric Comparisons. European Symp. Algorithms. Lecture Notes in Computer Science. Vol. 3221. pp. 714–723. CiteSeerX 10.1.1.102.4612. doi:10.1007/978-3-540-30140-0_63. ISBN 978-3-540-23025-0. {{cite conference}}: Cite uses deprecated parameter |citeseerx= (help)
Papaphilippou, Philippos; Luk, Wayne; Brooks, Chris (2022). "FLiMS: a Fast Lightweight 2-way Merger for Sorting". IEEE Transactions on Computers: 1–12. arXiv:2112.05607. doi:10.1109/TC.2022.3146509. hdl:10044/1/95271. S2CID 245669103.
Saitoh, Makoto; Elsayed, Elsayed A.; Chu, Thiem Van; Mashimo, Susumu; Kise, Kenji (April 2018). "A High-Performance and Cost-Effective Hardware Merge Sorter without Feedback Datapath". 2018 IEEE 26th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM). pp. 197–204. doi:10.1109/FCCM.2018.00038. ISBN 978-1-5386-5522-1. S2CID 52195866.

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

Victor J. Duvanenko (2011), "Parallel Merge", Dr. Dobb's Journal

hdl.handle.net (Global: 66^th place; English: 34^th place)

Papaphilippou, Philippos; Luk, Wayne; Brooks, Chris (2022). "FLiMS: a Fast Lightweight 2-way Merger for Sorting". IEEE Transactions on Computers: 1–12. arXiv:2112.05607. doi:10.1109/TC.2022.3146509. hdl:10044/1/95271. S2CID 245669103.

mpg.de (Global: 1,722^nd place; English: 1,710^th place)

people.mpi-inf.mpg.de

Kurt Mehlhorn; Peter Sanders (2008). Algorithms and Data Structures: The Basic Toolbox. Springer. ISBN 978-3-540-77978-0.

psu.edu (Global: 299^th place; English: 159^th place)

citeseerx.ist.psu.edu

Katajainen, Jyrki; Pasanen, Tomi; Teuhola, Jukka (1996). "Practical in-place mergesort". Nordic J. Computing. 3 (1): 27–40. CiteSeerX 10.1.1.22.8523. {{cite journal}}: Cite uses deprecated parameter |citeseerx= (help)
Kim, Pok-Son; Kutzner, Arne (2004). Stable Minimum Storage Merging by Symmetric Comparisons. European Symp. Algorithms. Lecture Notes in Computer Science. Vol. 3221. pp. 714–723. CiteSeerX 10.1.1.102.4612. doi:10.1007/978-3-540-30140-0_63. ISBN 978-3-540-23025-0. {{cite conference}}: Cite uses deprecated parameter |citeseerx= (help)

python.org (Global: 4,399^th place; English: 3,941^st place)

docs.python.org

"heapq — Heap queue algorithm — Python 3.10.1 documentation".

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

api.semanticscholar.org

Papaphilippou, Philippos; Luk, Wayne; Brooks, Chris (2022). "FLiMS: a Fast Lightweight 2-way Merger for Sorting". IEEE Transactions on Computers: 1–12. arXiv:2112.05607. doi:10.1109/TC.2022.3146509. hdl:10044/1/95271. S2CID 245669103.
Saitoh, Makoto; Elsayed, Elsayed A.; Chu, Thiem Van; Mashimo, Susumu; Kise, Kenji (April 2018). "A High-Performance and Cost-Effective Hardware Merge Sorter without Feedback Datapath". 2018 IEEE 26th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM). pp. 197–204. doi:10.1109/FCCM.2018.00038. ISBN 978-1-5386-5522-1. S2CID 52195866.

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

cs.uno.edu

Greene, William A. (1993). k-way Merging and k-ary Sorts (PDF). Proc. 31-st Annual ACM Southeast Conf. pp. 127–135.

Merge algorithm (English Wikipedia)

arxiv.org (Global: 49th place; English: 31st place)

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

en.cppreference.com

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

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

hdl.handle.net (Global: 66th place; English: 34th place)

mpg.de (Global: 1,722nd place; English: 1,710th place)

people.mpi-inf.mpg.de

psu.edu (Global: 299th place; English: 159th place)

citeseerx.ist.psu.edu

python.org (Global: 4,399th place; English: 3,941st place)

docs.python.org

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

api.semanticscholar.org

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

cs.uno.edu

arxiv.org (Global: 49^th place; English: 31^st place)

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

hdl.handle.net (Global: 66^th place; English: 34^th place)

mpg.de (Global: 1,722^nd place; English: 1,710^th place)

psu.edu (Global: 299^th place; English: 159^th place)

python.org (Global: 4,399^th place; English: 3,941^st place)

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