Nimrod Megiddo

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Nimrod Megiddo 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 is a 1992 Frederick W. Lanchester Prize recipient.

Achievements[edit]

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).

External links[edit]

References[edit]

  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.