Nimrod Megiddo

Nimrod Megiddo
Name	Nimrod Megiddo
Birth date	1948
Nationality	Israeli–American
Fields	Mathematics, Computer Science, Operations Research
Institutions	Hebrew University of Jerusalem, DIMACS, IBM, Microsoft Research, Carnegie Mellon University
Alma mater	Hebrew University of Jerusalem
Doctoral advisor	Shmuel Agmon
Known for	Parametric search, Megiddo's algorithm, Linear programming in fixed dimension

Nimrod Megiddo is an Israeli–American mathematician and computer scientist noted for pioneering algorithmic work in optimization, computational geometry, and parametric search. His contributions established fundamental techniques for solving linear programming problems in fixed dimensions and for designing optimal algorithms in combinatorial optimization. Over a career spanning academia and industry, he influenced both theoretical frameworks and practical systems at major research laboratories.

Early life and education

Born in 1948, Megiddo completed undergraduate and graduate studies at the Hebrew University of Jerusalem, where he studied mathematics and computer science under advisors including Shmuel Agmon. During his doctoral work he investigated problems linked to linear programming and combinatorial optimization, engaging with contemporary developments stemming from research communities around George Dantzig's simplex tradition and emerging algorithmic perspectives from the Stanford University and Princeton University schools. Early collaborations connected him with researchers associated with Bell Labs and the nascent DIMACS centers, placing him at the intersection of theoretical and applied strands in Israeli and international research networks.

Research contributions

Megiddo introduced foundational techniques such as the parametric search method for transforming decision procedures into optimization algorithms, impacting domains including computational geometry, linear programming, network flows, and scheduling. His algorithmic framework produced near-optimal solutions for low-dimensional linear programming, leading to deterministic linear-time algorithms in fixed dimension that built on ideas from Dantzig and advanced them beyond randomized approaches influenced by work at Bell Labs and IBM Research. He developed specialized algorithms for problems like the planar smallest enclosing circle, facility location, and median selection that connected to prior results by Jack Edmonds, Richard Karp, and Jon Bentley. Megiddo's methods integrated combinatorial decomposition techniques reminiscent of approaches from Eugene Lawler and complexity insights traceable to Richard Stearns and Juraj Hromkovič.

His research also produced trade-off analyses between preprocessing and query time relevant to data-structure design, aligning with contemporaneous work from Michael Fredman and Daniel Sleator. In computational geometry his results influenced algorithmic treatments of convex hulls, halfspace intersection, and linear separability, contributing to literature associated with Franco Preparata and Michael Shamos. Megiddo's parametric-search paradigm became a standard tool applied by researchers at institutions such as Carnegie Mellon University, Massachusetts Institute of Technology, and University of California, Berkeley.

Academic and industry career

Megiddo held faculty positions at the Hebrew University of Jerusalem before moving to industry research labs where he led teams at Bell Laboratories, IBM Research, and Microsoft Research. In industry he bridged theory and practice by applying optimization techniques to problems in database query optimization, operations research applications in logistics, and system design tasks similar to those addressed by researchers at AT&T Labs and IBM T.J. Watson Research Center. He later returned to academic collaborations through appointments and visiting positions at centers like DIMACS and research collaborations with faculty at Princeton University and Columbia University. Megiddo also contributed to interdisciplinary projects involving economists and operations researchers associated with institutions such as RAND Corporation and Sloan School of Management.

Major publications and books

Megiddo authored numerous influential articles in leading venues including Journal of the ACM, SIAM Journal on Computing, and conference proceedings of IEEE Symposium on Foundations of Computer Science and ACM Symposium on Theory of Computing. Notable papers include his works on parametric search and linear-time algorithms for low-dimensional linear programming, which are widely cited in surveys and textbooks authored by figures like Jon Kleinberg, Éva Tardos, Thomas H. Cormen, and Charles E. Leiserson. His publications often appear alongside those of contemporaries such as David Shmoys and Andrew V. Goldberg, reflecting cross-pollination between theoretical computer science and practical algorithmic engineering. While Megiddo did not publish a single-author monograph widely used as a textbook, his articles are integral chapters in edited volumes and compendia produced by publishers associated with SIAM and Springer.

Awards and honors

Throughout his career Megiddo received recognition from academic and industrial bodies tied to algorithmic research, including acknowledgments by organizations like SIAM, ACM, and industrial honors from labs such as Bell Labs and Microsoft Research. His algorithms are frequently cited in the citation lists of award-winning papers by researchers at ETH Zurich, University of Oxford, and École Polytechnique Fédérale de Lausanne, reflecting indirect recognition through community adoption and incorporation into curricula at institutions such as Stanford University and UC Berkeley.

Personal life and outreach

Megiddo maintained collaborations across international research communities, engaging with conferences organized by ACM, IEEE, and SIAM and participating in program committees and advisory boards. He mentored students and postdoctoral researchers who later took positions at universities and industry labs including Cornell University, University of Illinois Urbana–Champaign, and Google Research. Outside technical venues he contributed to public-facing workshops and invited lectures at institutions such as Israel Academy of Sciences and Humanities and participated in panels with representatives from European Research Council and national science foundations.

Category:Israeli mathematicians Category:Computer scientists