Shmuel Winograd

According to our database, Shmuel Winograd authored at least 39 papers between 1962 and 1994.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

1994

Preface.

Shmuel Winograd, Alan J. Hoffman

IBM J. Res. Dev., 1994

1992

Fast algorithms for the discrete cosine transform.

Ephraim Feig, Shmuel Winograd

IEEE Trans. Signal Process., 1992

On the multiplicative complexity of discrete cosine transforms.

Ephraim Feig, Shmuel Winograd

IEEE Trans. Inf. Theory, 1992

1991

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

1990

Matrix Multiplication via Arithmetic Progressions.

Don Coppersmith, Shmuel Winograd

J. Symb. Comput., 1990

1988

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

1986

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

Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

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, July, 1985

Computing the ambiguity surface.

Richard Tolimieri, Shmuel Winograd

IEEE Trans. Acoust. Speech Signal Process., 1985

1983

On the Complexity of Multiplication in Finite Fields.

Abraham Lempel, Gadiel Seroussi, Shmuel Winograd

Theor. Comput. Sci., 1983

1982

On the Asymptotic Complexity of Matrix Multiplication.

Don Coppersmith, Shmuel Winograd

SIAM J. Comput., 1982

1981

Algebraic constructions for algorithms (Extended Abstract).

Shmuel Winograd

Proceedings of the Symposium on Symbolic and Algebraic Manipulation, 1981

On the use of filter design programs for generating spectral windows.

James W. Cooley, Shmuel Winograd

Proceedings of the IEEE International Conference on Acoustics, 1981

On the Direct Sum Conjecture (Extended Summary)

Ephraim Feig, Shmuel Winograd

Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

On the Asymptotic Complexity of Matrix Multiplication (Extended Summary)

Don Coppersmith, Shmuel Winograd

Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1980

On Multiplication of Polynomials Modulo a Polynomial.

Shmuel Winograd

SIAM J. Comput., 1980

Signal processing and complexity of computation.

Shmuel Winograd

Proceedings of the IEEE International Conference on Acoustics, 1980

A limited range discrete Fourier transform algorithm.

James W. Cooley, Shmuel Winograd

Proceedings of the IEEE International Conference on Acoustics, 1980

1979

On Multiplication in Algebraic Extension Fields.

Shmuel Winograd

Theor. Comput. Sci., 1979

1978

TDM-FDM Conversion Requiring Reduced Computation Complexity.

Abraham Peled, Shmuel Winograd

IEEE Trans. Commun., 1978

Complexity Of Computations.

Shmuel Winograd

Proceedings of the Proceedings 1978 ACM Annual Conference, 1978

1977

A new approach to error-correcting codes.

Abraham Lempel, Shmuel Winograd

IEEE Trans. Inf. Theory, 1977

Some Bilinear Forms Whose Multiplicative Complexity Depends on the Field of Constants.

Shmuel Winograd

Math. Syst. Theory, 1977

1975

On the Parallel Evaluation of Certain Arithmetic Expressions.

Shmuel Winograd

J. ACM, 1975

The Effect of the Field of Constants on the Number of Multiplication

Shmuel Winograd

Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975

1972

Parallel Iteration Methods.

Shmuel Winograd

Proceedings of a symposium on the Complexity of Computer Computations, 1972

1968

A New Algorithm for Inner Product.

Shmuel Winograd

IEEE Trans. Computers, 1968

The number of multiplications involved in computing certain functions.

Shmuel Winograd

Proceedings of the Information Processing, Proceedings of IFIP Congress 1968, Edinburgh, UK, 5-10 August 1968, Volume 1, 1968

1967

On the Time Required to Perform Multiplication.

Shmuel Winograd

J. ACM, 1967

The Organization of Computations for Uniform Recurrence Equations.

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

J. ACM, 1967

1966

Continuity and Realizability of Sequence Transformations.

Leo Hellerman, William L. Duda, Shmuel Winograd

IEEE Trans. Electron. Comput., 1966

Index Register Allocation.

Lawrence Paul Horwitz, Richard M. Karp, Raymond E. Miller, Shmuel Winograd

J. ACM, 1966

1965

On the Time Required to Perform Addition.

Shmuel Winograd

J. ACM, 1965

1964

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

Raymond E. Miller, Shmuel Winograd

IEEE Trans. Electron. Comput., 1964

Input-Error-Limiting Automata.

Shmuel Winograd

J. ACM, 1964

1963

Redundancy and Complexity of Logical Elements

Shmuel Winograd

Inf. Control., September, 1963

1962

Coding for Logical Operations.

Shmuel Winograd

IBM J. Res. Dev., 1962

Multiple Input-Output Links in Computer Systems.

Burton B. Tasini, Shmuel Winograd

IBM J. Res. Dev., 1962

Bounded-transient automata

Shmuel Winograd

Proceedings of the 3rd Annual Symposium on Switching Circuit Theory and Logical Design, 1962