Shmuel Winograd

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