- Home
- Best Scientists - Mathematics
- Micha Sharir

Mathematics

Israel

2023

Computer Science

Israel

2023

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Mathematics
D-index
93
Citations
33,220
658
World Ranking
45
National Ranking
2

Computer Science
D-index
93
Citations
33,261
657
World Ranking
312
National Ranking
7

2023 - Research.com Computer Science in Israel Leader Award

2023 - Research.com Mathematics in Israel Leader Award

2022 - Research.com Computer Science in Israel Leader Award

2022 - Research.com Mathematics in Israel Leader Award

1997 - ACM Fellow Algorithmic motion planning; properties of Davenport-Schinzel sequences and their applications in computiational geometry; arrangements of surfaces and their relevance to geometric algorithms; subexpotential randomized (combinatorial) algorithm for linear programming.

- Combinatorics
- Geometry
- Algorithm

Micha Sharir spends much of his time researching Combinatorics, Discrete mathematics, Computational geometry, Upper and lower bounds and Plane. Specifically, his work in Combinatorics is concerned with the study of Randomized algorithm. His research integrates issues of Range searching, Voronoi diagram, Inverse and Hidden surface determination in his study of Discrete mathematics.

His work carried out in the field of Computational geometry brings together such families of science as Polyhedron, Closest pair of points problem, Face, Simple and Theory of computation. The concepts of his Upper and lower bounds study are interwoven with issues in Ackermann function, Degree and Regular polygon. Micha Sharir interconnects Binary logarithm, Family of curves and Time complexity in the investigation of issues within Plane.

- Davenport–Schinzel Sequences and their Geometric Applications (869 citations)
- On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds (731 citations)
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons (465 citations)

His primary areas of study are Combinatorics, Discrete mathematics, Plane, Set and Upper and lower bounds. His Combinatorics research focuses on Regular polygon and how it relates to Disjoint sets and Boundary. His work deals with themes such as Simple, Hyperplane and Algebraic number, which intersect with Discrete mathematics.

His Plane research integrates issues from Time complexity, Line, Binary logarithm and Unit. His Computational geometry study improves the overall literature in Algorithm. Micha Sharir works mostly in the field of Algorithm, limiting it down to concerns involving Motion planning and, occasionally, Motion.

- Combinatorics (92.36%)
- Discrete mathematics (42.16%)
- Plane (26.61%)

- Combinatorics (92.36%)
- Discrete mathematics (42.16%)
- Plane (26.61%)

Micha Sharir mostly deals with Combinatorics, Discrete mathematics, Plane, Set and Degree. Micha Sharir is studying Discrete geometry, which is a component of Combinatorics. The various areas that Micha Sharir examines in his Discrete mathematics study include Quadratic equation and Constant.

His Plane study integrates concerns from other disciplines, such as Structure, Point, Unit and Line. His research in Degree intersects with topics in Kinetic data structure, Delaunay triangulation, Algebraic variety, Surface and Variety. His study in Algebraic number is interdisciplinary in nature, drawing from both Simple, Computational geometry and Bounded function.

- Visibility Problems for Polyhedral Terrains (161 citations)
- Sharp Upper and Lower Bounds on the Length of General Davenport-Schinzel Sequences (154 citations)
- Sharp Upper and Lower Bounds on the Length of General Davenport-Schinzel Sequences (154 citations)

- Combinatorics
- Geometry
- Algorithm

His primary areas of investigation include Combinatorics, Discrete mathematics, Plane, Polynomial and Computational geometry. His study in Combinatorics focuses on Discrete geometry in particular. His Discrete mathematics research incorporates themes from Intersection, Algebraic geometry, Family of curves, Rectangle and Data structure.

His studies examine the connections between Plane and genetics, as well as such issues in Unit, with regards to Conjecture, Combinatorial mathematics and Computational complexity theory. His Computational geometry research includes elements of Disjoint sets, Motion, Ackermann function and Regular polygon. His work on Edit distance as part of general Algorithm study is frequently linked to Vertical segment, therefore connecting diverse disciplines of science.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds

Jacob T Schwartz;Micha Sharir.

Advances in Applied Mathematics **(1983)**

1141 Citations

Davenport-Schinzel sequences and their geometric applications

Micha Sharir;Pankaj K. Agarwal.

**(1995)**

1109 Citations

Two approaches to interprocedural data flow analysis

Micha Sharir;A Pnueli.

**(2011)**

1083 Citations

Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons

Leonidas J. Guibas;John Hershberger;Daniel Leven;Micha Sharir;Micha Sharir.

Algorithmica **(1987)**

755 Citations

On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers

Jacob T. Schwartz;Micha Sharir.

Communications on Pure and Applied Mathematics **(1983)**

742 Citations

Randomized incremental construction of Delaunay and Voronoi diagrams

Leonidas J. Guibas;Donald E. Knuth;Micha Sharir;Micha Sharir.

Algorithmica **(1992)**

739 Citations

Linear time algorithms for visibility and shortest path problems inside simple polygons

L Guibas;J Hershberger;D Leven;M Sharir.

**(2011)**

626 Citations

On the existence and synthesis of multifinger positive grips

Bhubaneswar Mishra;Jacob T. Schwartz;Micha Sharir;Micha Sharir.

**(2011)**

623 Citations

On the Complexity of Motion Planning for Multiple Independent Objects; Pspace Hardness of the Warehouseman's Problem

J.E. Hopcroft;J.T. Schwartz;M. Sharir.

**(2011)**

563 Citations

On shortest paths in polyhedral spaces

Micha Sharir;Amir Schorr.

SIAM Journal on Computing **(1986)**

528 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Duke University

Tel Aviv University

New York University

Alfréd Rényi Institute of Mathematics

Stanford University

Institute of Science and Technology Austria

ETH Zurich

Tel Aviv University

Princeton University

University of Arizona

University of California, Berkeley

Technical University of Denmark

Iowa State University

University of the Basque Country

Ministry of Education of the People's Republic of China

Sangamo BioSciences (United States)

University of California, Los Angeles

Tufts Medical Center

University of Oxford

University of Sydney

Stellenbosch University

Tel Aviv University

St George's, University of London

Vanderbilt University Medical Center

University of Sydney

Georgia State University

Something went wrong. Please try again later.