Optimistic sorting and information theoretic complexity

Authors:
Peter McIlroy
Affiliations:
Computer Science Research Group, University of California at Berkeley, Berkeley, CA
Venue:
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Year:
1993

Encroaching lists as a measure of presortedness

BIT
Sublinear merging and natural merge sort

SIGAL '90 Proceedings of the international symposium on Algorithms
Sorting shuffled monotone sequences

SWAT '90 Proceedings of the second Scandinavian workshop on Algorithm theory
Elements of information theory

Elements of information theory
A Framework for Adaptive Sorting

SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
Sorting Presorted Files

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

Hi-index	0.00