scientific article; zbMATH DE number 3614186

MaRDI QIDQ4178501zbMATH OpenFDO

Authors K. Mehlhorn

Publication date 1979

zbMATH Keywords

algorithmfilessorting

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10)

Cited in

(16)

• Counting inversions adaptively
• A note on adaptive parallel sorting
• scientific article; zbMATH DE number 7378733 (Why is no real title available?)
• Adaptive sorting: an information theoretic perspective
• Smoothsort's behavior on presorted sequences
• A new measure of presortedness
• An optimal parallel adaptive sorting algorithm
• Sorting roughly sorted sequences in parallel
• Splitsort -- an adaptive sorting algorithm
• On partitions and presortedness of sequences
• Efficient fully-compressed sequence representations
• Smooth heaps and a dual view of self-adjusting data structures
• Right invariant metrics and measures of presortedness
• A framework for adaptive sorting
• Presorting algorithms: an average-case point of view
• Sorting shuffled monotone sequences

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4178501)