Nimrod Megiddo

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.

  1. ^ a b Nimrod Megiddo publications indexed by Google Scholar Edit this at Wikidata
  2. ^ a b Cite error: The named reference mathgene was invoked but never defined (see the help page).
  3. ^ Cite error: The named reference comp11 was invoked but never defined (see the help page).
  4. ^ Nimrod Megiddo at DBLP Bibliography Server Edit this at Wikidata