A lower bound on the size of shellsort networks
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
On the Performance of WEAK-HEAPSORT
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Best Increments for the Average Case of Shellsort
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Implementing HEAPSORT with (n logn - 0.9n) and QUICKSORT with (n logn + 0.2n) comparisons
Journal of Experimental Algorithmics (JEA)
The Frobenius Problem and Its Generalizations
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
| Hi-index | 0.00 |