Tri de Shell (French Wikipedia)
Analysis of information sources in references of the Wikipedia article "Tri de Shell" in French language version.
Last modified:
Ref.Un. Ref.Website
Global rank
French rank
4th place
15th place
10th place
94th place
8,689th place
low place
acm.org (Global: 1,200th place; French: 1,303rd place)
dl.acm.org
- (en) ShellD L, « A high-speed sorting procedure », Communications of the ACM, (DOI 10.1145/368370.368387, lire en ligne, consulté le )
doi.org (Global: 2nd place; French: 3rd place)
dx.doi.org
- (en) D. L. Shell, « A high-speed sorting procedure », Communications of the ACM, New York, ACM, vol. 2, no 7, , p. 30-32 (ISSN 0001-0782 et 1557-7317, OCLC 1514517, DOI 10.1145/368370.368387).
- (en) ShellD L, « A high-speed sorting procedure », Communications of the ACM, (DOI 10.1145/368370.368387, lire en ligne, consulté le )
- C. Greg Plaxton, Bjarne Poonen et Torsten Suel, « Improved Lower Bounds for Shellsort », dans Annual Symposium on Foundations of Computer Science, vol. 33, (DOI 10.1109/SFCS.1992.267769), p. 226–235
- Frank R. M. et R. B. Lazarus, « A High-Speed Sorting Procedure », Communications of the ACM, vol. 3, no 1, , p. 20–22 (DOI 10.1145/366947.366957)
- Thomas N. Hibbard, « An Empirical Study of Minimal Storage Sorting », Communications of the ACM, vol. 6, no 5, , p. 206–213 (DOI 10.1145/366552.366557)
- Janet Incerpi et Robert Sedgewick, « Improved Upper Bounds on Shellsort », Journal of Computer and System Sciences, vol. 31, no 2, , p. 210–224 (DOI 10.1016/0022-0000(85)90042-x)
- Robert Sedgewick, « A New Upper Bound for Shellsort », Journal of Algorithms, vol. 7, no 2, , p. 159–173 (DOI 10.1016/0196-6774(86)90001-5)
dtic.mil (Global: 934th place; French: 1,968th place)
- Vaughan Pratt, « Shellsort and Sorting Networks (Outstanding Dissertations in the Computer Sciences) »
- Vaughan Pratt, Shellsort and sorting networks, Garland Pub, , 59 p. (ISBN 0-8240-4406-1, OCLC 5008158, lire en ligne)
issn.org (Global: 33rd place; French: 4th place)
portal.issn.org
- (en) D. L. Shell, « A high-speed sorting procedure », Communications of the ACM, New York, ACM, vol. 2, no 7, , p. 30-32 (ISSN 0001-0782 et 1557-7317, OCLC 1514517, DOI 10.1145/368370.368387).
mathnet.ru (Global: 8,689th place; French: low place)
- A. A. Papernov et G. V. Stasevich, « A Method of Information Sorting in Computer Memories », Problems of Information Transmission, vol. 1, no 3, , p. 63–75 (lire en ligne)
polsl.pl (Global: low place; French: low place)
sun.aei.polsl.pl
- Marcin Ciura, « Best Increments for the Average Case of Shellsort », dans Proceedings of the 13th International Symposium on Fundamentals of Computation Theory, Springer, (ISBN 3540424873, lire en ligne), p. 106–117
wcupa.edu (Global: low place; French: low place)
cs.wcupa.edu
wikidata.org (Global: 10th place; French: 94th place)
- (en) D. L. Shell, « A high-speed sorting procedure », Communications of the ACM, New York, ACM, vol. 2, no 7, , p. 30-32 (ISSN 0001-0782 et 1557-7317, OCLC 1514517, DOI 10.1145/368370.368387).
worldcat.org (Global: 4th place; French: 15th place)
- (en) D. L. Shell, « A high-speed sorting procedure », Communications of the ACM, New York, ACM, vol. 2, no 7, , p. 30-32 (ISSN 0001-0782 et 1557-7317, OCLC 1514517, DOI 10.1145/368370.368387).
- Vaughan Pratt, Shellsort and sorting networks, Garland Pub, , 59 p. (ISBN 0-8240-4406-1, OCLC 5008158, lire en ligne)