An optimal algorithm for sorting in trees

DOI10.4230/LIPICS.FSTTCS.2023.7MaRDI QIDQ6951734zbMATH OpenFDO

Authors Jishnu Roychoudhury, Jatin Yadav

Publication date 28 July 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2023.7

zbMATH Keywords

treessorting

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 1003302 (Why is no real title available?)
• scientific article; zbMATH DE number 2079368 (Why is no real title available?)
• scientific article; zbMATH DE number 7646025 (Why is no real title available?)
• scientific article; zbMATH DE number 7651142 (Why is no real title available?)
• Algorithms for the Generalized Sorting Problem
• An optimal algorithm to reconstruct trees from additive distance data
• Improved Bounds for Poset Sorting in the Forbidden-Comparison Regime
• Learning a bounded-degree tree using separator queries
• On generalized comparison-based sorting problems
• On the longest path algorithm for reconstructing trees from distance matrices
• Searching in dynamic tree-like partial orders
• Sorting and Recognition Problems for Ordered Sets
• Sorting and selection in posets
• Sorting under forbidden comparisons
• Stochastic and worst-case generalized sorting revisited

This page was built for publication: An optimal algorithm for sorting in trees

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