"The I/O Complexity of Hybrid Algorithms for Square Matrix Multiplication."

Lorenzo De Stefani (2019)

> Home

Details and statistics

DOI: 10.4230/LIPICS.ISAAC.2019.33

access: open

type: Conference or Workshop Paper

metadata version: 2019-11-28

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/isaac/Stefani19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/Stefani19
Lorenzo De Stefani:
The I/O Complexity of Hybrid Algorithms for Square Matrix Multiplication. ISAAC 2019: 33:1-33:16

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.