Matrix chain multiplication (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Matrix chain multiplication" in English language version.

refsWebsite
Global rank English rank
2nd place
2nd place
11th place
8th place
207th place
136th place
low place
low place
5th place
5th place
1st place
1st place
179th place
183rd place
3,324th place
2,257th place
low place
low place

doi.org

  • Schwartz, Oded; Weiss, Elad (January 2019). "Revisiting Computation of Matrix Chain Products". SIAM Journal on Computing. 48 (5): 1481–1486. doi:10.1137/18m1195401. S2CID 203009883.
  • Hu, T. C.; Shing, M.-T. (1982). "Computation of Matrix Chain Products, Part I" (PDF). SIAM Journal on Computing. 11 (2): 362–373. CiteSeerX 10.1.1.695.2923. doi:10.1137/0211028. ISSN 0097-5397.
  • Hu, T. C.; Shing, M.-T. (1984). "Computation of Matrix Chain Products, Part II" (PDF). SIAM Journal on Computing. 13 (2): 228–251. CiteSeerX 10.1.1.695.4875. doi:10.1137/0213017. ISSN 0097-5397.
  • Artur, Czumaj (1996). "Very Fast Approximation of the Matrix Chain Product Problem" (PDF). Journal of Algorithms. 21: 71–79. CiteSeerX 10.1.1.218.8168. doi:10.1006/jagm.1996.0037. S2CID 2818053. Archived from the original (PDF) on 2018-07-27.
  • Wang, Xiaodong; Zhu, Daxin; Tian, Jun (April 2013). "Efficient computation of matrix chain". 2013 8th International Conference on Computer Science & Education. pp. 703–707. doi:10.1109/ICCSE.2013.6553999. ISBN 978-1-4673-4463-0. S2CID 17303326.
  • Nimbark, Hitesh; Gohel, Shobhen; Doshi, Nishant (2011). "A Novel Approach for Matrix Chain Multiplication Using Greedy Technique for Packet Processing". Computer Networks and Information Technologies. Communications in Computer and Information Science. Vol. 142. pp. 318–321. doi:10.1007/978-3-642-19542-6_58. ISBN 978-3-642-19541-9.
  • Chin, Francis Y. (July 1978). "An O(n) algorithm for determining a near-optimal computation order of matrix chain products". Communications of the ACM. 21 (7): 544–549. doi:10.1145/359545.359556.
  • Hu, T.C; Shing, M.T (June 1981). "An O(n) algorithm to find a near-optimum partition of a convex polygon". Journal of Algorithms. 2 (2): 122–138. doi:10.1016/0196-6774(81)90014-6.

korea.ac.kr

ccs.korea.ac.kr

lsu.edu

csc.lsu.edu

psu.edu

citeseerx.ist.psu.edu

citeseer.ist.psu.edu

semanticscholar.org

api.semanticscholar.org

  • Schwartz, Oded; Weiss, Elad (January 2019). "Revisiting Computation of Matrix Chain Products". SIAM Journal on Computing. 48 (5): 1481–1486. doi:10.1137/18m1195401. S2CID 203009883.
  • Artur, Czumaj (1996). "Very Fast Approximation of the Matrix Chain Product Problem" (PDF). Journal of Algorithms. 21: 71–79. CiteSeerX 10.1.1.218.8168. doi:10.1006/jagm.1996.0037. S2CID 2818053. Archived from the original (PDF) on 2018-07-27.
  • Wang, Xiaodong; Zhu, Daxin; Tian, Jun (April 2013). "Efficient computation of matrix chain". 2013 8th International Conference on Computer Science & Education. pp. 703–707. doi:10.1109/ICCSE.2013.6553999. ISBN 978-1-4673-4463-0. S2CID 17303326.

pdfs.semanticscholar.org

stanford.edu

infolab.stanford.edu

ust.hk

cs.ust.hk

web.archive.org

worldcat.org

search.worldcat.org