Algebraic constructions for algorithms
- S. Winograd
- 1981
- SYMSAC 1981
Publications
44 results for S. Winograd
Direct sums of bilinear algorithms
- L. Auslander
- E. Feig
- et al.
- 1981
- Linear Algebra and Its Applications
The multiplicative complexity of certain semilinear systems defined by Polynomials
- L. Auslander
- S. Winograd
- 1980
- Advances in Applied Mathematics
On the multiplicative complexity of the Discrete Fourier Transform
- S Winograd
- 1979
- Advances in Mathematics
On multiplication in algebraic extension fields
- S. Winograd
- 1979
- Theoretical Computer Science
Complexity of computations
- Shmuel Winograd
- 1978
- ACM Annual Conference 1978
On computing the discrete fourier transform
- S. Winograd
- 1978
- Mathematics of Computation
A new method for computing DFT
- S. Winograd
- 1977
- ICASSP 1977
A New Approach to Error-Correcting Codes
- Abraham Lempel
- Shmuel Winograd
- 1977
- IEEE Trans. Inf. Theory
Some bilinear forms whose multiplicative complexity depends on the field of constants
- S. Winograd
- 1976
- Mathematical Systems Theory