| A deterministic distributed algorithm for exact weighted all-pairs shortest paths in õ (n 3/2) rounds U Agarwal, V Ramachandran, V King, M Pontecorvi Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing …, 2018 | 38 | 2018 |
| Fine-grained complexity for sparse graphs U Agarwal, V Ramachandran Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 34 | 2018 |
| DistTC: High performance distributed triangle counting L Hoang, V Jatala, X Chen, U Agarwal, R Dathathri, G Gill, K Pingali 2019 IEEE High Performance Extreme Computing Conference (HPEC), 1-7, 2019 | 32 | 2019 |
| Bipart: a parallel and deterministic hypergraph partitioner S Maleki, U Agarwal, M Burtscher, K Pingali Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of …, 2021 | 23 | 2021 |
| Faster Deterministic All Pairs Shortest Paths in Congest Model U Agarwal, V Ramachandran arXiv preprint arXiv:2005.09588, 2020 | 22 | 2020 |
| Distributed weighted all pairs shortest paths through pipelining U Agarwal, V Ramachandran 2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS …, 2019 | 20 | 2019 |
| SPRoute 2.0: A detailed-routability-driven deterministic parallel global router with soft capacity J He, U Agarwal, Y Yang, R Manohar, K Pingali 2022 27th Asia and South Pacific Design Automation Conference (ASP-DAC), 586-591, 2022 | 14 | 2022 |
| Finding Simple Shortest Paths and Cycles U Agarwal, V Ramachandran arXiv preprint arXiv:1512.02157, 2015 | 11 | 2015 |
| Fine-grained complexity and conditional hardness for sparse graphs U Agarwal, V Ramachandran arXiv preprint arXiv:1611.07008, 2016 | 9 | 2016 |
| New and simplified distributed algorithms for weighted all pairs shortest paths U Agarwal, V Ramachandran arXiv preprint arXiv:1810.08544, 2018 | 7 | 2018 |
| A deterministic distributed algorithm for weighted all pairs shortest paths through pipelining U Agarwal, V Ramachandran arXiv preprint arXiv:1807.08824, 2018 | 2 | 2018 |
| Distributed Deterministic Exact Minimum Weight Cycle and Multi Source Shortest Paths in Near Linear Rounds in CONGEST model U Agarwal arxiv preprint arxiv:2310.00782, 2023 | | 2023 |
| Optimizing Graph Transformer Networks with Graph-based Techniques L Hoang, U Agarwal, G Gill, R Dathathri, A Seal, B Martin, K Pingali arXiv preprint arXiv:2106.08500, 2021 | | 2021 |
| BiPart S Maleki, U Agarwal, M Burtscher, K Pingali Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of …, 2021 | | 2021 |
| A Polynomial Time Algorithm for Almost Optimal Vertex Fault Tolerant Spanners U Agarwal arXiv preprint arXiv:2002.11617, 2020 | | 2020 |
| Algorithms, Parallelism and Fine-Grained Complexity for Shortest Path Problems in Sparse Graphs U Agarwal The University of Texas at Austin, 2019 | | 2019 |
| On reachability in graphs with obstacles U Agarwal, K Kapoor Discrete Mathematics, Algorithms and Applications 7 (04), 1550059, 2015 | | 2015 |
| Hypergraph Partitioning via Geometric Embeddings S Maleki, U Agarwal, K Pingali | | |
| A Digital Flow for Asynchronous VLSI Systems: Status Update U Agarwal, S Ataei, J He, W Hua, YS Lu, S Maleki, Y Yang, K Pingali, ... | | |
| IPDPS 2019 I Foster, U Agarwal, V Ramachandran | | |
