Bounded-transient automata - Shmuel Winograd (SWCT, 1962)

Multiple Input-Output Links in Computer Systems. - Burton B. Tasini; Shmuel Winograd (IBM J. Res. Dev., 1962)

Coding for Logical Operations. - Shmuel Winograd (IBM J. Res. Dev., 1962)

Redundancy and Complexity of Logical Elements - Shmuel Winograd (Inf. Control., 1963)

Input-Error-Limiting Automata. - Shmuel Winograd (J. ACM, 1964)

On the Number of Transitions Entering the States of a Finite Automaton. - Raymond E. Miller; Shmuel Winograd (IEEE Trans. Electron. Comput., 1964)

On the Time Required to Perform Addition. - Shmuel Winograd (J. ACM, 1965)

Index Register Allocation. - Lawrence Paul Horwitz; Richard M. Karp; Raymond E. Miller; Shmuel Winograd (J. ACM, 1966)

Continuity and Realizability of Sequence Transformations. - Leo Hellerman; William L. Duda; Shmuel Winograd (IEEE Trans. Electron. Comput., 1966)

The Organization of Computations for Uniform Recurrence Equations. - Richard M. Karp; Raymond E. Miller; Shmuel Winograd (J. ACM, 1967)

On the Time Required to Perform Multiplication. - Shmuel Winograd (J. ACM, 1967)

The number of multiplications involved in computing certain functions. - Shmuel Winograd (IFIP Congress (1), 1968)

A New Algorithm for Inner Product. - Shmuel Winograd (IEEE Trans. Computers, 1968)

Parallel Iteration Methods. - Shmuel Winograd (Complexity of Computer Computations, 1972)

The Effect of the Field of Constants on the Number of Multiplication - Shmuel Winograd (FOCS, 1975)

On the Parallel Evaluation of Certain Arithmetic Expressions. - Shmuel Winograd (J. ACM, 1975)

Some Bilinear Forms Whose Multiplicative Complexity Depends on the Field of Constants. - Shmuel Winograd (Math. Syst. Theory, 1977)

A new approach to error-correcting codes. - Abraham Lempel; Shmuel Winograd (IEEE Trans. Inf. Theory, 1977)

Complexity Of Computations. - Shmuel Winograd (ACM Annual Conference (1), 1978)

TDM-FDM Conversion Requiring Reduced Computation Complexity. - Abraham Peled; Shmuel Winograd (IEEE Trans. Commun., 1978)

On Multiplication in Algebraic Extension Fields. - Shmuel Winograd (Theor. Comput. Sci., 1979)

A limited range discrete Fourier transform algorithm. - James W. Cooley; Shmuel Winograd (ICASSP, 1980)

Signal processing and complexity of computation. - Shmuel Winograd (ICASSP, 1980)

On Multiplication of Polynomials Modulo a Polynomial. - Shmuel Winograd (SIAM J. Comput., 1980)

On the Asymptotic Complexity of Matrix Multiplication (Extended Summary) - Don Coppersmith; Shmuel Winograd (FOCS, 1981)

On the Direct Sum Conjecture (Extended Summary) - Ephraim Feig; Shmuel Winograd (FOCS, 1981)

On the use of filter design programs for generating spectral windows. - James W. Cooley; Shmuel Winograd (ICASSP, 1981)

Algebraic constructions for algorithms (Extended Abstract). - Shmuel Winograd (SYMSACC, 1981)

On the Asymptotic Complexity of Matrix Multiplication. - Don Coppersmith; Shmuel Winograd (SIAM J. Comput., 1982)

On the Complexity of Multiplication in Finite Fields. - Abraham Lempel; Gadiel Seroussi; Shmuel Winograd (Theor. Comput. Sci., 1983)

Computing the ambiguity surface. - Richard Tolimieri; Shmuel Winograd (IEEE Trans. Acoust. Speech Signal Process., 1985)

A Lower Bound on the Time Needed in the Worst Case to Resolve Conflicts Deterministically in Multiple Access Channels - Albert G. Greenberg; Shmuel Winograd (J. ACM, 1985)

Classification of all the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a Polynomial. - Amir Averbuch; Shmuel Winograd; Zvi Galil (ICALP, 1986)

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] / < Q(u)^l >, l > 1. - Amir Averbuch; Zvi Galil; Shmuel Winograd (Theor. Comput. Sci., 1988)

Matrix Multiplication via Arithmetic Progressions. - Don Coppersmith; Shmuel Winograd (J. Symb. Comput., 1990)

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]/<u^n>. - Amir Averbuch; Zvi Galil; Shmuel Winograd (Theor. Comput. Sci., 1991)

On the multiplicative complexity of discrete cosine transforms. - Ephraim Feig; Shmuel Winograd (IEEE Trans. Inf. Theory, 1992)

Fast algorithms for the discrete cosine transform. - Ephraim Feig; Shmuel Winograd (IEEE Trans. Signal Process., 1992)

Preface. - Shmuel Winograd; Alan J. Hoffman (IBM J. Res. Dev., 1994)