Micha Sharir

Micha Sharir
Micha Sharir
Born 1950 (1950)
Tel Aviv, Israel
Nationality Israeli
Alma mater Tel Aviv University
Doctoral advisor Aldo Lazar
Known for Work in computational geometry


Micha Sharir (Hebrew: מיכה שריר‎; born 1950 in Tel Aviv, Israel) is a professor of computer science at Tel Aviv University, known for his work in computational geometry.

After completing his undergraduate studies at Tel Aviv University in 1970, Sharir received a Ph.D. in mathematics from Tel Aviv in 1976 under the supervision of Aldo Lazar. After continuing his studies with Jack Schwartz at New York University, he joined the faculty at Tel Aviv in 1980, where he now holds the Isaias Nizri Chair in Computational Geometry and Robotics.[1][2]

Sharir was named a Fellow of the Association for Computing Machinery in 1997.[3] He received an honorary doctorate from Utrecht University in 1996, the Feher Foundation Prize in Computer Science from the Jerusalem Institute for Israel Studies in 1999, the Landau Prize for Science and Research in 2002, and the million-dollar EMET Prize in the Exact Sciences from the A.M.N. Foundation in 2007.[1]

Sharir has published over 250 scientific papers[1] and is an ISI highly cited researcher.[4] Along with his Tel Aviv professorship, Sharir holds a research faculty position at New York University.[5]

References

External links



Wikimedia Foundation. 2010.

Игры ⚽ Нужен реферат?

Look at other dictionaries:

  • Suite de Davenport-Schinzel — En combinatoire, une suite de Davenport Schinzel est une suite de symboles dans laquelle le nombre de fois où deux symboles peuvent apparaître en alternance est limité. La longueur d une suite de Davenport Schinzel est limitée par le nombre de… …   Wikipédia en Français

  • List of books in computational geometry — This is a list of books in computational geometry. There are two major, largely nonoverlapping categories: *Combinatorial computational geometry, which deals with collections of discrete objects or defined in discrete terms: points, lines,… …   Wikipedia

  • Output-sensitive algorithm — In computer science, an output sensitive algorithm is an algorithm whose running time depends not only on the size of the input but also on the size of the output. For certain problems where the output size varies widely, for example from linear… …   Wikipedia

  • List of people by Erdős number — Paul Erdős was one of the most prolific writers of mathematical papers. He collaborated a great deal, having 511 joint authors, a number of whom also have many collaborators. The Erdős number measures the collaborative distance between an author… …   Wikipedia

  • Max-Planck-Forschungspreis — Der Max Planck Forschungspreis fördert internationale Kooperationen deutscher und ausländischer Wissenschaftler, „von denen im Rahmen internationaler Kooperationen weitere wissenschaftliche Spitzenleistungen erwartet werden“. Das Programm… …   Deutsch Wikipedia

  • Davenport–Schinzel sequence — In combinatorics, a Davenport–Schinzel sequence is a sequence of symbols in which the number of times any two symbols may appear in alternation is limited. The maximum possible length of a Davenport–Schinzel sequence is bounded by the number of… …   Wikipedia

  • POLITICAL LIFE AND PARTIES — Introduction It was largely due to the existence of the pre state political parties, which had conducted intensive political activities for almost half a century within the framework of the yishuv , under the British Mandate for Palestine, that… …   Encyclopedia of Judaism

  • Benjamin Netanyahu — בנימין נתניהו Prime Minister of Israel Incumbent Assumed office 31 March 2009 …   Wikipedia

  • Minkowski addition — The red figure is the Minkowski sum of blue and green figures. In geometry, the Minkowski sum (also known as dilation) of two sets A and B in Euclidean space is the result of adding every element of …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”