Nimrod Megiddo

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.

Nimrod Megiddo
Born	נמרוד מגידו
Alma mater	Hebrew University of Jerusalem
Known for	Prune and search
Awards	Frederick W. Lanchester Prize (1992) John von Neumann Theory Prize (2014)
Scientific career
Fields	Operations research Algorithms Complexity Machine learning Game theory[1]
Institutions	IBM Research Stanford University
Thesis	Compositions of Cooperative Games  (1972)
Doctoral advisor	Michael Maschler[2]
Doctoral students	Edith Cohen[2]
Website	theory.stanford.edu/~megiddo/bio.html

Education

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

Career and research

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

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]