|Alma mater||Hebrew University of Jerusalem|
|Awards||Frederick W. Lanchester Prize (1992)
ICS Prize (1992)
John von Neumann Theory Prize (2014)
|Fields||Mathematics, computer science|
|Doctoral advisor||Michael Maschler|
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).
- Author's profile at an article, Computer, April 2004, p. 11
- Nimrod Megiddo bibliography at DBLP Bibliography Server
- N. Megiddo. Linear-time algorithms for linear programming in R3 and related problems. SIAM J. Comput., 12:759–776, 1983.
- Megiddo, Nimrod (1983), "Applying parallel computation algorithms in the design of serial algorithms", Journal of the ACM, 30 (4): 852–865, doi:10.1145/2157.322410, MR 0819134.