Lower bounds for sparse matrix vector multiplication on hypercubic networks.

Manzini, Giovanni

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] (1998)

  • Volume: 2, Issue: 1, page 35-47
  • ISSN: 1365-8050

How to cite

top

Manzini, Giovanni. "Lower bounds for sparse matrix vector multiplication on hypercubic networks.." Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] 2.1 (1998): 35-47. <http://eudml.org/doc/120589>.

@article{Manzini1998,
author = {Manzini, Giovanni},
journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
keywords = {pseudo expanders; bisection width lower bounds},
language = {eng},
number = {1},
pages = {35-47},
publisher = {Maison de l'Informatique et des Mathématiques Discrètes, MIMD},
title = {Lower bounds for sparse matrix vector multiplication on hypercubic networks.},
url = {http://eudml.org/doc/120589},
volume = {2},
year = {1998},
}

TY - JOUR
AU - Manzini, Giovanni
TI - Lower bounds for sparse matrix vector multiplication on hypercubic networks.
JO - Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
PY - 1998
PB - Maison de l'Informatique et des Mathématiques Discrètes, MIMD
VL - 2
IS - 1
SP - 35
EP - 47
LA - eng
KW - pseudo expanders; bisection width lower bounds
UR - http://eudml.org/doc/120589
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.