Nimrod Megiddo

From Wikipedia the free encyclopedia

Nimrod Megiddo
Born
Hebrew: נמרוד מגידו
Alma materHebrew University of Jerusalem
Known forPrune and search
AwardsFrederick W. Lanchester Prize (1992)
John von Neumann Theory Prize (2014)
Scientific career
FieldsOperations research
Algorithms
Complexity
Machine learning
Game theory[1]
InstitutionsIBM Research
Stanford University
Thesis Compositions of Cooperative Games  (1972)
Doctoral advisorMichael Maschler[2]
Doctoral studentsEdith Cohen[2]
Websitetheory.stanford.edu/~megiddo/bio.html Edit this at Wikidata

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.

Education[edit]

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

Career and research[edit]

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[edit]

Megiddo received the 2014 John von Neumann Theory Prize, the 1992 ICS Prize, and is a 1992 Frederick W. Lanchester Prize recipient.[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]

References[edit]

  1. ^ a b Nimrod Megiddo publications indexed by Google Scholar Edit this at Wikidata
  2. ^ a b c d Nimrod Megiddo at the Mathematics Genealogy Project Edit this at Wikidata
  3. ^ a b "Megiddo profile at an article from Computer journal April 2004, p. 11" (PDF). Archived from the original (PDF) on 2004-07-31.
  4. ^ Nimrod Megiddo at DBLP Bibliography Server Edit this at Wikidata
  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. 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
  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, MR 0819134, S2CID 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. ISBN 978-1-4613-9619-2.
  9. ^ Cohen, Edith (1991). Combinatorial Algorithms for Optimization Problems. dtic.mil (PhD thesis). Stanford University. OCLC 753884177.
  10. ^ "Nimrod Megiddo's resume and publications". theory.stanford.edu. Retrieved 2021-09-09.
  11. ^ "INFORMS Fellows: Class of 2009 - INFORMS". Archived from the original on 2015-09-15. Retrieved 2014-05-09.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Nimrod_Megiddo&oldid=1218632864"