Strassen algorithm (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Strassen algorithm" in English language version.

refsWebsite

Global rank English rank

7doi.org

2^nd place

2semanticscholar.org

11^th place

8^th place

1uci.edu

3,063^rd place

2,041^st place

1researchgate.net

120^th place

125^th place

1ieee.org

652^nd place

515^th place

1elsevier.com

610^th place

704^th place

1acm.org

1,185^th place

840^th place

1siam.org

low place

6,473^rd place

1harvard.edu

18^th place

17^th place

1worldcat.org

5^th place

1mit.edu

415^th place

327^th place

1manchester.ac.uk

4,003^rd place

2,646^th place

1handle.net

102^nd place

76^th place

acm.org

dl.acm.org

Karstadt, Elaye; Schwartz, Oded (2017-07-24). "Matrix Multiplication, a Little Faster". Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures. ACM. pp. 101–110. doi:10.1145/3087556.3087579. ISBN 978-1-4503-4593-4.

doi.org

Strassen, Volker (1969). "Gaussian Elimination is not Optimal". Numer. Math. 13 (4): 354–356. doi:10.1007/BF02165411. S2CID 121656251.
Huang, Jianyu; Smith, Tyler M.; Henry, Greg M.; van de Geijn, Robert A. (13 Nov 2016). Strassen's Algorithm Reloaded. SC16: The International Conference for High Performance Computing, Networking, Storage and Analysis. IEEE Press. pp. 690–701. doi:10.1109/SC.2016.58. ISBN 9781467388153. Retrieved 1 Nov 2022.
Winograd, S. (October 1971). "On multiplication of 2 × 2 matrices". Linear Algebra and Its Applications. 4 (4): 381–388. doi:10.1016/0024-3795(71)90009-7.
Karstadt, Elaye; Schwartz, Oded (2017-07-24). "Matrix Multiplication, a Little Faster". Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures. ACM. pp. 101–110. doi:10.1145/3087556.3087579. ISBN 978-1-4503-4593-4.
Schwartz, Oded; Vaknin, Noa (2023-12-31). "Pebbling Game and Alternative Basis for High Performance Matrix Multiplication". SIAM Journal on Scientific Computing. 45 (6): C277 – C303. Bibcode:2023SJSC...45C.277S. doi:10.1137/22M1502719. ISSN 1064-8275.
Webb, Miller (1975). "Computational complexity and numerical stability". SIAM J. Comput. 4 (2): 97–107. doi:10.1137/0204009.
Higham, Nicholas J. (1990). "Exploiting fast matrix multiplication within the level 3 BLAS" (PDF). ACM Transactions on Mathematical Software. 16 (4): 352–368. doi:10.1145/98267.98290. hdl:1813/6900. S2CID 5715053.

elsevier.com

linkinghub.elsevier.com

Winograd, S. (October 1971). "On multiplication of 2 × 2 matrices". Linear Algebra and Its Applications. 4 (4): 381–388. doi:10.1016/0024-3795(71)90009-7.

handle.net

hdl.handle.net

Higham, Nicholas J. (1990). "Exploiting fast matrix multiplication within the level 3 BLAS" (PDF). ACM Transactions on Mathematical Software. 16 (4): 352–368. doi:10.1145/98267.98290. hdl:1813/6900. S2CID 5715053.

harvard.edu

ui.adsabs.harvard.edu

Schwartz, Oded; Vaknin, Noa (2023-12-31). "Pebbling Game and Alternative Basis for High Performance Matrix Multiplication". SIAM Journal on Scientific Computing. 45 (6): C277 – C303. Bibcode:2023SJSC...45C.277S. doi:10.1137/22M1502719. ISSN 1064-8275.

ieee.org

ieeexplore.ieee.org

Huang, Jianyu; Smith, Tyler M.; Henry, Greg M.; van de Geijn, Robert A. (13 Nov 2016). Strassen's Algorithm Reloaded. SC16: The International Conference for High Performance Computing, Networking, Storage and Analysis. IEEE Press. pp. 690–701. doi:10.1109/SC.2016.58. ISBN 9781467388153. Retrieved 1 Nov 2022.

manchester.ac.uk

maths.manchester.ac.uk

Higham, Nicholas J. (1990). "Exploiting fast matrix multiplication within the level 3 BLAS" (PDF). ACM Transactions on Mathematical Software. 16 (4): 352–368. doi:10.1145/98267.98290. hdl:1813/6900. S2CID 5715053.

mit.edu

supertech.csail.mit.edu

Frigo, M.; Leiserson, C. E.; Prokop, H.; Ramachandran, S. (1999). Cache-oblivious algorithms (PDF). Proc. IEEE Symp. on Foundations of Computer Science (FOCS). pp. 285–297.

researchgate.net

Huang, Jianyu; Smith, Tyler M.; Henry, Greg M.; van de Geijn, Robert A. (13 Nov 2016). Strassen's Algorithm Reloaded. SC16: The International Conference for High Performance Computing, Networking, Storage and Analysis. IEEE Press. pp. 690–701. doi:10.1109/SC.2016.58. ISBN 9781467388153. Retrieved 1 Nov 2022.

semanticscholar.org

api.semanticscholar.org

Strassen, Volker (1969). "Gaussian Elimination is not Optimal". Numer. Math. 13 (4): 354–356. doi:10.1007/BF02165411. S2CID 121656251.
Higham, Nicholas J. (1990). "Exploiting fast matrix multiplication within the level 3 BLAS" (PDF). ACM Transactions on Mathematical Software. 16 (4): 352–368. doi:10.1145/98267.98290. hdl:1813/6900. S2CID 5715053.

siam.org

epubs.siam.org

Schwartz, Oded; Vaknin, Noa (2023-12-31). "Pebbling Game and Alternative Basis for High Performance Matrix Multiplication". SIAM Journal on Scientific Computing. 45 (6): C277 – C303. Bibcode:2023SJSC...45C.277S. doi:10.1137/22M1502719. ISSN 1064-8275.

uci.edu

ics.uci.edu

D'Alberto, Paolo; Nicolau, Alexandru (2005). Using Recursion to Boost ATLAS's Performance (PDF). Sixth Int'l Symp. on High Performance Computing.

worldcat.org

search.worldcat.org

Schwartz, Oded; Vaknin, Noa (2023-12-31). "Pebbling Game and Alternative Basis for High Performance Matrix Multiplication". SIAM Journal on Scientific Computing. 45 (6): C277 – C303. Bibcode:2023SJSC...45C.277S. doi:10.1137/22M1502719. ISSN 1064-8275.