Author:
Klein Philip N,Subramanian Sairam
Subject
Computational Theory and Mathematics,Computational Mathematics,Control and Optimization
Reference18 articles.
1. The Design and Analysis of Computer Algorithms;Aho,1974
2. H. Bast, M. Dietzfelbinger, T. Hagerup, 1992, A perfect parallel dictionary, 17th Symposium on Mathematical Foundations of Computer Science
3. E. Cohen, Efficient parallel shortest-paths in diagraphs with a separator decomposition, 5th ACM Symposium on Parallel Algorithms and Architectures, 1993, 57, 67
4. E. Cohen, Fast algorithms for constructingtt, 34th IEEE Symposium on Foundations of Computer Science, 1993
5. E. Cohen, Polylog-time and near-linear work approximation scheme for undirected shortest paths, Proceedings of the 26th ACM Symposium on Theory of Computing, 1994
Cited by
52 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. Efficient Construction of Directed Hopsets and Parallel Single-source Shortest Paths (Abstract);Proceedings of the 2023 ACM Workshop on Highlights of Parallel Computing;2023-07-18
3. Parallel Strong Connectivity Based on Faster Reachability;Proceedings of the ACM on Management of Data;2023-06-13
4. Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
5. Parallel Filtered Graphs for Hierarchical Clustering;2023 IEEE 39th International Conference on Data Engineering (ICDE);2023-04