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)

• An optimal parallel adaptive sorting algorithm
• Splitsort -- an adaptive sorting algorithm
• Right invariant metrics and measures of presortedness
• Presorting algorithms: an average-case point of view
• A new measure of presortedness
• Smoothsort's behavior on presorted sequences
• A framework for adaptive sorting
• Counting inversions adaptively
• Adaptive sorting: an information theoretic perspective
• Efficient fully-compressed sequence representations
• Nearly-optimal mergesorts: fast, practical sorting methods that optimally adapt to existing runs
• Sorting shuffled monotone sequences
• Smooth heaps and a dual view of self-adjusting data structures
• A note on adaptive parallel sorting
• On partitions and presortedness of sequences
• Sorting roughly sorted sequences in parallel

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)