- CSB - MetaPress - Google - Bing - Yahoo
 | 1994 | |
|---|---|---|
| j19 |      | Shmuel Winograd, Alan J. Hoffman: Preface. IBM Journal of Research and Development 38(3): 242 (1994) |
| 1992 | ||
| j18 | | Ephraim Feig, Shmuel Winograd: On the multiplicative complexity of discrete cosine transforms. IEEE Transactions on Information Theory 38(4): 1387-1391 (1992) |
| j17 | | Ephraim Feig, Shmuel Winograd: Fast algorithms for the discrete cosine transform. IEEE Transactions on Signal Processing 40(9): 2174-2193 (1992) |
| 1991 | ||
| j16 | | 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 | ||
| j15 | | Don Coppersmith, Shmuel Winograd: Matrix Multiplication via Arithmetic Progressions. J. Symb. Comput. 9(3): 251-280 (1990) |
| 1988 | ||
| j14 | | 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 | ||
| c10 | | |
| 1986 | ||
| c9 | | 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 | ||
| j13 | | 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) |
| 1983 | ||
| j12 | | Abraham Lempel, Gadiel Seroussi, Shmuel Winograd: On the Complexity of Multiplication in Finite Fields. Theor. Comput. Sci. 22: 285-296 (1983) |
| 1982 | ||
| j11 | | Don Coppersmith, Shmuel Winograd: On the Asymptotic Complexity of Matrix Multiplication. SIAM J. Comput. 11(3): 472-492 (1982) |
| 1981 | ||
| c8 | | Don Coppersmith, Shmuel Winograd: On the Asymptotic Complexity of Matrix Multiplication (Extended Summary). FOCS 1981: 82-90 |
| c7 | | |
| c6 | | |
| 1980 | ||
| j10 | | Shmuel Winograd: On Multiplication of Polynomials Modulo a Polynomial. SIAM J. Comput. 9(2): 225-229 (1980) |
| 1979 | ||
| j9 | | Shmuel Winograd: On Multiplication in Algebraic Extension Fields. Theor. Comput. Sci. 8: 359-377 (1979) |
| 1978 | ||
| c5 | | |
| 1977 | ||
| j8 | | Shmuel Winograd: Some Bilinear Forms Whose Multiplicative Complexity Depends on the Field of Constants. Mathematical Systems Theory 10: 169-180 (1977) |
| 1975 | ||
| j7 | | 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 |  | |
| 1968 | ||
| c2 | | Shmuel Winograd: The number of multiplications involved in computing certain functions. IFIP Congress (1) 1968: 276-279 |
| 1967 | ||
| j6 | | Richard M. Karp, Raymond E. Miller, Shmuel Winograd: The Organization of Computations for Uniform Recurrence Equations. J. ACM 14(3): 563-590 (1967) |
| j5 | | |
| 1966 | ||
| j4 | | L. P. Horwitz, Richard M. Karp, Raymond E. Miller, Shmuel Winograd: Index Register Allocation. J. ACM 13(1): 43-61 (1966) |
| 1965 | ||
| j3 | | |
| 1964 | ||
| j2 | | |
| 1963 | ||
| j1 | | Shmuel Winograd: Redundancy and Complexity of Logical Elements. Information and Control 6(3): 177-194 (1963) |
| 1962 | ||
| c1 | | |
| 1 | Amir Averbuch | |
| 2 | Don Coppersmith | |
| 3 | Ephraim Feig | |
| 4 | Zvi Galil | |
| 5 | Albert G. Greenberg | |
| 6 | Alan J. Hoffman | |
| 7 | L. P. Horwitz | |
| 8 | Richard M. Karp | |
| 9 | Abraham Lempel | |
| 10 | Raymond E. Miller | |
| 11 | Gadiel Seroussi |
Colors in the list of coauthors
Last update Thu May 23 12:54:07 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page