S. Winograd

8.0k total citations · 1 hit paper
64 papers, 5.0k citations indexed

About

S. Winograd is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Signal Processing. According to data from OpenAlex, S. Winograd has authored 64 papers receiving a total of 5.0k indexed citations (citations by other indexed papers that have themselves been cited), including 41 papers in Computational Theory and Mathematics, 29 papers in Artificial Intelligence and 19 papers in Signal Processing. Recurrent topics in S. Winograd's work include Digital Filter Design and Implementation (18 papers), Coding theory and cryptography (16 papers) and Numerical Methods and Algorithms (13 papers). S. Winograd is often cited by papers focused on Digital Filter Design and Implementation (18 papers), Coding theory and cryptography (16 papers) and Numerical Methods and Algorithms (13 papers). S. Winograd collaborates with scholars based in United States, Israel and Hungary. S. Winograd's co-authors include Don Coppersmith, Ephraim Feig, Raymond E. Miller, Richard M. Karp, R. W. Hamming, L. Auslander, A. Lempel, Richard Tolimieri, L. P. Horwitz and G. Seroussi and has published in prestigious journals such as Proceedings of the National Academy of Sciences, IEEE Transactions on Information Theory and IEEE Transactions on Signal Processing.

In The Last Decade

S. Winograd

61 papers receiving 4.4k citations

Hit Papers

Matrix multiplication via arithmetic progressions 1990 2026 2002 2014 1990 400 800 1.2k
What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

  1. Matrix multiplication via arithmetic progressions
    1990 1.3k citations S. Winograd et al. profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
S. Winograd United States 26 2.3k 1.5k 1.2k 953 922 64 5.0k
Don Coppersmith United States 36 2.2k 1.0× 2.4k 1.6× 298 0.2× 891 0.9× 891 1.0× 106 5.5k
H. T. Kung United States 39 1.8k 0.8× 1.5k 1.0× 933 0.8× 1.3k 1.4× 634 0.7× 171 7.6k
Robert J. Plemmons United States 36 1.8k 0.8× 750 0.5× 762 0.6× 454 0.5× 1.4k 1.5× 175 6.0k
Markus Püschel United States 35 1.1k 0.5× 1.3k 0.9× 1.1k 0.9× 1.1k 1.1× 757 0.8× 170 4.4k
Paul Van Dooren Belgium 46 3.1k 1.4× 905 0.6× 467 0.4× 903 0.9× 462 0.5× 320 9.5k
Shang‐Hua Teng United States 37 1.4k 0.6× 1.2k 0.8× 275 0.2× 525 0.6× 723 0.8× 154 4.9k
W. Kahan United States 22 1.7k 0.7× 493 0.3× 346 0.3× 426 0.4× 253 0.3× 55 3.6k
G.E. Whitesides United States 4 1.1k 0.5× 1.6k 1.1× 432 0.4× 540 0.6× 632 0.7× 8 4.3k
Ming Gu United States 33 1.6k 0.7× 1.1k 0.7× 335 0.3× 604 0.6× 690 0.7× 87 4.3k
Alan J. Laub United States 40 2.7k 1.2× 999 0.7× 268 0.2× 1.0k 1.1× 366 0.4× 154 9.1k

Countries citing papers authored by S. Winograd

Since Specialization
Citations

This map shows the geographic impact of S. Winograd's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by S. Winograd with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites S. Winograd more than expected).

Fields of papers citing papers by S. Winograd

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by S. Winograd. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by S. Winograd. The network helps show where S. Winograd may publish in the future.

Co-authorship network of co-authors of S. Winograd

This figure shows the co-authorship network connecting the top 25 collaborators of S. Winograd. A scholar is included among the top collaborators of S. Winograd based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with S. Winograd. S. Winograd is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Winograd, S.. (2005). Signal processing and complexity of computation. 5. 94–101. 3 indexed citations
2.
Cooley, J.W. & S. Winograd. (2005). A limited range discrete Fourier transform algorithm. 5. 213–217. 4 indexed citations
3.
Averbuch, Amir, Zvi Galil, & S. Winograd. (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]/〈un〉. Theoretical Computer Science. 86(2). 143–203. 2 indexed citations
4.
Averbuch, Amir, Zvi Galil, & S. Winograd. (1988). Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial, part I: The algebra G[u]<Q(u)l>, l>1. Theoretical Computer Science. 58(1-3). 17–56. 8 indexed citations
5.
Feig, Ephraim & S. Winograd. (1984). On the direct sum conjecture. Linear Algebra and its Applications. 63. 193–219. 11 indexed citations
6.
Auslander, L., Ephraim Feig, & S. Winograd. (1984). The multiplicative complexity of the Discrete Fourier Transform. Advances in Applied Mathematics. 5(1). 87–109. 19 indexed citations
7.
Auslander, L., Ephraim Feig, & S. Winograd. (1984). Abelian semi-simple algebras and algorithms for the Discrete Fourier Transform. Advances in Applied Mathematics. 5(1). 31–55. 25 indexed citations
8.
Lempel, A., G. Seroussi, & S. Winograd. (1983). On the complexity of multiplication in finite fields. Theoretical Computer Science. 22(3). 285–296. 37 indexed citations
9.
Auslander, L., Richard Tolimieri, & S. Winograd. (1982). Hecke's theorem in quadratic reciprocity, finite nilpotent groups and the cooley-tukey algorithm. Advances in Mathematics. 43(2). 122–172. 7 indexed citations
10.
Auslander, L., Ephraim Feig, & S. Winograd. (1981). Direct sums of bilinear algorithms. Linear Algebra and its Applications. 38. 175–192. 6 indexed citations
11.
Auslander, L. & S. Winograd. (1980). The multiplicative complexity of certain semilinear systems defined by Polynomials. Advances in Applied Mathematics. 1(3). 257–299. 16 indexed citations
12.
Winograd, S.. (1979). On multiplication in algebraic extension fields. Theoretical Computer Science. 8(3). 359–377. 37 indexed citations
13.
Winograd, S.. (1979). On the multiplicative complexity of the Discrete Fourier Transform. Advances in Mathematics. 32(2). 83–117. 55 indexed citations
14.
Winograd, S.. (1978). On computing the discrete Fourier transform. Mathematics of Computation. 32(141). 175–199. 398 indexed citations
15.
Winograd, S.. (1978). On Computing the Discrete Fourier Transform. Mathematics of Computation. 32(141). 175–175. 224 indexed citations
16.
Winograd, S.. (1975). The effect of the field of constants on the number of multiplications. 1–2. 8 indexed citations
17.
Winograd, S.. (1975). On the Parallel Evaluation of Certain Arithmetic Expressions. Journal of the ACM. 22(4). 477–492. 16 indexed citations
18.
Winograd, S.. (1971). On multiplication of 2 × 2 matrices. Linear Algebra and its Applications. 4(4). 381–388. 122 indexed citations
19.
Winograd, S.. (1971). On the algebraic complexity of inner product. Linear Algebra and its Applications. 4(4). 377–379. 5 indexed citations
20.
Winograd, S.. (1968). The number of multiplications involved in computing certain functions.. IFIP Congress. 276–279. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Don Coppersmith Breakdown of academic impact, for papers by H. T. Kung Breakdown of academic impact, for papers by Robert J. Plemmons Breakdown of academic impact, for papers by Markus Püschel Breakdown of academic impact, for papers by Paul Van Dooren Breakdown of academic impact, for papers by Shang‐Hua Teng Breakdown of academic impact, for papers by W. Kahan Breakdown of academic impact, for papers by G.E. Whitesides Breakdown of academic impact, for papers by Ming Gu Breakdown of academic impact, for papers by Alan J. Laub
Rankless by CCL
2026