Algorithms for the Generalized Sorting Problem

DOI10.1109/FOCS.2011.54MaRDI QIDQ5494998zbMATH OpenFDO

Authors Sampath Kannan, Sanjeev Khanna, Zhiyi Huang

Publication date 30 July 2014

Published in 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/FOCS.2011.54

Mathematics Subject Classification ID

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

Cited in

(10)

• On the optimality of tape merge of two lists with similar size
• On generalized comparison-based sorting problems
• Shattering, graph orientations, and connectivity
• Energy efficient sorting, selection and searching
• Generalized sorting with predictions revisited
• Energy efficient sorting, selection and searching
• Algorithms for the generalized poset sorting problem
• An algorithm for bichromatic sorting with polylog competitive ratio
• On instance-optimal algorithms for a generalization of nuts and bolts and generalized sorting
• An optimal algorithm for sorting in trees

This page was built for publication: Algorithms for the Generalized Sorting Problem

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