The Mailman algorithm: A note on matrix–vector multiplication
Authors:
- Edo LibertyELEdo Liberty
- Steven W. ZuckerSZSteven W. Zucker
- 1 January 2009
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 109 (3) , 179-182
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Database-friendly random projections: Johnson-Lindenstrauss with binary coinsJournal of Computer and System Sciences, 2003
- An extended set of FORTRAN basic linear algebra subprogramsACM Transactions on Mathematical Software, 1988
- An improved algorithm for Boolean matrix multiplicationComputing, 1986
- Extensions of Lipschitz mappings into a Hilbert space1984
- Extending the four Russians' bound to general matrix multiplicationInformation Processing Letters, 1980
- Basic Linear Algebra Subprograms for Fortran UsageACM Transactions on Mathematical Software, 1979
- On the Number of Multiplications Required for Matrix MultiplicationSIAM Journal on Computing, 1976
- An Algorithm for the Computation of Linear FormsSIAM Journal on Computing, 1974
- On the number of multiplications necessary to compute certain functionsCommunications on Pure and Applied Mathematics, 1970
- Gaussian elimination is not optimalNumerische Mathematik, 1969