| 1994 |
|---|
| 26 | EE | Shmuel Winograd,
Alan J. Hoffman:
Preface.
IBM Journal of Research and Development 38(3): 242-242 (1994) |
| 1992 |
|---|
| 25 | | Ephraim Feig,
Shmuel Winograd:
On the multiplicative complexity of discrete cosine transforms.
IEEE Transactions on Information Theory 38(4): 1387- (1992) |
| 1991 |
|---|
| 24 | | 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 |
|---|
| 23 | | Don Coppersmith,
Shmuel Winograd:
Matrix Multiplication via Arithmetic Progressions.
J. Symb. Comput. 9(3): 251-280 (1990) |
| 1988 |
|---|
| 22 | | 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 |
|---|
| 21 | | Don Coppersmith,
Shmuel Winograd:
Matrix Multiplication via Arithmetic Progressions
STOC 1987: 1-6 |
| 1986 |
|---|
| 20 | | 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 |
|---|
| 19 | EE | 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 |
|---|
| 18 | | Abraham Lempel,
Gadiel Seroussi,
Shmuel Winograd:
On the Complexity of Multiplication in Finite Fields.
Theor. Comput. Sci. 22: 285-296 (1983) |
| 1982 |
|---|
| 17 | | Don Coppersmith,
Shmuel Winograd:
On the Asymptotic Complexity of Matrix Multiplication.
SIAM J. Comput. 11(3): 472-492 (1982) |
| 1981 |
|---|
| 16 | | Don Coppersmith,
Shmuel Winograd:
On the Asymptotic Complexity of Matrix Multiplication (Extended Summary)
FOCS 1981: 82-90 |
| 15 | | Ephraim Feig,
Shmuel Winograd:
On the Direct Sum Conjecture (Extended Summary)
FOCS 1981: 91-94 |
| 1980 |
|---|
| 14 | | Shmuel Winograd:
On Multiplication of Polynomials Modulo a Polynomial.
SIAM J. Comput. 9(2): 225-229 (1980) |
| 1979 |
|---|
| 13 | | Shmuel Winograd:
On Multiplication in Algebraic Extension Fields.
Theor. Comput. Sci. 8: 359-377 (1979) |
| 1978 |
|---|
| 12 | EE | Shmuel Winograd:
Complexity Of Computations.
ACM Annual Conference (1) 1978: 138-141 |
| 1977 |
|---|
| 11 | | Shmuel Winograd:
Some Bilinear Forms Whose Multiplicative Complexity Depends on the Field of Constants.
Mathematical Systems Theory 10: 169-180 (1977) |
| 1975 |
|---|
| 10 | | Shmuel Winograd:
The Effect of the Field of Constants on the Number of Multiplication
FOCS 1975: 1-2 |
| 9 | EE | Shmuel Winograd:
On the Parallel Evaluation of Certain Arithmetic Expressions.
J. ACM 22(4): 477-492 (1975) |
| 1968 |
|---|
| 8 | | Shmuel Winograd:
The number of multiplications involved in computing certain functions.
IFIP Congress (1) 1968: 276-279 |
| 1967 |
|---|
| 7 | EE | Richard M. Karp,
Raymond E. Miller,
Shmuel Winograd:
The Organization of Computations for Uniform Recurrence Equations.
J. ACM 14(3): 563-590 (1967) |
| 6 | EE | Shmuel Winograd:
On the Time Required to Perform Multiplication.
J. ACM 14(4): 793-802 (1967) |
| 1966 |
|---|
| 5 | EE | L. P. Horwitz,
Richard M. Karp,
Raymond E. Miller,
Shmuel Winograd:
Index Register Allocation.
J. ACM 13(1): 43-61 (1966) |
| 1965 |
|---|
| 4 | EE | Shmuel Winograd:
On the Time Required to Perform Addition.
J. ACM 12(2): 277-285 (1965) |
| 1964 |
|---|
| 3 | EE | Shmuel Winograd:
Input-Error-Limiting Automata.
J. ACM 11(3): 338-351 (1964) |
| 1963 |
|---|
| 2 | | Shmuel Winograd:
Redundancy and Complexity of Logical Elements
Information and Control 6(3): 177-194 (1963) |
| 1962 |
|---|
| 1 | | Shmuel Winograd:
Bounded-transient automata
FOCS 1962: 137-141 |
