受强制性开放获取政策约束的文章 - Udit Agarwal了解详情
可在其他位置公开访问的文章：5 篇
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
强制性开放获取政策： US National Science Foundation, Natural Sciences and Engineering Research …
Fine-grained complexity for sparse graphs
U Agarwal, V Ramachandran
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
强制性开放获取政策： US National Science Foundation
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
强制性开放获取政策： US National Science Foundation, US Department of Defense
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
强制性开放获取政策： US National Science Foundation, US Department of Defense
Distributed weighted all pairs shortest paths through pipelining
U Agarwal, V Ramachandran
2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS …, 2019
强制性开放获取政策： US National Science Foundation
出版信息和资助信息由计算机程序自动确定