Author:
Shi Hanmao,Spencer Thomas H
Subject
Computational Theory and Mathematics,Computational Mathematics,Control and Optimization
Reference14 articles.
1. The Design and Analysis of Computer Algorithms;Aho,1974
2. E. Cohen, Efficient parallel shortest-paths in digraphs with a separator decomposition, in, 5th Symposium on Parallel Algorithms and Architectures, 1993, 57, 67
3. Parallel merge sort;Cole;SIAM J. Comput.,1988
4. E. Cohen, Undirected shortest paths in poly-log time and near-linear work, 1993
5. D. Coppersmith, S. Winograd, Matrix multiplication via arithmetic progressions, in, Proc. 19th Annual ACM Symposium on Theory of Computing, 1987, 1, 6
Cited by
35 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Folklore Sampling is Optimal for Exact Hopsets: Confirming the √n Barrier;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
2. A Case Study of an Adaptive Delta-Stepping Algorithm in OpenMP;2023 Research, Invention, and Innovation Congress: Innovative Electricals and Electronics (RI2C);2023-08-24
3. Parallel Strong Connectivity Based on Faster Reachability;Proceedings of the ACM on Management of Data;2023-06-13
4. Having Hope in Hops: New Spanners, Preservers and Lower Bounds for Hopsets;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
5. Linear-Size hopsets with small hopbound, and constant-hopbound hopsets in RNC;Distributed Computing;2022-06-29