Shmuel Winograd

发表

Richard M. Karp, Raymond E. Miller, Lawrence Paul Horwitz, 1966, JACM.

The number of multiplications involved in computing certain functions

Shmuel Winograd, 1968, IFIP Congress.

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]/

Amir Averbuch, Zvi Galil, Shmuel Winograd, 1991, Theor. Comput. Sci..

On the Time Required to Perform Addition

Shmuel Winograd, S. Winograd, 1965, JACM.

On the Time Required to Perform Multiplication

Shmuel Winograd, S. Winograd, 1967, JACM.

Multiple Input-Output Links in Computer Systems

Shmuel Winograd, Burton B. Tasini, 1962, IBM J. Res. Dev..

On Multiplication in Algebraic Extension Fields

Shmuel Winograd, 1979, Theor. Comput. Sci..

On the Complexity of Multiplication in Finite Fields

Abraham Lempel, Gadiel Seroussi, Shmuel Winograd, 1983, Theor. Comput. Sci..

Complexity Of Computations

Shmuel Winograd, S. Winograd, 1978, ACM Annual Conference.

On the Asymptotic Complexity of Matrix Multiplication

Don Coppersmith, Shmuel Winograd, S. Winograd, 1982, SIAM J. Comput..

Preface: mathematics of numerical computation

Shmuel Winograd, 1972 .

On the time required to perform computer operations

Shmuel Winograd, 1968 .

Input-Error-Limiting Automata

Shmuel Winograd, 1964, JACM.

On the Parallel Evaluation of Certain Arithmetic Expressions

Shmuel Winograd, S. Winograd, 1975, JACM.

A New Algorithm for Inner Product

Shmuel Winograd, S. Winograd, 1968, IEEE Transactions on Computers.

On Multiplication of Polynomials Modulo a Polynomial

Shmuel Winograd, S. Winograd, 1980, SIAM J. Comput..

On the Direct Sum Conjecture (Extended Summary)

Ephraim Feig, Shmuel Winograd, 1981, FOCS.

On the Multiplicative Complexity of Discrete

Ephraim Feig, Shmuel Winograd, Cosine Transforms, 1992 .

The Organization of Computations for Uniform Recurrence Equations

Richard M. Karp, Raymond E. Miller, Shmuel Winograd, 1967, JACM.

On the Number of Transitions Entering the States of a Finite Automaton

Raymond E. Miller, Shmuel Winograd, S. Winograd, 1964, IEEE Trans. Electron. Comput..

On the use of filter design programs for generating spectral windows

Shmuel Winograd, James W. Cooley, S. Winograd, 1981, ICASSP.

Bounded-transient automata

Shmuel Winograd, 1962, SWCT.

Some bilinear forms whose multiplicative complexity depends on the field of constants

Shmuel Winograd, 2005, Mathematical systems theory.

Algebraic constructions for algorithms (Extended Abstract)

Shmuel Winograd, 1981, SYMSAC '81.

Computing the ambiguity surface

Shmuel Winograd, Richard Tolimieri, 1985, IEEE Trans. Acoust. Speech Signal Process..

Classification of all the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a Polynomial

Amir Averbuch, Zvi Galil, Shmuel Winograd, 1986, ICALP.

Continuity and Realizability of Sequence Transformations

Shmuel Winograd, Leo Hellerman, William L. Duda, 1966, IEEE Trans. Electron. Comput..

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, 1988, Theor. Comput. Sci..

On computing the Discrete Fourier Transform.

Shmuel Winograd, S. Winograd, 1976, Proceedings of the National Academy of Sciences of the United States of America.

Parallel Iteration Methods

Shmuel Winograd, 1972, Complexity of Computer Computations.

Signal processing and complexity of computation

Shmuel Winograd, S. Winograd, 1980, ICASSP.

On computing the Discrete Fourier Transform.

Shmuel Winograd, 1976 .

Matrix multiplication via arithmetic progressions

Don Coppersmith, Shmuel Winograd, S. Winograd, 1987, STOC.

Matrix multiplication via arithmetic progressions

Don Coppersmith, Shmuel Winograd, S. Winograd, 1987, STOC.

Fast algorithms for the discrete cosine transform

Ephraim Feig, Shmuel Winograd, S. Winograd, 1992, IEEE Trans. Signal Process..

Redundancy and Complexity of Logical Elements

Shmuel Winograd, 1963, Inf. Control..

A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels

Albert G. Greenberg, Shmuel Winograd, S. Winograd, 1985, JACM.

Coding for Logical Operations

Shmuel Winograd, S. Winograd, 1962, IBM J. Res. Dev..

How Fast can Computers Add

Shmuel Winograd, S. Winograd, 1968 .

On multiplication of 2 × 2 matrices

Shmuel Winograd, S. Winograd, 1971 .

Optimal iterative processes for root-finding

Richard P. Brent, Shmuel Winograd, Philip Wolfe, 1972 .

The multiplicative complexity of certain semilinear systems defined by Polynomials

Shmuel Winograd, L Auslander, 1980 .

Direct sums of bilinear algorithms

Shmuel Winograd, E. Feig, L Auslander, 1981 .

On the Asymptotic Complexity of Matrix Multiplication (Extended Summary)

Don Coppersmith, Shmuel Winograd, 1981, FOCS 1981.