Shmuel Winograd | Academic Influence

Shmuel Winograd's AcademicInfluence.com Rankings

Shmuel Winograd

Computer Science

#388

World Rank

#403

Historical Rank

#219

USA Rank

Numerical Analysis

#10

World Rank

#11

Historical Rank

#8

USA Rank

computer-science Degrees

Shmuel Winograd

Mathematics

#1824

World Rank

#2911

Historical Rank

#739

USA Rank

Measure Theory

#1711

World Rank

#2104

Historical Rank

#555

USA Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Shmuel Winograd's Degrees

PhD Computer Science Stanford University

Similar Degrees You Can Earn

Best Online PhD of Computer Science (Doctorates) 2025

Why Is Shmuel Winograd Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Shmuel Winograd was an Israeli-American computer scientist, noted for his contributions to computational complexity. He has proved several major results regarding the computational aspects of arithmetic; his contributions include the Coppersmith–Winograd algorithm and an algorithm for the fast Fourier transform which transforms it into a problem of computing convolutions which can be solved with another Winograd's algorithm.

(See a Problem?)

Shmuel Winograd's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Matrix multiplication via arithmetic progressions (1987) (2902)
On computing the Discrete Fourier Transform. (1976) (812)
The Organization of Computations for Uniform Recurrence Equations (1967) (640)
Arithmetic complexity of computations (1980) (465)
Fast algorithms for the discrete cosine transform (1992) (452)
On the asymptotic complexity of matrix multiplication (1981) (251)
On multiplication of 2 × 2 matrices (1971) (219)
On the number of multiplications necessary to compute certain functions (1970) (154)
A New Algorithm for Inner Product (1968) (140)
Complexity Of Computations (1978) (132)
On the Time Required to Perform Addition (1965) (129)
A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels (1985) (125)
Reliable Computation in the Presence of Noise (1963) (115)
The optimal recovery of smooth functions (1976) (89)
On the Time Required to Perform Multiplication (1967) (80)
Index Register Allocation (1966) (79)
Disks, balls, and walls: analysis of a combinatorial game (1989) (70)
A new approach to error-correcting codes (1977) (68)
On the multiplicative complexity of discrete cosine transforms (1992) (65)
On the multiplicative complexity of the Discrete Fourier Transform (1979) (59)
On Multiplication in Algebraic Extension Fields (1979) (59)
On the Complexity of Multiplication in Finite Fields (1983) (56)
Some bilinear forms whose multiplicative complexity depends on the field of constants (1976) (54)
Input-Error-Limiting Automata (1964) (44)
On the number of multiplications required to compute certain functions. (1967) (44)
The Relationship of Timing and Vision to Baseball Performance (1942) (37)
Abelian semi-simple algebras and algorithms for the Discrete Fourier Transform (1984) (37)
New algorithms for the multidimensional discrete Fourier transform (1983) (35)
Fast evaluation of polynomials by rational preparation (1972) (34)
Computing the ambiguity surface (1985) (33)
Optimal iterative processes for root-finding (1972) (31)
On the Parallel Evaluation of Certain Arithmetic Expressions (1975) (27)
A new method for computing DFT (1977) (22)
On Multiplication of Polynomials Modulo a Polynomial (1980) (21)
Finding all shortest distances in a directed network (1972) (19)
Signal processing and complexity of computation (1980) (19)
ON THE ALGEBRAIC COMPLEXITY OF FUNCTIONS (1970) (19)
The multiplicative complexity of certain semilinear systems defined by Polynomials (1980) (18)
TDM-FDM Conversion Requiring Reduced Computation Complexity (1978) (16)
The multiplicative complexity of the Discrete Fourier Transform (1984) (16)
Hecke's theorem in quadratic reciprocity, finite nilpotent groups and the cooley-tukey algorithm (1982) (16)
The effect of the field of constants on the number of multiplications (1975) (16)
Coding for Logical Operations (1962) (14)
Redundancy and Complexity of Logical Elements (1963) (11)
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 (1988) (10)
A limited range discrete Fourier transform algorithm (1980) (8)
Direct sums of bilinear algorithms (1981) (8)
Classification of all the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a Polynomial (1986) (8)
On the Asymptotic Complexity of Matrix Multiplication (Extended Summary) (1981) (7)
Bounded-transient automata (1962) (7)
Parallel Iteration Methods (1972) (7)
How Fast can Computers Add (1968) (6)
Error Diffusion on Acute Simplices: Geometry of invariant sets (2015) (6)
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]/ (1991) (6)
On the algebraic complexity of inner product (1971) (4)
On the use of filter design programs for generating spectral windows (1981) (4)
Continuity and Realizability of Sequence Transformations (1966) (4)
On the time required to perform computer operations (1968) (4)
Application of Complexity of Computations to Signal Processing (1981) (3)
On the Speed Gained in Parallel Methods (1975) (3)
The number of multiplications involved in computing certain functions (1968) (3)
Error diffusion on acute simplices: invariant tiles (2017) (3)
On the Number of Transitions Entering the States of a Finite Automaton (1964) (3)
Multiple Input-Output Links in Computer Systems (1962) (2)
SOME REMARKS ON PROOF TECHNIQUES IN ANALYTIC COMPLEXITY (1976) (2)
2. Three Examples (1980) (1)
Algebraic constructions for algorithms (Extended Abstract) (1981) (1)
Error diffusion on simplices: The structure of bounded invariant tiles (2017) (1)
ON THE RATE OF CONVERGENCE OF LOCAL ITERATIVE SCHEMES (1971) (1)
5. FIR Filters (1980) (1)
Error diffusion on acute simplices: invariant tiles (2017) (0)
Preface (1994) (0)
Quantitative Assessments of the Physical and Mathematical Sciences: A Summary of the Lessons Learned: Mathematical Sciences Assessment Panel, Commission on Physical Sciences, Mathematics, and Applications, National Research Council (1994) (0)
3. General Background (1980) (0)
On the Multiplicative Complexity of Discrete (1992) (0)
Symbol detection with maximum likelihood for RLL coded data. (1996) (0)
6. Product of Polynomials Modulo a Polynomial (1980) (0)
4. Product of Polynomials (1980) (0)
Method for solving key equation for linear algebraic code decoding (1991) (0)
7. Cyclic Convolution and Discrete Fourier Transform (1980) (0)
On computing the Discrete Fourier Transform (algorithm/computational complexity) (2016) (0)
On the Direct Sum Conjecture (Extended Summary) (1981) (0)
A generalization of a theorem of Boolean relation matrices (1977) (0)
On the rate of convergence to the neutral attractor of a family of one-dimensional maps (2009) (0)
Preface: mathematics of numerical computation (1972) (0)

This paper list is powered by the following services:

Other Resources About Shmuel Winograd

en.wikipedia.org

What Schools Are Affiliated With Shmuel Winograd?

Shmuel Winograd is affiliated with the following schools: