Skip to content

Author

Aaron Putterman

We have 1 of 32 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.

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.