A Near-Optimal Generalized Sorting Algorithm
It is shown that up to logarithmic factors, generalized sorting is no harder than ordinary sorting, and a randomized algorithm is given that uses $O(n \log^4 n)$ comparisons in expectation.
We have 2 of 13 papers
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
It is shown that up to logarithmic factors, generalized sorting is no harder than ordinary sorting, and a randomized algorithm is given that uses $O(n \log^4 n)$ comparisons in expectation.
This work begins a systematic study of basic problems in directed \emph{acyclic} graphs (DAGs) and shows that reachability from a single vertex and even topological sorting are both computable in O(n \log^3 n) many cut queries.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.