Author

Matei Tinca

View on Semantic Scholar

1 paper indexed here

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

Cut Query Reachability for DAGs with Subquadratic Queries

This work restricts its attention to directed acyclic graphs (DAGs) and obtains a deterministic single-source reachability algorithm using $O(n \sqrt{n \log n})$ queries, based on a topological sort algorithm, and can also be adapted to compute single-source shortest paths in DAGs.

B. Bals, Matei Tinca, Yasamin Nazari · arXiv.org · 0 citations