Efficient Matrix Chain Ordering in Polylog Time-Reference-Cited by-同舟云学术

Efficient Matrix Chain Ordering in Polylog Time

Published:1998-04 Issue:2 Volume:27 Page:466-490
ISSN:0097-5397
Container-title:SIAM Journal on Computing
language:en
Short-container-title:SIAM J. Comput.

Author:

Bradford Phillip G.,Rawlins Gregory J. E.,Shannon Gregory E.

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Subject

General Mathematics,General Computer Science

Link

http://epubs.siam.org/doi/pdf/10.1137/S0097539794270698

Reference24 articles.

1. Geometric applications of a matrix-searching algorithm

2. A.Aho, Dž.Hopkroft, Dž.Ul’man, Postroenie i analiz vychislitelnykh algoritmov, “Mir”, 1979, 536–0, Translated by A. O. Slisenko; Edited by Ju. V. Matijasevič80g:68036

3. Parallelism and the maximal path problem

4. Efficient Parallel Algorithms for String Editing and Related Problems

5. An efficient parallel algorithm for the row minima of a totally monotone matrix

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Parallel and (Nearly) Work-Efficient Dynamic Programming;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17

2. A Unifying Mathematical Definition of Particle Methods;IEEE Open Journal of the Computer Society;2023

3. A fast sequential algorithm for the matrix chain ordering problem;Concurrency and Computation: Practice and Experience;2021-06-21

4. Revisiting “Computation of Matrix Chain Products'';SIAM Journal on Computing;2019-01

5. The generalized matrix chain algorithm;Proceedings of the 2018 International Symposium on Code Generation and Optimization;2018-02-24