Shmuel Winograd

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

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Awards

ACM Fellow

ACM Fellow 1994, "".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

1994
Preface.
IBM J. Res. Dev., 1994

1992
Fast algorithms for the discrete cosine transform.
IEEE Trans. Signal Process., 1992

On the multiplicative complexity of discrete cosine transforms.
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>.
Theor. Comput. Sci., 1991

1990
Matrix Multiplication via Arithmetic Progressions.
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.
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.
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
J. ACM, July, 1985

Computing the ambiguity surface.
IEEE Trans. Acoust. Speech Signal Process., 1985

1983
On the Complexity of Multiplication in Finite Fields.
Theor. Comput. Sci., 1983

1982
On the Asymptotic Complexity of Matrix Multiplication.
SIAM J. Comput., 1982

1981
Algebraic constructions for algorithms (Extended Abstract).
Proceedings of the Symposium on Symbolic and Algebraic Manipulation, 1981

On the use of filter design programs for generating spectral windows.
Proceedings of the IEEE International Conference on Acoustics, 1981

On the Direct Sum Conjecture (Extended Summary)
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

On the Asymptotic Complexity of Matrix Multiplication (Extended Summary)
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1980
On Multiplication of Polynomials Modulo a Polynomial.
SIAM J. Comput., 1980

Signal processing and complexity of computation.
Proceedings of the IEEE International Conference on Acoustics, 1980

A limited range discrete Fourier transform algorithm.
Proceedings of the IEEE International Conference on Acoustics, 1980

1979
On Multiplication in Algebraic Extension Fields.
Theor. Comput. Sci., 1979

1978
TDM-FDM Conversion Requiring Reduced Computation Complexity.
IEEE Trans. Commun., 1978

Complexity Of Computations.
Proceedings of the Proceedings 1978 ACM Annual Conference, 1978

1977
A new approach to error-correcting codes.
IEEE Trans. Inf. Theory, 1977

Some Bilinear Forms Whose Multiplicative Complexity Depends on the Field of Constants.
Math. Syst. Theory, 1977

1975
On the Parallel Evaluation of Certain Arithmetic Expressions.
J. ACM, 1975

The Effect of the Field of Constants on the Number of Multiplication
Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975

1972
Parallel Iteration Methods.
Proceedings of a symposium on the Complexity of Computer Computations, 1972

1968
A New Algorithm for Inner Product.
IEEE Trans. Computers, 1968

The number of multiplications involved in computing certain functions.
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.
J. ACM, 1967

The Organization of Computations for Uniform Recurrence Equations.
J. ACM, 1967

1966
Continuity and Realizability of Sequence Transformations.
IEEE Trans. Electron. Comput., 1966

Index Register Allocation.
J. ACM, 1966

1965
On the Time Required to Perform Addition.
J. ACM, 1965

1964
On the Number of Transitions Entering the States of a Finite Automaton.
IEEE Trans. Electron. Comput., 1964

Input-Error-Limiting Automata.
J. ACM, 1964

1963
Redundancy and Complexity of Logical Elements
Inf. Control., September, 1963

1962
Coding for Logical Operations.
IBM J. Res. Dev., 1962

Multiple Input-Output Links in Computer Systems.
IBM J. Res. Dev., 1962

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


  Loading...