Jump to content

Nimrod Megiddo

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by KasparBot (talk | contribs) at 04:20, 1 May 2016 (migrating Persondata to Wikidata, please help, see challenges for this article). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Nimrod Megiddo
Alma materHebrew University of Jerusalem
AwardsFrederick W. Lanchester Prize (1992)
John von Neumann Theory Prize (2014)
Scientific career
FieldsMathematics, computer science
Doctoral advisorMichael Maschler

Nimrod Megiddo (Hebrew: נמרוד מגידו) is a mathematician and computer scientist. He is a research scientist at the IBM Almaden Research Center.

His interests include optimization, algorithm design and analysis, game theory, and machine learning.[1][2]

Megiddo received his Ph.D. in mathematics from the Hebrew University of Jerusalem.[1]

Megiddo received the 2014 John von Neumann Theory Prize and is a 1992 Frederick W. Lanchester Prize recipient.

Achievements

In computational geometry, Megiddo is known for his prune and search technique suggested in 1983 [3] and used for various computational geometric optimization problems, in particular to solve the smallest-circle problem in linear time. In 2009 he received the 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 (https://www.informs.org/Connect-with-People/Fellows/INFORMS-Fellows-Class-of-20092).

References

  1. ^ a b Author's profile at an article, Computer, April 2004, p. 11
  2. ^ Nimrod Megiddo bibliography at DBLP Bibliography Server
  3. ^ N. Megiddo. Linear-time algorithms for linear programming in R3 and related problems. SIAM J. Computing, 12:759–776, 1983.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Nimrod_Megiddo&oldid=718031792"