Nimrod Megiddo

Nimrod Megiddo (Hebrew: ‫ )נמרוד מגידו‬is a mathematician and

Nimrod Megiddo
computer scientist. He is a research scientist at the IBM Almaden
Research Center and Stanford University. His interests include Born Hebrew: ‫נמרוד מגידו‬
combinatorial optimization, algorithm design and analysis, game Alma mater Hebrew University of
theory, and machine learning.[1][3][4] He was one of the first Jerusalem
people to propose a solution to the bounding sphere and smallest-
circle problem. Known for Prune and search
Awards Frederick W.

Education Lanchester Prize

(1992)
Megiddo received his PhD in mathematics from the Hebrew John von Neumann
University of Jerusalem for research supervised by Michael Theory Prize (2014)
Maschler.[2][3][5] Scientific career
Fields Operations research
Career and research Algorithms
Complexity
In computational geometry, Megiddo is known for his prune and Machine learning
search and parametric search techniques both suggested in Game theory[1]
1983[6][7] and used for various computational geometric
Institutions IBM Research
optimization problems, in particular to solve the smallest-circle
Stanford University
problem in linear time.[8] His former doctoral students include
Edith Cohen.[2][9] Thesis Compositions of
Cooperative
Games (1972)
Awards and honours
Doctoral Michael Maschler[2]
Megiddo received the 2014 John von Neumann Theory Prize, the advisor
1992 ICS Prize, and is a 1992 Frederick W. Lanchester Prize Doctoral Edith Cohen[2]
recipient.[10] In 2009 he received the Institute for Operations students
Research and the Management Sciences (INFORMS) Fellows
Website theory.stanford.edu
award for contributions to the theory and application of
/~megiddo/bio.html
mathematical programming, including parametric searches, interior
(http://theory.stanfor
point methods, low dimension Linear Programming, probabilistic
d.edu/~megiddo/bio.
analysis of the simplex method and computational game theory.[11]
html)

References
1. Nimrod Megiddo (https://scholar.google.com/citations?user=kEOeI2gAAAAJ) publications
indexed by Google Scholar
2. Nimrod Megiddo (https://mathgenealogy.org/id.php?id=58848) at the Mathematics
Genealogy Project
 3. "Megiddo profile at an article from Computer journal April 2004, p. 11" (https://web.archive.or
g/web/20040731121210/http://www.almaden.ibm.com/cs/people/dmodha/ARC.pdf) (PDF).
Archived from the original (http://www.almaden.ibm.com/cs/people/dmodha/ARC.pdf) (PDF)
on 2004-07-31.
4. Nimrod Megiddo (https://dblp.org/pid/m/NimrodMegiddo) at DBLP Bibliography Server
5. N. Megiddo; D.S. Modha (April 2004). "Outperforming LRU with an adaptive replacement
cache algorithm". Computer. 37 (4): 58–65. doi:10.1109/MC.2004.1297303 (https://doi.org/1
0.1109%2FMC.2004.1297303). ISSN 0018-9162 (https://www.worldcat.org/issn/0018-9162).
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 (https://doi.org/10.110
9%2FSFCS.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 (https://doi.org/1
0.1145%2F2157.322410), MR 0819134 (https://mathscinet.ams.org/mathscinet-getitem?mr=
0819134), S2CID 2212007 (https://api.semanticscholar.org/CorpusID:2212007).
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 (https://doi.org/10.1007%2F978-1-4613-9617-8_8). ISBN 978-1-4613-9619-2.
9. Cohen, Edith (1991). Combinatorial Algorithms for Optimization Problems (https://apps.dtic.
mil/sti/citations/ADA254553). dtic.mil (PhD thesis). Stanford University. OCLC 753884177 (h
ttps://www.worldcat.org/oclc/753884177).
10. "Nimrod Megiddo's resume and publications" (https://theory.stanford.edu/~megiddo/bio.htm
l). theory.stanford.edu. Retrieved 2021-09-09.
11. "INFORMS Fellows: Class of 2009 - INFORMS" (https://web.archive.org/web/20150915040
834/https://www.informs.org/Connect-with-People/Fellows/INFORMS-Fellows-Class-of-200
92). Archived from the original (https://www.informs.org/Connect-with-People/Fellows/INFO
RMS-Fellows-Class-of-20092) on 2015-09-15. Retrieved 2014-05-09.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Nimrod_Megiddo&oldid=1150024020"