Shmuel Winograd

Publication Activity (10 Years)

Years Active: 1962-1994
Publications (10 Years): 0

Publications

Shmuel Winograd, Alan J. Hoffman
Preface. IBM J. Res. Dev. 38 (3) (1994)
Ephraim Feig, Shmuel Winograd
Fast algorithms for the discrete cosine transform. IEEE Trans. Signal Process. 40 (9) (1992)
Ephraim Feig, Shmuel Winograd
On the multiplicative complexity of discrete cosine transforms. IEEE Trans. Inf. Theory 38 (4) (1992)
Amir Averbuch, Zvi Galil, Shmuel Winograd
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]/. Theor. Comput. Sci. 86 (2) (1991)
Don Coppersmith, Shmuel Winograd
Matrix Multiplication via Arithmetic Progressions. J. Symb. Comput. 9 (3) (1990)
Amir Averbuch, Zvi Galil, Shmuel Winograd
Classification of All the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a Polynomial, Part I: The Algeabra G[u] / , l > 1. Theor. Comput. Sci. 58 (1988)
Don Coppersmith, Shmuel Winograd
Matrix Multiplication via Arithmetic Progressions STOC (1987)
Amir Averbuch, Shmuel Winograd, Zvi Galil
Classification of all the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a Polynomial. ICALP (1986)
Albert G. Greenberg, Shmuel Winograd
A Lower Bound on the Time Needed in the Worst Case to Resolve Conflicts Deterministically in Multiple Access Channels J. ACM 32 (3) (1985)
Richard Tolimieri, Shmuel Winograd
Computing the ambiguity surface. IEEE Trans. Acoust. Speech Signal Process. 33 (5) (1985)
Abraham Lempel, Gadiel Seroussi, Shmuel Winograd
On the Complexity of Multiplication in Finite Fields. Theor. Comput. Sci. 22 (1983)
Don Coppersmith, Shmuel Winograd
On the Asymptotic Complexity of Matrix Multiplication. SIAM J. Comput. 11 (3) (1982)
Don Coppersmith, Shmuel Winograd
On the Asymptotic Complexity of Matrix Multiplication (Extended Summary) FOCS (1981)
Ephraim Feig, Shmuel Winograd
On the Direct Sum Conjecture (Extended Summary) FOCS (1981)
Shmuel Winograd
Algebraic constructions for algorithms (Extended Abstract). SYMSACC (1981)
James W. Cooley, Shmuel Winograd
On the use of filter design programs for generating spectral windows. ICASSP (1981)
Shmuel Winograd
Signal processing and complexity of computation. ICASSP (1980)
Shmuel Winograd
On Multiplication of Polynomials Modulo a Polynomial. SIAM J. Comput. 9 (2) (1980)
James W. Cooley, Shmuel Winograd
A limited range discrete Fourier transform algorithm. ICASSP (1980)
Shmuel Winograd
On Multiplication in Algebraic Extension Fields. Theor. Comput. Sci. 8 (1979)
Shmuel Winograd
Complexity Of Computations. ACM Annual Conference (1) (1978)
Abraham Peled, Shmuel Winograd
TDM-FDM Conversion Requiring Reduced Computation Complexity. IEEE Trans. Commun. 26 (5) (1978)
Abraham Lempel, Shmuel Winograd
A new approach to error-correcting codes. IEEE Trans. Inf. Theory 23 (4) (1977)
Shmuel Winograd
Some Bilinear Forms Whose Multiplicative Complexity Depends on the Field of Constants. Math. Syst. Theory 10 (1977)
Shmuel Winograd
On the Parallel Evaluation of Certain Arithmetic Expressions. J. ACM 22 (4) (1975)
Shmuel Winograd
The Effect of the Field of Constants on the Number of Multiplication FOCS (1975)
Shmuel Winograd
Parallel Iteration Methods. Complexity of Computer Computations (1972)
Shmuel Winograd
The number of multiplications involved in computing certain functions. IFIP Congress (1) (1968)
Shmuel Winograd
A New Algorithm for Inner Product. IEEE Trans. Computers 17 (7) (1968)
Shmuel Winograd
On the Time Required to Perform Multiplication. J. ACM 14 (4) (1967)
Richard M. Karp, Raymond E. Miller, Shmuel Winograd
The Organization of Computations for Uniform Recurrence Equations. J. ACM 14 (3) (1967)
Leo Hellerman, William L. Duda, Shmuel Winograd
Continuity and Realizability of Sequence Transformations. IEEE Trans. Electron. Comput. 15 (4) (1966)
Lawrence Paul Horwitz, Richard M. Karp, Raymond E. Miller, Shmuel Winograd
Index Register Allocation. J. ACM 13 (1) (1966)
Shmuel Winograd
On the Time Required to Perform Addition. J. ACM 12 (2) (1965)
Raymond E. Miller, Shmuel Winograd
On the Number of Transitions Entering the States of a Finite Automaton. IEEE Trans. Electron. Comput. 13 (4) (1964)
Shmuel Winograd
Input-Error-Limiting Automata. J. ACM 11 (3) (1964)
Shmuel Winograd
Redundancy and Complexity of Logical Elements Inf. Control. 6 (3) (1963)
Shmuel Winograd
Coding for Logical Operations. IBM J. Res. Dev. 6 (4) (1962)
Shmuel Winograd
Bounded-transient automata SWCT (1962)
Burton B. Tasini, Shmuel Winograd
Multiple Input-Output Links in Computer Systems. IBM J. Res. Dev. 6 (3) (1962)