Nimrod Megiddo | |
---|---|
Born | Hebrew: נמרוד מגידו |
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 |
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.
mathgene
was invoked but never defined (see the help page).comp11
was invoked but never defined (see the help page).