Skip to content

Author

Junkai Song

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.

Preprint Nov 2026

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.

Sanjeev Khanna, Aaron L. Putterman, Jun-Kai Song · 0 citations
Jul 2026

Reachability in Directed Acyclic Graphs with Near-Linear Cut Queries

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.

Sanjeev Khanna, Aaron Putterman, Junkai Song · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.