Sorting shuffled monotone sequences
type: Item
instance of: scholarly article
title: Sorting shuffled monotone sequences
zbMATH Open document ID: 1502.68110
DOI: 10.1007/3-540-52846-6_88
author: Ola Petersson
author: Christos Levcopoulos
published in: SWAT 90
publication date: 2022-12-09T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 7631619
MaRDI profile type: MaRDI publication profile
full work available at URL: 3-540-52846-6 88
OpenAlex ID: W2146729413
cites work: Q3948568
cites work: Q4724636
cites work: Sublinear merging and natural mergesort
cites work: Exploiting partial order with Quicksort
cites work: Right invariant metrics and measures of presortedness
cites work: A new measure of presortedness
cites work: On computing the length of longest increasing subsequences
cites work: Q4057549
cites work: Q4028912
cites work: Q3359741
cites work: Measures of Presortedness and Optimal Sorting Algorithms
cites work: Q4178501
cites work: Q3219751
cites work: Longest Increasing and Decreasing Subsequences
cites work: Encroaching lists as a measure of presortedness
cites work: Q3681937
Recommended article: Sorting shuffled monotone sequences
Recommended article: Splitsort -- an adaptive sorting algorithm
Recommended article: A framework for adaptive sorting
Recommended article: Randomized adaptive sorting
Recommended article: Q3359741
description: scientific article; zbMATH DE number 7631619