Approximate Sorting

DOI10.1007/11682462_49MaRDI QIDQ5900355zbMATH OpenOpenAlexFDO

Authors Joachim Giesen, Eva Schuberth, Miloš Stojaković

Publication date 18 September 2008

Published in LATIN 2006: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11682462_49

zbMATH Keywords

Kendall's tau metricrankingsortingSpearman's footrule metric

Mathematics Subject Classification ID

Searching and sorting (68P10) Randomized algorithms (68W20) Approximation algorithms (68W25)

Recommendations

• Approximate Sorting
• Sorting, Approximate Sorting, and Searching in Rounds
• Sorting with Recurrent Comparison Errors
• Noisy sorting without resampling

Cited in

(7)

• Method for approximation of diverse individual sorting rules
• Approximate sorting of data streams with limited storage
• Approximate sorting of data streams with limited storage
• Interval Sorting
• Sorting, Approximate Sorting, and Searching in Rounds
• scientific article; zbMATH DE number 22189 (Why is no real title available?)
• Approximate Sorting

This page was built for publication: Approximate Sorting

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