Udit Agarwal
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| A deterministic distributed algorithm for exact weighted all-pairs shortest paths in \(\tilde{O}(n^{3/2})\) rounds Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
| Fine-grained complexity for sparse graphs Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
| Finding k simple shortest paths and cycles (available as arXiv preprint) | 2018-04-19 | Paper |
| On reachability in graphs with obstacles Discrete Mathematics, Algorithms and Applications | 2016-02-22 | Paper |
Research outcomes over time
This page was built for person: Udit Agarwal
