Shmuel Winograd

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Parallel iteration methods
Complexity of Computer Computations
2021-07-06Paper
On the rate of convergence to the neutral attractor of a family of one-dimensional maps
Fundamenta Mathematicae
2010-04-09Paper
Fast algorithms for the discrete cosine transform
IEEE Transactions on Signal Processing
1993-04-01Paper
On the multiplicative complexity of discrete cosine transforms
IEEE Transactions on Information Theory
1992-10-11Paper
Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. II: The algebra \(G[u/\langle{} u^ n \rangle\)]
Theoretical Computer Science
1992-06-26Paper
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation
1990-01-01Paper
Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. I: The algebra \(G[u/<Q(u)^{\ell}>\), \(\ell >1\)]
Theoretical Computer Science
1988-01-01Paper
scientific article; zbMATH DE number 4037188 (Why is no real title available?)1986-01-01Paper
A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
Journal of the ACM
1985-01-01Paper
Abelian semi-simple algebras and algorithms for the discrete Fourier transform
Advances in Applied Mathematics
1984-01-01Paper
On the direct sum conjecture
Linear Algebra and its Applications
1984-01-01Paper
The multiplicative complexity of the discrete Fourier transform
Advances in Applied Mathematics
1984-01-01Paper
On the complexity of multiplication in finite fields
Theoretical Computer Science
1983-01-01Paper
New algorithms for the multidimensional discrete Fourier transform
IEEE Transactions on Acoustics, Speech, and Signal Processing
1983-01-01Paper
On the Asymptotic Complexity of Matrix Multiplication
SIAM Journal on Computing
1982-01-01Paper
Hecke's theorem in quadratic reciprocity, finite nilpotent groups and the Cooley-Tukey algorithm
Advances in Mathematics
1982-01-01Paper
scientific article; zbMATH DE number 3839315 (Why is no real title available?)1981-01-01Paper
Direct sums of bilinear algorithms
Linear Algebra and its Applications
1981-01-01Paper
scientific article; zbMATH DE number 3750286 (Why is no real title available?)1981-01-01Paper
scientific article; zbMATH DE number 3688713 (Why is no real title available?)1980-01-01Paper
The multiplicative complexity of certain semilinear systems defined by polynomials
Advances in Applied Mathematics
1980-01-01Paper
On Multiplication of Polynomials Modulo a Polynomial
SIAM Journal on Computing
1980-01-01Paper
On multiplication in algebraic extension fields
Theoretical Computer Science
1979-01-01Paper
On the multiplicative complexity of the discrete Fourier transform
Advances in Mathematics
1979-01-01Paper
On Computing the Discrete Fourier Transform1978-01-01Paper
A new approach to error-correcting codes
IEEE Transactions on Information Theory
1977-01-01Paper
Some bilinear forms whose multiplicative complexity depends on the field of constants
Mathematical Systems Theory
1977-01-01Paper
scientific article; zbMATH DE number 3567973 (Why is no real title available?)1977-01-01Paper
A generalization of a theorem of Boolean relation matrices1977-01-01Paper
The optimal recovery of smooth functions
Numerische Mathematik
1976-01-01Paper
On computing the Discrete Fourier Transform
Proceedings of the National Academy of Sciences
1976-01-01Paper
scientific article; zbMATH DE number 3533992 (Why is no real title available?)1976-01-01Paper
On the Parallel Evaluation of Certain Arithmetic Expressions
Journal of the ACM
1975-01-01Paper
scientific article; zbMATH DE number 3458112 (Why is no real title available?)1974-01-01Paper
Optimal iterative processes for root-finding
Numerische Mathematik
1973-01-01Paper
scientific article; zbMATH DE number 3430028 (Why is no real title available?)1973-01-01Paper
Fast evaluation of polynomials by rational preparation
Communications on Pure and Applied Mathematics
1972-01-01Paper
Finding All Shortest Distances in a Directed Network
IBM Journal of Research and Development
1972-01-01Paper
On multiplication of 2 \(\times\) 2 matrices
Linear Algebra and its Applications
1971-01-01Paper
scientific article; zbMATH DE number 3435075 (Why is no real title available?)1971-01-01Paper
On the algebraic complexity of inner product
Linear Algebra and its Applications
1971-01-01Paper
scientific article; zbMATH DE number 3383500 (Why is no real title available?)1971-01-01Paper
On the number of multiplications necessary to compute certain functions
Communications on Pure and Applied Mathematics
1970-01-01Paper
scientific article; zbMATH DE number 3451446 (Why is no real title available?)1969-01-01Paper
scientific article; zbMATH DE number 3307038 (Why is no real title available?)1969-01-01Paper
A New Algorithm for Inner Product
IEEE Transactions on Computers
1968-01-01Paper
scientific article; zbMATH DE number 3274466 (Why is no real title available?)1968-01-01Paper
The Organization of Computations for Uniform Recurrence Equations
Journal of the ACM
1967-01-01Paper
ON THE NUMBER OF MULTIPLICATIONS REQUIRED TO COMPUTE CERTAIN FUNCTIONS
Proceedings of the National Academy of Sciences
1967-01-01Paper
On the Time Required to Perform Multiplication
Journal of the ACM
1967-01-01Paper
On the Time Required to Perform Multiplication
Journal of the ACM
1967-01-01Paper
Index Register Allocation
Journal of the ACM
1966-01-01Paper
On the Time Required to Perform Addition
Journal of the ACM
1965-01-01Paper
On the Time Required to Perform Addition
Journal of the ACM
1965-01-01Paper
Input-Error-Limiting Automata
Journal of the ACM
1964-01-01Paper
A FORTRAN Extension to Facilitate Proposal Preparation
IEEE Transactions on Electronic Computers
1964-01-01Paper
scientific article; zbMATH DE number 3322507 (Why is no real title available?)1963-01-01Paper
Redundancy and complexity of logical elements
Information and Control
1963-01-01Paper
Multiple Input-Output Links in Computer Systems
IBM Journal of Research and Development
1962-01-01Paper
Coding for Logical Operations
IBM Journal of Research and Development
1962-01-01Paper


Research outcomes over time


This page was built for person: Shmuel Winograd