scientific article; zbMATH DE number 3614186

zbMath0395.68054MaRDI QIDQ4178501

Kurt Mehlhorn

Publication date: 1979

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmfilessorting

Mathematics Subject Classification ID

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

Related Items (16)

A framework for adaptive sorting ⋮ Unnamed Item ⋮ Sorting roughly sorted sequences in parallel ⋮ Smooth Heaps and a Dual View of Self-Adjusting Data Structures ⋮ Efficient fully-compressed sequence representations ⋮ An optimal parallel adaptive sorting algorithm ⋮ Splitsort -- an adaptive sorting algorithm ⋮ Adaptive sorting: an information theoretic perspective ⋮ Right invariant metrics and measures of presortedness ⋮ A note on adaptive parallel sorting ⋮ Sorting shuffled monotone sequences ⋮ A new measure of presortedness ⋮ Presorting algorithms: an average-case point of view ⋮ Smoothsort's behavior on presorted sequences ⋮ Counting inversions adaptively ⋮ On partitions and presortedness of sequences

This page was built for publication: