Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. A. Aggarwal, A. K. Chandra, and M. Snir. Communication complexity of PRAMs. Theoretical Computer Science, 71(1):3–28, March 1990.
2. N. Alon, Z. Galil, and O. Margalit. On the exponent of the all pairs shortest path problem. Journal of Computer and System Sciences, 54(2):255–262, April 1997.
3. B. Carré. Graphs and Networks. Oxford Applied Mathematics and Computer Science Series. Clarendon Press, 1979.
4. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9(3):251–280, March 1990.
5. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The MIT Electrical Engineering and Computer Science Series. The MIT Press and McGraw-Hill, 1990.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Distilled Neural Networks for Efficient Learning to Rank;IEEE Transactions on Knowledge and Data Engineering;2022
2. Scalable All-pairs Shortest Paths for Huge Graphs on Multi-GPU Clusters;Proceedings of the 30th International Symposium on High-Performance Parallel and Distributed Computing;2021-06-21
3. Communication vs Synchronisation in Parallel String Comparison;Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures;2020-07-06
4. A supernodal all-pairs shortest path algorithm;Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming;2020-02-19
5. Toward Efficient Architecture-Independent Algorithms for Dynamic Programs;Lecture Notes in Computer Science;2019