On partitions and presortedness of sequences

Authors:
Jingsen Chen;Svante Carlsson
Affiliations:
Department of Computer Science, Lund University, Box 118, S-221 00 Lund, Sweden;Department of Computer Science, Lund University, Box 118, S-221 00 Lund, Sweden
Venue:
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Year:
1991

The ultimate planar convex hull algorithm

SIAM Journal on Computing
Encroaching lists as a measure of presortedness

BIT
A new measure of presortedness

Information and Computation
Sorting shuffled monotone sequences

SWAT '90 Proceedings of the second Scandinavian workshop on Algorithm theory
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Best sorting algorithm for nearly sorted lists

Communications of the ACM
Sorting Presorted Files

Proceedings of the 4th GI-Conference on Theoretical Computer Science

Hi-index	0.00