default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShmuel Winograd
Person information
- award (1974): W. Wallace McDowell Award
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1994
[j27]Shmuel Winograd, Alan J. Hoffman:
Preface. IBM J. Res. Dev. 38(3): 242 (1994)- 1992
- [j26]Ephraim Feig, Shmuel Winograd:
On the multiplicative complexity of discrete cosine transforms. IEEE Trans. Inf. Theory 38(4): 1387-1391 (1992) - [j25]Ephraim Feig, Shmuel Winograd:
Fast algorithms for the discrete cosine transform. IEEE Trans. Signal Process. 40(9): 2174-2193 (1992) - 1991
- [j24]Amir Averbuch, Zvi Galil, Shmuel Winograd:
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. 86(2): 143-203 (1991) - 1990
- [j23]Don Coppersmith, Shmuel Winograd:
Matrix Multiplication via Arithmetic Progressions. J. Symb. Comput. 9(3): 251-280 (1990)
1980 – 1989
- 1988
- [j22]Amir Averbuch, Zvi Galil, Shmuel Winograd:
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. 58: 17-56 (1988) - 1987
- [c13]Don Coppersmith, Shmuel Winograd:
Matrix Multiplication via Arithmetic Progressions. STOC 1987: 1-6 - 1986
- [c12]Amir Averbuch, Shmuel Winograd, Zvi Galil:
Classification of all the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a Polynomial. ICALP 1986: 31-39 - 1985
- [j21]Albert G. Greenberg, Shmuel Winograd:
A Lower Bound on the Time Needed in the Worst Case to Resolve Conflicts Deterministically in Multiple Access Channels. J. ACM 32(3): 589-596 (1985) - [j20]Richard Tolimieri, Shmuel Winograd:
Computing the ambiguity surface. IEEE Trans. Acoust. Speech Signal Process. 33(5): 1239-1245 (1985) - 1983
- [j19]Abraham Lempel, Gadiel Seroussi, Shmuel Winograd:
On the Complexity of Multiplication in Finite Fields. Theor. Comput. Sci. 22: 285-296 (1983) - 1982
- [j18]Don Coppersmith, Shmuel Winograd:
On the Asymptotic Complexity of Matrix Multiplication. SIAM J. Comput. 11(3): 472-492 (1982) - 1981
- [c11]Don Coppersmith, Shmuel Winograd:
On the Asymptotic Complexity of Matrix Multiplication (Extended Summary). FOCS 1981: 82-90 - [c10]Ephraim Feig, Shmuel Winograd:
On the Direct Sum Conjecture (Extended Summary). FOCS 1981: 91-94 - [c9]James W. Cooley, Shmuel Winograd:
On the use of filter design programs for generating spectral windows. ICASSP 1981: 394-396 - [c8]Shmuel Winograd:
Algebraic constructions for algorithms (Extended Abstract). SYMSACC 1981: 142-145 - 1980
- [j17]Shmuel Winograd:
On Multiplication of Polynomials Modulo a Polynomial. SIAM J. Comput. 9(2): 225-229 (1980) - [c7]Shmuel Winograd:
Signal processing and complexity of computation. ICASSP 1980: 94-101 - [c6]James W. Cooley, Shmuel Winograd:
A limited range discrete Fourier transform algorithm. ICASSP 1980: 213-217
1970 – 1979
- 1979
- [j16]Shmuel Winograd:
On Multiplication in Algebraic Extension Fields. Theor. Comput. Sci. 8: 359-377 (1979) - 1978
- [j15]Abraham Peled, Shmuel Winograd:
TDM-FDM Conversion Requiring Reduced Computation Complexity. IEEE Trans. Commun. 26(5): 707-719 (1978) - [c5]Shmuel Winograd:
Complexity Of Computations. ACM Annual Conference (1) 1978: 138-141 - 1977
- [j14]Shmuel Winograd:
Some Bilinear Forms Whose Multiplicative Complexity Depends on the Field of Constants. Math. Syst. Theory 10: 169-180 (1977) - [j13]Abraham Lempel, Shmuel Winograd:
A new approach to error-correcting codes. IEEE Trans. Inf. Theory 23(4): 503-508 (1977) - 1975
- [j12]Shmuel Winograd:
On the Parallel Evaluation of Certain Arithmetic Expressions. J. ACM 22(4): 477-492 (1975) - [c4]Shmuel Winograd:
The Effect of the Field of Constants on the Number of Multiplication. FOCS 1975: 1-2 - 1972
- [c3]Shmuel Winograd:
Parallel Iteration Methods. Complexity of Computer Computations 1972: 53-60
1960 – 1969
- 1968
- [j11]Shmuel Winograd:
A New Algorithm for Inner Product. IEEE Trans. Computers 17(7): 693-694 (1968) - [c2]Shmuel Winograd:
The number of multiplications involved in computing certain functions. IFIP Congress (1) 1968: 276-279 - 1967
- [j10]Richard M. Karp, Raymond E. Miller, Shmuel Winograd:
The Organization of Computations for Uniform Recurrence Equations. J. ACM 14(3): 563-590 (1967) - [j9]Shmuel Winograd:
On the Time Required to Perform Multiplication. J. ACM 14(4): 793-802 (1967) - 1966
- [j8]Lawrence Paul Horwitz, Richard M. Karp, Raymond E. Miller, Shmuel Winograd:
Index Register Allocation. J. ACM 13(1): 43-61 (1966) - [j7]Leo Hellerman, William L. Duda, Shmuel Winograd:
Continuity and Realizability of Sequence Transformations. IEEE Trans. Electron. Comput. 15(4): 560-569 (1966) - 1965
- [j6]Shmuel Winograd:
On the Time Required to Perform Addition. J. ACM 12(2): 277-285 (1965) - 1964
- [j5]Shmuel Winograd:
Input-Error-Limiting Automata. J. ACM 11(3): 338-351 (1964) - [j4]Raymond E. Miller, Shmuel Winograd:
On the Number of Transitions Entering the States of a Finite Automaton. IEEE Trans. Electron. Comput. 13(4): 463-464 (1964) - 1963
- [j3]Shmuel Winograd:
Redundancy and Complexity of Logical Elements. Inf. Control. 6(3): 177-194 (1963) - 1962
- [j2]Burton B. Tasini, Shmuel Winograd:
Multiple Input-Output Links in Computer Systems. IBM J. Res. Dev. 6(3): 306-328 (1962) - [j1]Shmuel Winograd:
Coding for Logical Operations. IBM J. Res. Dev. 6(4): 430-436 (1962) - [c1]Shmuel Winograd:
Bounded-transient automata. SWCT 1962: 137-141
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
