Nimrod Megiddo
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 |
| Institutions | IBM Research Stanford University |
| Thesis | Compositions of Cooperative Games (1972) |
| Doctoral advisor | Michael Maschler |
| Doctoral students | Edith Cohen |
| Website | theory |
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. He was one of the first people to propose a solution to the bounding sphere and smallest-circle problem.