Author:
Carlsson Svante,Levcopoulos Christos,Petersson Ola
Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. T. Altman and Y. Igarashi. Roughly sorting: sequential and parallel approach. Journal of Information Processing, 12(2):154–158, 1989.
2. V. Estivill-Castro and D. Wood. A new measure of presortedness. Information and Computation, 83(1):111–119, 1989.
3. E. Horowitz and S. Sahni. Fundamentals of Computer Algorithms. Computer Science Press, Rockville, Maryland, 1984.
4. C. Levcopoulos and O. Petersson. Heapsort—adapted for presorted files. In Proc. 2nd SWAT. LNCS, Springer-Verlag, 1990. To appear.
5. H. Mannila. Measures of presortedness and optimal sorting algorithms. IEEE Transactions on Computers, C-34(4):318–325, 1985.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Treaps - A Balanced and Efficient Data Structure;International Journal of Scientific Research in Computer Science, Engineering and Information Technology;2024-01-01
2. Parallelization of Modified Merge Sort Algorithm;Symmetry;2017-09-01
3. Parallelization of Fast Sort Algorithm;Communications in Computer and Information Science;2017
4. Novel Recursive Fast Sort Algorithm;Communications in Computer and Information Science;2016
5. Generating Nearly Sorted Sequences – The use of measures of disorder;Electronic Notes in Theoretical Computer Science;2004-02