The Mailman algorithm: a note on matrix-vector multiplication
type: Item
instance of: scholarly article
title: The Mailman algorithm: a note on matrix-vector multiplication
zbMATH Open document ID: 1191.68832
author: Edo Liberty
author: Steven W. Zucker
published in: Information Processing Letters
publication date: 2010-06-16T00:00:00Z
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 5721967
zbMATH Keywords: algorithms
zbMATH Keywords: matrix-vector multiplication
zbMATH Keywords: Mailman algorithm
zbMATH Keywords: random projections
describes a project that uses: BLAS
MaRDI profile type: Publication
full work available at URL: j.ipl.2008.09.028
OpenAlex ID: W1973089001
cites work: Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
cites work: Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
cites work: Q3579390
cites work: On the Number of Multiplications Required for Matrix Multiplication
cites work: An extended set of FORTRAN basic linear algebra subprograms
cites work: Extensions of Lipschitz mappings into a Hilbert space
cites work: Basic Linear Algebra Subprograms for Fortran Usage
cites work: Extending the four Russians' bound to general matrix multiplication
cites work: An improved algorithm for Boolean matrix multiplication
cites work: An Algorithm for the Computation of Linear Forms
cites work: Gaussian elimination is not optimal
cites work: Q5616735
cites work: Q2934692
cites work: On the number of multiplications necessary to compute certain functions
DOI: 10.1016/J.IPL.2008.09.028
description: scientific article; zbMATH DE number 5721967