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

Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review

Originalsprog	Engelsk
Titel	Algorithms - ESA 2014 : 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014. Proceedings
Vol/bind	8737
Forlag	Springer
Publikationsdato	2015
Sider	750-761
ISBN (Trykt)	978-3-662-44776-5
ISBN (Elektronisk)	978-3-662-44777-2
DOI	https://doi.org/10.1007/978-3-662-44777-2_62
Status	Udgivet - 2015

Navn	Lecture Notes in Computer Science
ISSN	0302-9743

Adgang til dokumentet

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

The Input Output Complexity of Sparse Matrix MultiplicationAccepteret manuskript, 205 KB

Citationsformater

@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. Bind 8737 Springer, 2015. s. 750-761 (Lecture Notes in Computer Science).

Publikation: Konference artikel i Proceeding eller bog/rapport kapitel › Konferencebidrag i proceedings › Forskning › peer review