Person:915377

Available identifiers

zbMath Open winograd.shmuelDBLPw/ShmuelWinogradWikidataQ93070 ScholiaQ93070MaRDI QIDQ915377

List of research outcomes

Publication	Date of Publication	Type
Parallel Iteration Methods	2021-07-06	Paper
On the rate of convergence to the neutral attractor of a family of one-dimensional maps	2010-04-09	Paper
Fast algorithms for the discrete cosine transform	1993-04-01	Paper
On the multiplicative complexity of discrete cosine transforms	1992-10-11	Paper
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\)]	1992-06-26	Paper
Matrix multiplication via arithmetic progressions	1990-01-01	Paper
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\)]	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3776615	1986-01-01	Paper
A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels	1985-01-01	Paper
On the direct sum conjecture	1984-01-01	Paper
Abelian semi-simple algebras and algorithms for the discrete Fourier transform	1984-01-01	Paper
The multiplicative complexity of the discrete Fourier transform	1984-01-01	Paper
On the complexity of multiplication in finite fields	1983-01-01	Paper
New algorithms for the multidimensional discrete Fourier transform	1983-01-01	Paper
Hecke's theorem in quadratic reciprocity, finite nilpotent groups and the Cooley-Tukey algorithm	1982-01-01	Paper
On the Asymptotic Complexity of Matrix Multiplication	1982-01-01	Paper
Direct sums of bilinear algorithms	1981-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3309061	1981-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3933738	1981-01-01	Paper
The multiplicative complexity of certain semilinear systems defined by polynomials	1980-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3883493	1980-01-01	Paper
On Multiplication of Polynomials Modulo a Polynomial	1980-01-01	Paper
On multiplication in algebraic extension fields	1979-01-01	Paper
On the multiplicative complexity of the discrete Fourier transform	1979-01-01	Paper
On Computing the Discrete Fourier Transform	1978-01-01	Paper
A new approach to error-correcting codes	1977-01-01	Paper
Some bilinear forms whose multiplicative complexity depends on the field of constants	1977-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4139625	1977-01-01	Paper
A generalization of a theorem of Boolean relation matrices	1977-01-01	Paper
The optimal recovery of smooth functions	1976-01-01	Paper
On computing the Discrete Fourier Transform	1976-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4110539	1976-01-01	Paper
On the Parallel Evaluation of Certain Arithmetic Expressions	1975-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4044055	1974-01-01	Paper
Optimal iterative processes for root-finding	1973-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5180764	1973-01-01	Paper
Finding All Shortest Distances in a Directed Network	1972-01-01	Paper
Fast evaluation of polynomials by rational preparation	1972-01-01	Paper
On the algebraic complexity of inner product	1971-01-01	Paper
On multiplication of 2 \(\times\) 2 matrices	1971-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4401564	1971-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5653553	1971-01-01	Paper
On the number of multiplications necessary to compute certain functions	1970-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4775468	1969-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5588147	1969-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5560016	1968-01-01	Paper
A New Algorithm for Inner Product	1968-01-01	Paper
On the Time Required to Perform Multiplication	1967-01-01	Paper
The Organization of Computations for Uniform Recurrence Equations	1967-01-01	Paper
ON THE NUMBER OF MULTIPLICATIONS REQUIRED TO COMPUTE CERTAIN FUNCTIONS	1967-01-01	Paper
On the Time Required to Perform Multiplication	1967-01-01	Paper
Index Register Allocation	1966-01-01	Paper
On the Time Required to Perform Addition	1965-01-01	Paper
On the Time Required to Perform Addition	1965-01-01	Paper
Input-Error-Limiting Automata	1964-01-01	Paper
A FORTRAN Extension to Facilitate Proposal Preparation	1964-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5601830	1963-01-01	Paper
Redundancy and complexity of logical elements	1963-01-01	Paper
Multiple Input-Output Links in Computer Systems	1962-01-01	Paper
Coding for Logical Operations	1962-01-01	Paper

Research outcomes over time

This page was built for person: Shmuel Winograd