The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Shmuel Winograd: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002