Nimrod Megiddo
Nimrod Megiddo is an Israeli mathematician and computer scientist.
Education and career
Megiddo received his doctorate in mathematics in 1972 from the Hebrew University in Jerusalem under Michael Maschler (Compositions of Cooperative Games). He is a scientist at the IBM Almaden Research Center in San José . He also taught at Tel Aviv University .
He was visiting scholar at Stanford University , Tokyo Institute of Technology, Northwestern University , University of Illinois at Urbana-Champaign , Carnegie Mellon University , National Research Institute for Mathematical Sciences (CSIR) in South Africa, Xerox Parc, and on MSRI .
research
He deals with optimization, design and analysis of algorithms, game theory and machine learning.
In the early 1980s, independently of Martin Dyer, he found the first linear algorithms for linear programming in low dimension. They have applications in computer geometry, for example the problem of the smallest circle (which encloses a given set of points in the plane). According to Megiddo, this can be found in linear time.
He has been the Editor of Discrete Optimization since 2007 and was Editor of Operations Research from 2004 to 2009.
Megiddo also holds numerous patents.
Awards and honors
- 1992: Frederick W. Lanchester Prize ; ICS Prize from INFORMS
- 2009: INFORMS Fellows Award
- 2014: John von Neumann Theory Prize
Megiddo also received three Outstanding Innovation Awards from IBM.
Fonts
- as editor: Essays in Game Theory in Honor of Michael Maschler, Springer Verlag, 1994.
- with M. Kojima, T. Noma, A. Yoshise: A unified approach to interior point algorithms for linear complementarity problems , Lecture Notes in Computer Science 538, Springer Verlag, 1991.
- as editor: Progress in Mathematical Programming: Interior-Point and Related Methods , Springer Verlag, 1988.
- Editor with Y. Xu, B. Zhu: Algorithmic Applications in Management , Proceedings First International Conference, Algorithmic Applications in Management (AAIM) 2005, Xian, China, June 22-25, 2005, Springer Verlag 2005.
Web links
Individual evidence
- ^ Mathematics Genealogy Project
- ^ Megiddo, Linear-time algorithms for linear programming in and related problems. SIAM J. Computing, 12: 759-776, 1983.
- ^ Frederick W. Lanchester Prize. (No longer available online.) Informs.org ( Institute for Operations Research and the Management Sciences ), archived from the original on October 2, 2015 ; accessed on February 16, 2016 . Info: The archive link was inserted automatically and has not yet been checked. Please check the original and archive link according to the instructions and then remove this notice.
| personal data | |
|---|---|
| SURNAME | Megiddo, Nimrod |
| BRIEF DESCRIPTION | Israeli mathematician and computer scientist |
| DATE OF BIRTH | 20th century |