This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| Micha Sharir | |
|---|---|
| Name | Micha Sharir |
| Birth date | 1950 |
| Birth place | Israel |
| Fields | Mathematics, Computer Science |
| Workplaces | Tel Aviv University, Courant Institute, Hebrew University of Jerusalem, Rutgers University |
| Alma mater | Tel Aviv University |
| Doctoral advisor | Noga Alon |
Micha Sharir is an Israeli mathematician and computer scientist known for foundational work in computational geometry, discrete geometry, and combinatorial geometry. He has held faculty positions at prominent institutions and collaborated with leading researchers across Europe, North America, and Israel. His research bridges theory and application, influencing fields from robotics to computer graphics and algorithmic game theory.
Sharir was born in Israel and completed undergraduate and graduate studies at Tel Aviv University, where he studied under advisors associated with combinatorics and graph theory at institutions such as the Hebrew University of Jerusalem and interacted with visiting scholars from the Courant Institute of Mathematical Sciences and Princeton University. His doctoral work drew on methods from researchers affiliated with Erdős collaborators and contemporaries at Technion – Israel Institute of Technology and the Weizmann Institute of Science. Early influences included seminars connected to the Jerusalem School of Mathematics and conferences like the International Congress of Mathematicians and the Symposium on Computational Geometry.
Sharir served on the faculty of Tel Aviv University in the School of Mathematical Sciences and held visiting appointments at institutions including the Courant Institute of Mathematical Sciences, Rutgers University, and the University of British Columbia. He participated in programs at the Institute for Advanced Study and collaborated with faculty from the Massachusetts Institute of Technology, Stanford University, University of California, Berkeley, and University of Toronto. He organized workshops at venues such as the Mathematical Sciences Research Institute and the Fields Institute and contributed to professional societies including the Association for Computing Machinery and the Society for Industrial and Applied Mathematics.
Sharir made seminal contributions to computational geometry, advancing results on arrangements of lines and curves, epsilon-nets, and incidence geometry that relate to problems studied at Bell Labs and in gatherings like the ACM Symposium on Theory of Computing. He collaborated on crossing number inequalities and applications of the Szemerédi–Trotter theorem and contributed to the development of algorithms for motion planning originally motivated by work at Carnegie Mellon University and ETH Zurich. His joint work on Davenport–Schinzel sequences connected combinatorial bounds used by researchers at Princeton University and Columbia University to algorithmic applications in computer graphics and robotics. Sharir also co-developed data-structural techniques and upper bounds on geometric incidences that influenced studies at Harvard University and Yale University and informed research agendas at conferences like SoCG and FOCS.
Sharir received recognition from major institutions and prizes tied to achievements in discrete and computational geometry, with honors paralleling awards such as the Erdős Prize, fellowships similar to Guggenheim Fellowship appointments, and invitations to give plenary talks at the International Congress of Mathematicians and the European Symposium on Algorithms. He has been elected to national and international academies alongside members from the American Academy of Arts and Sciences and the Israel Academy of Sciences and Humanities and awarded distinctions comparable to lifetime achievement accolades presented at the Symposium on Computational Geometry and meetings organized by the European Mathematical Society.
Sharir authored and coauthored influential papers and monographs published in venues associated with the Journal of the ACM, Discrete & Computational Geometry, and proceedings of the ACM Symposium on Theory of Computing and IEEE Symposium on Foundations of Computer Science. Notable collaborations include coauthors from Noga Alon, Efrat, Agarwal, Pach, Székely, and other leading researchers at institutions such as the Weizmann Institute of Science, Tel Aviv University, and Rutgers University.
Sharir supervised doctoral students who went on to positions at research centers and universities including Stanford University, Princeton University, Massachusetts Institute of Technology, University of Washington, and industry labs at Google Research and Microsoft Research. His academic descendants form part of a lineage connected to networks of researchers associated with Erdős collaborators and networks spanning the International Congress of Mathematicians participants and the Computational Geometry community.
Sharir's legacy endures through theorems, algorithmic paradigms, and a generation of researchers in computational geometry and discrete mathematics. His influence is recognized in curricula at institutions such as Tel Aviv University and the Courant Institute of Mathematical Sciences, and in ongoing research programs at the Mathematical Sciences Research Institute, Fields Institute, and other centers that host workshops on topics he helped pioneer.
Category:Israeli mathematicians Category:Computational geometers