The Mailman algorithm: A note on matrix-vector multiplication

Information Processing Letters

Volumn 109, Issue 3, 2009, Pages 179-182

  Liberty, Edo ^a   Zucker, Steven W ^b  

^a Yale University   (United States)

^b YALE UNIVERSITY   (United States)

Author keywords

Algorithms; Mailman algorithm; Matrix vector multiplication; Random projections

Indexed keywords

ASYMPTOTICALLY OPTIMAL; DETERMINISTIC COMPUTATIONS; DIMENSIONALITY REDUCTIONS; FINITE FIELDS; LOG FACTORS; MAILMAN ALGORITHM; MATRIX-VECTOR MULTIPLICATION; N MATRIXES; RANDOM PROJECTIONS; REAL VECTORS; RUNNING TIMES; VECTOR MULTIPLICATIONS;

VECTORS;

EID: 57349122366     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2008.09.028     Document Type: Article

References (15)

1. Achlioptas D. Database-friendly random projections: Johnson-Lindenstrauss with binary coins. J. Comput. Syst. Sci. 66 4 (2003) 671-687
2. N. Ailon, B. Chazelle, Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform, in: Proceedings of the 38st Annual Symposium on the Theory of Computing (STOC), Seattle, WA, 2006, pp. 557-563
3. Ailon N., and Liberty E. Fast dimension reduction using Rademacher series on dual BCH codes. SODA '08: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA (2008), Society for Industrial and Applied Mathematics, Philadelphia, PA, USA 1-9
4. Brockett R.W., and Dobkin D.P. On the number of multiplications required for matrix multiplication. SIAM J. Comput. 5 4 (1976) 624-628
5. Coppersmith D., and Winograd S. Matrix multiplication via arithmetic progressions. STOC '87: Proceedings of the Nineteenth Annual ACM Conference on Theory of Computing (1987), ACM, New York, NY, USA 1-6
6. Dongarra J.J., Du Croz J., Hammarling S., and Hanson R.J. An extended set of Fortran basic linear algebra subprograms. ACM Trans. Math. Software 14 1 (1988) 1-17
7. Johnson W.B., and Lindenstrauss J. Extensions of Lipschitz mappings into a Hilbert space. Contemp. Math. 26 (1984) 189-206
8. Lawson C.L., Hanson R.J., Kincaid D.R., and Krogh F.T. Basic linear algebra subprograms for Fortran usage. ACM Trans. Math. Software 5 3 (1979) 308-323
9. Santoro N. Extending the four Russians' bound to general matrix multiplication. Inform. Process. Lett. 10 2 (1980) 87-88
10. Santoro N., and Urrutia J. An improved algorithm for boolean matrix multiplication. Computing 36 4 (1986) 375-382
11. Savage J.E. An algorithm for the computation of linear forms. SIAM J. Comput. 3 2 (1974) 150-158
12. Strassen V. Gaussian elimination is not optimal. Numer. Math. 13 4 (1969) 354-356
13. Kronrod M.A., Arlazarov V.L., Dinic E.A., and Faradzev I.A. On economic construction of the transitive closure of a direct graph. Soviet Math. Dokl. (11) (1970) 1209-1210
14. Williams R. Matrix-vector multiplication in sub-quadratic time: (some preprocessing required). SODA '07: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (2007), Society for Industrial and Applied Mathematics, Philadelphia, PA, USA 995-1001
15. Winograd S. On the number of multiplications necessary to compute certain functions. Comm. Pure Appl. Math. 2 (1970) 165-179