FCT 2001 Fundamentals of Computation Theory
 |  |
Wall of Fame | Most Viewed FCT-2001 Paper
FCT
2001
Springer
13 years 9 months ago
2001
Springer
This paper presents the results of using sequential analysis to find increment sequences that minimize the average running time of Shellsort, for array sizes up to several thousan...
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website.
Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
| Id | Read | Views | Title | Status |
|---|---|---|---|---|
| 1 |  | 138 | ||
| 2 | | 125 | ||
| 3 | | 110 | ||
| 4 | | 109 | ||
| 5 | | 104 | ||
| 6 | | 99 | ||
| 7 | | 92 | ||
| 8 | | 91 | ||
| 9 | | 75 |