Sortowanie Shella (Polish Wikipedia)
Analysis of information sources in references of the Wikipedia article "Sortowanie Shella" in Polish language version.
Last modified:
Ref.Un. Ref.Website
Global rank
Polish rank
380th place
865th place
8,689th place
low place
1st place
1st place
low place
low place
5,383rd place
8,711th place
acm.org (Global: 1,200th place; Polish: 1,358th place)
dl.acm.org
- Tao Jiang, Ming Li, Paul Vitányi. A Lower Bound on the Average-Case Complexity of Shellsort. „Journal of the ACM”. 47 (5), s. 905–911, 2000.
arxiv.org (Global: 49th place; Polish: 224th place)
- Svante Janson, Donald E. Knuth. Shellsort with Three Increments. „Random Structures and Algorithms”. 10 (1–2), s. 125–142, 1997. arXiv:cs/9608105.
busybox.net (Global: low place; Polish: low place)
git.busybox.net
- Manuel Novoa III: libc/stdlib/stdlib.c. [dostęp 2011-03-30].
doi.org (Global: 2nd place; Polish: 5th place)
- D.L. Shell. A High-Speed Sorting Procedure. „Communications of the ACM”. 2 (7), s. 30–32, 1959. DOI: 10.1145/368370.368387.
- R.M. Frank, R.B. Lazarus. A High-Speed Sorting Procedure. „Communications of the ACM”. 3 (1), s. 20–22, 1960. DOI: 10.1145/366947.366957.
- Thomas N. Hibbard. An Empirical Study of Minimal Storage Sorting. „Communications of the ACM”. 6 (5), s. 206–213, 1963. DOI: 10.1145/366552.366557.
- Robert Sedgewick. A New Upper Bound for Shellsort. „Journal of Algorithms”. 7 (2), s. 159–173, 1986. DOI: 10.1016/0196-6774(86)90001-5.
- David Gale, Richard M. Karp. A Phenomenon in the Theory of Sorting. „Journal of Computer and System Sciences”. 6 (2), s. 103–115, 1972. DOI: 10.1016/S0022-0000(72)80016-3.
- Terje O. Espelid. Analysis of a Shellsort Algorithm. „BIT Numerical Mathematics”. 13 (4), s. 394–400, 1973. DOI: 10.1007/BF01933401.
- Andrew Chi-Chih Yao. An Analysis of -Shellsort. „Journal of Algorithms”. 1 (1), s. 14–50, 1980. DOI: 10.1016/0196-6774(80)90003-6.
ewu.edu (Global: low place; Polish: low place)
penguin.ewu.edu
- D.L. Shell. A High-Speed Sorting Procedure. „Communications of the ACM”. 2 (7), s. 30–32, 1959. DOI: 10.1145/368370.368387.
github.com (Global: 380th place; Polish: 865th place)
- kernel/groups.c. [dostęp 2012-02-06].
- Julian Seward: bzip2/blocksort.c. [dostęp 2011-03-30].
ieee.org (Global: 912th place; Polish: 1,356th place)
ieeexplore.ieee.org
- C. Greg Plaxton, Bjorn Poonen, Torsten Suel. Improved Lower Bounds for Shellsort. „Annual Symposium on Foundations of Computer Science”. 33, s. 226–235, 1992.
kernel.org (Global: 5,383rd place; Polish: 8,711th place)
git.kernel.org
- kernel/git/torvalds/linux.git – Linux kernel source tree [online], git.kernel.org [dostęp 2020-11-14].
mathnet.ru (Global: 8,689th place; Polish: low place)
- А.А. Папернов, Г.В. Стасевич. Об одном методе упорядочивания информации в запоминающих устройствах цифровых машин. „Проблемы передачи информации”. 1 (3), s. 81–98, 1965. (ros.).
web.archive.org (Global: 1st place; Polish: 1st place)
- Marcin Ciura: Best Increments for the Average Case of Shellsort. W: Rusins Freiwalds: Proceedings of the 13th International Symposium on Fundamentals of Computation Theory. London: Springer-Verlag, 2001, s. 106–117. ISBN 3-540-42487-3.