Data Exchange and Permutation Length

DOI10.2307/2691332MaRDI QIDQ3136719zbMATH OpenOpenAlexFDO

Authors Héctor N. Salas, Lawrence Fialkow

Publication date 21 October 1993

Full work available at URL https://doi.org/10.2307/2691332

zbMATH Keywords

average case complexityexchange-sortpermutationsruntimesorting

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The average number of block interchanges needed to sort a permutation and a recent result of Stanley
• scientific article; zbMATH DE number 2188461
• An improved block-interchange algorithm
• Batcher's odd-even exchange revisited: a generating functions approach
• The 1.375 approximation algorithm for sorting by transpositions can run in O(n n) time

Cited in

(2)

• scientific article; zbMATH DE number 1399901 (Why is no real title available?)
• The average number of block interchanges needed to sort a permutation and a recent result of Stanley

This page was built for publication: Data Exchange and Permutation Length

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