Algorithms for the generalized poset sorting problem

DOI10.4230/LIPICS.ICALP.2024.92MaRDI QIDQ6875102zbMATH OpenFDO

Authors Shaofeng H.-C. Jiang, Wenqian Wang, Yubo Zhang, Yu-Hao Zhang

Publication date 14 January 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2024.92

zbMATH Keywords

generalized sortingposet sortingsorting

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• Algorithms for the Generalized Sorting Problem
• An algorithm for bichromatic sorting with polylog competitive ratio
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Computing with Noisy Information
• Generalized sorting with predictions
• scientific article; zbMATH DE number 1003302 (Why is no real title available?)
• scientific article; zbMATH DE number 2079316 (Why is no real title available?)
• Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime
• Matching nuts and bolts faster
• Matching Nuts and Bolts in O(n log n) Time
• Noisy sorting without resampling
• Optimal Bounds for Noisy Sorting
• Query strategies for priced information
• Sorting and Recognition Problems for Ordered Sets
• Sorting and selection in posets
• Sorting and Selection with Random Costs
• Sorting under forbidden comparisons
• Stochastic and worst-case generalized sorting revisited

This page was built for publication: Algorithms for the generalized poset sorting problem

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