Shmuel Winograd

from Wikipedia, the free encyclopedia

Shmuel Winograd (born January 4, 1936 in Tel Aviv ; died March 25, 2019 ) was an Israeli-American computer scientist .

Career

Winograd studied electrical engineering at the Massachusetts Institute of Technology (MIT) with a bachelor's and master's degree in 1959. He then worked as a research assistant at MIT until 1961. In 1968 he received his PhD under Jacob T. Schwartz at the Courant Institute of Mathematical Sciences of New York University . From 1961 he was a scientist at IBM at the Thomas J. Watson Research Center in Yorktown Heights, where he headed the mathematics department from 1970 to 1974 and 1980 to 1994. He was visiting professor at the University of California, Berkeley (1967/68 Mackay Lecturer) and at the Technion (where he was a permanent visiting professor).

He is known for his contributions to complexity theory, especially for arithmetic tasks such as determining roots, evaluating polynomials or matrix multiplications. The Coppersmith-Winograd algorithm is named after him and Don Coppersmith , the asymptotically fastest known algorithm for the multiplication of square matrices until 2010 , and he also developed an algorithm for the fast Fourier transformation .

He was a member of the National Academy of Sciences (1978), the American Academy of Arts and Sciences (1983) and the American Philosophical Society (1989), a fellow of the IEEE (1974) and the Association for Computing Machinery (1994). In 1974 he received the W. Wallace McDowell Award from the IEEE for fundamental work in complexity theory and research on the scientific basis for assessing the efficiency of algorithms. In 1968 he received an IBM Corporate Outstanding Contributions Award for work on the complexity of arithmetic operations. In 1972 he became an IBM Fellow .

In 1970 he was invited speaker at the International Congress of Mathematicians in Nice (On the algebraic complexity of functions).

He was married and had two children.

Fonts

  • Arithmetic complexity of computations , SIAM 1980

Web links

Individual evidence

  1. Shmuel Winograd. National Academy of Sciences, accessed April 29, 2019 .
  2. ^ Mathematics Genealogy Project
  3. ^ Coppersmith, Winograd Matrix multiplication via arithmetic progressions , Journal of Symbolic Computation, Volume 9, 1990, pp. 251-280. It was faster than the street algorithm from Volker Strassen . In 2010, Andrew Stothers found an improvement.
  4. ^ Winograd On computing the discrete Fourier transform , Math. Computation, Volume 32, 1978, pp. 175-199