|Name Nimrod Megiddo||Role Computer scientist|
|Fields Mathematics, computer science|
Alma mater Hebrew University of Jerusalem
Notable awards Frederick W. Lanchester Prize (1992) John von Neumann Theory Prize (2014)
Education Hebrew University of Jerusalem
Books A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems
Doctoral advisor Michael Maschler
Bryan Cantrill on ARC: A Self-Tuning, Low Overhead Replacement Cache [PWL SF] 10/2017
Nimrod Megiddo (Hebrew: נמרוד מגידו) is a mathematician and computer scientist. He is a research scientist at the IBM Almaden Research Center.
- Bryan Cantrill on ARC A Self Tuning Low Overhead Replacement Cache PWL SF 102017
His interests include optimization, algorithm design and analysis, game theory, and machine learning.
Megiddo received his Ph.D. in mathematics from the Hebrew University of Jerusalem.
Megiddo received the 2014 John von Neumann Theory Prize, the 1992 ICS Prize, and is a 1992 Frederick W. Lanchester Prize recipient.
In computational geometry, Megiddo is known for his prune and search and parametric search techniques both suggested in 1983 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).