description Micha Sharir Overview
Micha Sharir is an Israeli mathematician and computer scientist at Tel Aviv University. He is known for proving sharp bounds in combinatorial and computational geometry, including foundational results on Davenport-Schinzel sequences and their applications. His research has also contributed to algorithmic problems in robotics, motion planning, and geometric data structures.
insights Ranking position
Micha Sharir ranks #101 of 185 in the Computer Scientist ranking, behind Larry Wall, ahead of Prabhakar Raghavan.
help Micha Sharir FAQ
What is Micha Sharir's primary area of mathematical research?
Micha Sharir is an Israeli mathematician known for his foundational work in combinatorial and computational geometry. He is particularly famous for proving sharp bounds for geometric algorithms and complex spatial data.
What are Davenport-Schinzel sequences in Sharir's research?
Sharir proved critical sharp bounds for Davenport-Schinzel sequences, which describe the maximum complexity of the lower envelope of continuous functions. This work has immense implications for understanding how geometric surfaces intersect.
Where does Micha Sharir teach?
He is a longtime professor at Tel Aviv University's School of Computer Science. Over his prestigious career, he has been recognized with the Rothschild Prize and the EMET Prize for his mathematical contributions.
What is the Sharir-Welzl algorithm?
He co-developed the Sharir-Welzl algorithm, which provides an efficient randomized solution for linear programming in small dimensions. The algorithm is a classic example of utilizing geometric data structures to solve complex optimization problems.
explore Explore More
Reviews & Comments
Write a Review
Be the first to review
Share your thoughts with the community and help others make better decisions.
