Nimrod Megiddo

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
Nimrod Megiddo
Alma materHebrew University of Jerusalem
AwardsFrederick W. Lanchester Prize (1992)
ICS 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, the 1992 ICS Prize, and is a 1992 Frederick W. Lanchester Prize recipient.


In computational geometry, Megiddo is known for his prune and search and parametric search techniques both suggested in 1983 [3][4] 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 (


  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. Comput., 12:759–776, 1983.
  4. ^ 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.

External links[edit]