Shmuel Winograd
| Shmuel Winograd | |
|---|---|
| Born |
January 4, 1936 Tel Aviv, Israel |
| Nationality | Israeli American |
| Fields | Computer science |
| Institutions | Technion – Israel Institute of Technology |
| Alma mater |
New York University Massachusetts Institute of Technology |
| Doctoral advisor | Jacob T. Schwartz |
| Doctoral students | Zvi Kedem |
| Known for | Coppersmith–Winograd algorithm |
Shmuel Winograd (Hebrew: שמואל וינוגרד; born January 4, 1936) is an American computer scientist, noted for his contributions to computational complexity. He has proved several major results regarding the computational aspects of arithmetic; his contributions include the Coppersmith–Winograd algorithm and an algorithm for Fast Fourier Transforms.[1]
Winograd studied Electrical Engineering at the Massachusetts Institute of Technology, receiving his B.S. and M.S. degrees in 1959. He received his Ph.D. from the Courant Institute of Mathematical Sciences at New York University in 1968. He joined the research staff at IBM in 1961, eventually becoming director of the Mathematical Sciences Department there from 1970–1974 and 1980–1994.[1]
Honors
- IBM Fellow (1972)[2]
- Fellow of the Institute of Electrical and Electronics Engineers (1974)[3]
- W. Wallace McDowell Award (1974)[1]
- Member, National Academy of Sciences (1978)[4]
- Fellow of the Association for Computing Machinery (1994)[5]
Books
- Winograd, Shmuel (1980). Arithmetic complexity of computations. CBMS-NSF regional conference series in applied mathematics. 33. Society for Industrial and Applied Mathematics. ISBN 978-0-89871-163-9.
References
- 1 2 3 Shmuel Winograd: 1974 W. Wallace McDowell Award Recipient IEEE
- ↑ Shmuel Winograd IBM Fellow IBM.
- ↑ Fellows list, IEEE
- ↑ Winograd, Shmuel, National Academy of Sciences.
- ↑ Fellows of the ACM, ACM.
External links
This article is issued from Wikipedia - version of the 2/14/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.