Sorting Shuffled Monotone Sequences
暂无分享,去创建一个
[1] Heikki Mannila,et al. Measures of Presortedness and Optimal Sorting Algorithms , 1985, IEEE Transactions on Computers.
[2] Kurt Mehlhorn. Sorting Presorted Files , 1979, Theoretical Computer Science.
[3] Alfred V. Aho,et al. Data Structures and Algorithms , 1983 .
[4] Steven Skiena,et al. Encroaching lists as a measure of presortedness , 1988, BIT.
[5] Svante Carlsson,et al. Sublinear Merging and Natural Merge Sort , 1990, SIGAL International Symposium on Algorithms.
[6] Roger L. Wainwright,et al. A class of sorting algorithms based on Quicksort , 1985, CACM.
[7] Michael L. Fredman,et al. On computing the length of longest increasing subsequences , 1975, Discret. Math..
[8] Klaus W. Wagner,et al. Monotonic Coverings of Finite Sets , 1984, J. Inf. Process. Cybern..
[9] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .
[10] Christos Levcopoulos,et al. Heapsort - Adapted for Presorted Files , 1989, WADS.
[11] R. Geoff Dromey. Exploiting partial order with Quicksort , 1984, Softw. Pract. Exp..
[12] Curtis R. Cook,et al. Best sorting algorithm for nearly sorted lists , 1980, CACM.
[13] Dieter Kratsch,et al. On Partitions of Permutations into Increasing and Decreasing Subsequences , 1986, J. Inf. Process. Cybern..
[14] C. Schensted. Longest Increasing and Decreasing Subsequences , 1961, Canadian Journal of Mathematics.
[15] Derick Wood,et al. A New Measure of Presortedness , 1989, Inf. Comput..
[16] Christos Levcopoulos,et al. Splitsort - An Adaptive Sorting Algorithm , 1990, MFCS.