On the number of multiplications necessary to compute certain functions
- Shmuel Winograd
- 2006
- Communications on Pure and Applied Mathematics
Publications
This is our catalog of publications authored by IBM researchers, in collaboration with the global research community. It’s an ever-growing body of work that shows why IBM is one of the most important contributors to modern computing.
Date
Featured collections
Popular topics
44 results for S. Winograd
Fast evaluation of polynomials by rational preparation
- Michael O. Rabin
- Shmuel Winograd
- 2006
- Communications on Pure and Applied Mathematics
On-The-Fly Error Correction in Data Storage Channels
- Martin Hassner
- Uwe Schwiegelshohn
- et al.
- 1995
- IEEE Transactions on Magnetics
Fast Algorithms for the Discrete Cosine Transform
- Ephraim Feig
- Shmuel Winograd
- 1992
- IEEE TSP
Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. Part II: The algebra G[u]/〈un〉
- Amir Averbuch
- Zvi Galil
- et al.
- 1991
- Theoretical Computer Science
Matrix multiplication via arithmetic progressions
- Don Coppersmith
- Shmuel Winograd
- 1990
- Journal of Symbolic Computation
Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial, part I: The algebra G[u] <Q(u)l>, l>1
- Amir Averbuch
- Zvi Galil
- et al.
- 1988
- Theoretical Computer Science
Computing the Ambiguity Surface
- Richard Tolimieri
- Shmuel Winograd
- 1985
- IEEE Transactions on Acoustics, Speech, and Signal Processing
The multiplicative complexity of the Discrete Fourier Transform
- L Auslander
- E Feig
- et al.
- 1984
- Advances in Applied Mathematics
On the direct sum conjecture
- Ephraim Feig
- Shmuel Winograd
- 1984
- Linear Algebra and Its Applications