The Input/Output Complexity of Sparse Matrix Multiplication

Morten Stöckel; Rasmus Pagh

doi:10.1007/978-3-662-44777-2_62

The Input/Output Complexity of Sparse Matrix Multiplication

Morten Stöckel
, Rasmus Pagh

Algorithms

Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

Original language	English
Title of host publication	Algorithms - ESA 2014 : 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Proceedings
Volume	8737
Publisher	Springer
Publication date	2015
Pages	750-761
ISBN (Print)	978-3-662-44776-5
ISBN (Electronic)	978-3-662-44777-2
DOIs	https://doi.org/10.1007/978-3-662-44777-2_62
Publication status	Published - 2015

Series	Lecture Notes in Computer Science
ISSN	0302-9743

Access to Document

10.1007/978-3-662-44777-2_62

The Input Output Complexity of Sparse Matrix MultiplicationAccepted author manuscript, 205 KB

Cite this

@inproceedings{28c125a9bafb4d0bbfc0199bfe0b67fc,

title = "The Input/Output Complexity of Sparse Matrix Multiplication",

author = "Morten St{\"o}ckel and Rasmus Pagh",

year = "2015",

doi = "10.1007/978-3-662-44777-2\_62",

language = "English",

isbn = "978-3-662-44776-5",

volume = "8737",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "750--761",

booktitle = "Algorithms - ESA 2014",

address = "Germany",

}

The Input/Output Complexity of Sparse Matrix Multiplication. / Stöckel, Morten; Pagh, Rasmus.
Algorithms - ESA 2014: 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Proceedings. Vol. 8737 Springer, 2015. p. 750-761 (Lecture Notes in Computer Science).

Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review