"Revisiting the I/O-Complexity of Fast Matrix Multiplication with ..."

Roy Nissim, Oded Schwartz (2019)

> Home

Details and statistics

DOI: 10.1109/IPDPS.2019.00058

access: closed

type: Conference or Workshop Paper

metadata version: 2024-10-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ipps/NissimS19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ipps/NissimS19
Roy Nissim, Oded Schwartz:
Revisiting the I/O-Complexity of Fast Matrix Multiplication with Recomputations. IPDPS 2019: 482-490

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.