Block sort (English Wikipedia)

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

refsWebsite

Global rank English rank

5doi.org

2^nd place

3hanyang.ac.kr

low place

2psu.edu

207^th place

136^th place

2github.com

383^rd place

320^th place

1mathnet.ru

8,783^rd place

low place

1worldcat.org

5^th place

1archive.today

14^th place

1web.archive.org

1^st place

1carbon60.com

low place

archive.today

Arne Kutzner. "In-place Merging Algorithm Benchmarking Tool". Archived from the original on 2014-04-15. Retrieved 2014-03-23.

carbon60.com

lists.archive.carbon60.com

Tim Peters. "Re: WikiSort". Retrieved 2020-09-13.

doi.org

Mannila, Heikki; Ukkonen, Esko (14 May 1984). "A Simple Linear Time Algorithm for In-Situ Merging". Information Processing Letters. 18 (4): 203–208. doi:10.1016/0020-0190(84)90112-1.
Geffert, Viliam; Katajainen, Jykri; Pasanen, Tomi (April 2000). "Asymptotically efficient in-place merging". Theoretical Computer Science. 237 (1–2): 159–181. CiteSeerX 10.1.1.22.5750. doi:10.1016/S0304-3975(98)00162-5.
Hwang, F. K.; Lin, S. (1972). A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets. SIAM Journal on Computing. Vol. 1. pp. 31–39. doi:10.1137/0201004. ISSN 0097-5397.
Symvonis, Antonios (1995). "Optimal Stable Merging". The Computer Journal. 38 (8): 681–690. CiteSeerX 10.1.1.55.6058. doi:10.1093/comjnl/38.8.681.
Huang, B-C.; Langston, M. A. (1 December 1992). "Fast Stable Merging and Sorting in Constant Extra Space". The Computer Journal. 35 (6): 643–650. doi:10.1093/comjnl/35.6.643.

github.com

"BonzaiThePenguin/WikiSort: Public domain implementations of block sort for C, C++, and Java". GitHub. Retrieved 2014-03-23.
- Astrelin, Andrey (6 November 2023). "Mrrl/GrailSort".
hanyang.ac.kr
itbe.hanyang.ac.kr
- Kutzner, Arne; Kim, Pok-Son (2008). Ratio Based Stable In-Place Merging (PDF). Lecture Notes in Computer Science. Vol. 4978. Springer Berlin Heidelberg. pp. 246–257. Retrieved 2016-09-07.
- Arne Kutzner. "In-place Merging Algorithm Benchmarking Tool". Archived from the original on 2016-12-20. Retrieved 2016-12-11.
ak.hanyang.ac.kr
- Arne Kutzner. "In-place Merging Algorithm Benchmarking Tool". Archived from the original on 2014-04-15. Retrieved 2014-03-23.
mathnet.ru
mi.mathnet.ru
- Kronrod, M. Alexander (February 1969). "Оптимальный алгоритм упорядочения без рабочего поля" [An Optimal Ordering Algorithm without a Field of Operation]. Proceedings of the USSR Academy of Sciences (in Russian). 186 (6): 1256–1258.
psu.edu
citeseerx.ist.psu.edu
- Geffert, Viliam; Katajainen, Jykri; Pasanen, Tomi (April 2000). "Asymptotically efficient in-place merging". Theoretical Computer Science. 237 (1–2): 159–181. CiteSeerX 10.1.1.22.5750. doi:10.1016/S0304-3975(98)00162-5.
- Symvonis, Antonios (1995). "Optimal Stable Merging". The Computer Journal. 38 (8): 681–690. CiteSeerX 10.1.1.55.6058. doi:10.1093/comjnl/38.8.681.
web.archive.org
- Arne Kutzner. "In-place Merging Algorithm Benchmarking Tool". Archived from the original on 2016-12-20. Retrieved 2016-12-11.
worldcat.org
search.worldcat.org
- Hwang, F. K.; Lin, S. (1972). A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets. SIAM Journal on Computing. Vol. 1. pp. 31–39. doi:10.1137/0201004. ISSN 0097-5397.

Block sort (English Wikipedia)

archive.today

carbon60.com

lists.archive.carbon60.com

doi.org

github.com

hanyang.ac.kr

itbe.hanyang.ac.kr

ak.hanyang.ac.kr

mathnet.ru

mi.mathnet.ru

psu.edu

citeseerx.ist.psu.edu

web.archive.org

worldcat.org

search.worldcat.org