Nimrod Megiddo

Born|

נמרוד מגידו

Alma mater| Hebrew University of Jerusalem
Known for| Prune and search
Awards| Frederick W. Lanchester Prize (1992)
John von Neumann Theory Prize (2014)
Scientific career
Fields| Operations research
Algorithms
Complexity
Machine learning
Game theory[1]
Institutions| IBM Research
Stanford University
Thesis| Compositions of Cooperative Games (1972)
Doctoral advisor| Michael Maschler[2]
Doctoral students| Edith Cohen[2]
Website| {{{1}}}

Nimrod Megiddo (Hebrew: נמרוד מגידו) is a mathematician and computer scientist. He is a research scientist at the IBM Almaden Research Center and Stanford University. His interests include combinatorial optimization, algorithm design and analysis, game theory, and machine learning.[1][3][4] He was one of the first people to propose a solution to the bounding sphere and smallest-circle problem.

## Contents

* 1 Education
* 2 Career and research
* 2.1 Awards and honours
* 3 References

## Education

Megiddo received his PhD in mathematics from the Hebrew University of Jerusalem for research supervised by Michael Maschler.[2][3][5]

## Career and research

In computational geometry, Megiddo is known for his prune and search and parametric search techniques both suggested in 1983[6][7] and used for various computational geometric optimization problems, in particular to solve the smallest-circle problem in linear time.[8] His former doctoral students include Edith Cohen.[2][9]

### Awards and honours

Megiddo received the 1992 INFORMS Computing Society Prize, and was part of a group of researchers receiving the 1992 Frederick W. Lanchester Prize for their research on the linear complementarity problem, also including Masakazu Kojima, Shinji Mizuno, Toshihito Noma, and Akiko Yoshise.[10] In 2009 he received the Institute for Operations Research and the Management Sciences (INFORMS) Fellows award for contributions to the theory and application of mathematical programming, including parametric searches, interior point methods, low dimension Linear Programming, probabilistic analysis of the simplex method and computational game theory.[11] He was the 2014 recipient of the John von Neumann Theory Prize.[10]

## References

1. ↑ 1.0 1.1 {{Google Scholar id}} template missing ID and not present in Wikidata.
2. ↑ 2.0 2.1 2.2 2.3 Nimrod Megiddo at the Mathematics Genealogy Project
3. ↑ 3.0 3.1 "Megiddo profile at an article from Computer journal April 2004, p. 11". Archived from the original on 2004-07-31. https://web.archive.org/web/20040731121210/http://www.almaden.ibm.com/cs/people/dmodha/ARC.pdf.
4. ↑ {{DBLP}} template missing ID and not present in Wikidata.
5. ↑ , Wikidata Q56429214
6. ↑ Nimrod Megiddo (1983) Linear-time algorithms for linear programming in R3 and related problems. SIAM J. Comput., 12:759-776 doi:10.1109/SFCS.1982.24
7. ↑ Megiddo, Nimrod (1983), "Applying parallel computation algorithms in the design of serial algorithms", Journal of the ACM 30 (4): 852–865, doi:10.1145/2157.322410 .
8. ↑ Megiddo, Nimrod (1989). "Pathways to the Optimal Set in Linear Programming". Progress in Mathematical Programming. Springer New York. pp. 131–158. doi:10.1007/978-1-4613-9617-8_8. ISBN 978-1-4613-9619-2.
9. ↑ Cohen, Edith (1991). Combinatorial Algorithms for Optimization Problems. dtic.mil (PhD thesis). Stanford University. OCLC 753884177.
10. ↑ 10.0 10.1 "Nimrod Megiddo". Award Recipients. INFORMS. https://www.informs.org/Recognizing-Excellence/Award-Recipients/Nimrod-Megiddo.
11. ↑ "INFORMS Fellows: Class of 2009 - INFORMS". https://www.informs.org/Connect-with-People/Fellows/INFORMS-Fellows-Class-of-20092.

* v
* t
* e

John von Neumann Theory Prize

1975–1999|

* George Dantzig (1975)
* Richard Bellman (1976)
* Felix Pollaczek (1977)
* John F. Nash / Carlton E. Lemke (1978)
* David Blackwell (1979)
* David Gale / Harold W. Kuhn / Albert W. Tucker (1980)
* Lloyd Shapley (1981)
* Abraham Charnes / William W. Cooper / Richard J. Duffin (1982)
* Herbert Scarf (1983)
* Ralph Gomory (1984)
* Jack Edmonds (1985)
* Kenneth J. Arrow (1986)
* Samuel Karlin (1987)
* Herbert A. Simon (1988)
* Harry M. Markowitz (1989)
* Richard Karp (1990)
* Richard E. Barlow / Frank Proschan (1991)
* Alan J. Hoffman / Philip Wolfe (1992)
* Robert Herman (1993)
* Lajos Takacs (1994)
* Egon Balas (1995)
* Peter C. Fishburn (1996)
* Peter Whittle (1997)
* Fred W. Glover (1998)
* R. Tyrrell Rockafellar (1999)

2000–present|

* Ellis L. Johnson / Manfred W. Padberg (2000)
* Ward Whitt (2001)
* Donald L. Iglehart / Cyrus Derman (2002)
* Arkadi Nemirovski / Michael J. Todd (2003)
* J. Michael Harrison (2004)
* Robert J. Aumann (2005)
* Martin Grötschel / László Lovász / Alexander Schrijver (2006)
* Arthur F. Veinott, Jr. (2007)
* Frank Kelly (2008)
* Yurii Nesterov / Yinyu Ye (2009)
* Søren Asmussen / Peter W. Glynn (2010)
* Gérard Cornuéjols (2011)
* George Nemhauser / Laurence Wolsey (2012)
* Michel Balinski (2013)
* Nimrod Megiddo (2014)
* Vašek Chvátal / Jean Bernard Lasserre (2015)
* Martin I. Reiman / Ruth J. Williams (2016)
* Donald Goldfarb / Jorge Nocedal (2017)

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Nimrod Megiddo. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Biography:Nimrod_Megiddo&oldid=4224232"
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template