H-Index & Metrics Top Publications

H-Index & Metrics

Discipline name H-index Citations Publications World Ranking National Ranking
Mathematics H-index 71 Citations 20,952 148 World Ranking 116 National Ranking 65
Computer Science H-index 73 Citations 22,034 153 World Ranking 669 National Ranking 409

Research.com Recognitions

Awards & Achievements

2004 - Fellow of the American Academy of Arts and Sciences

2003 - Member of the European Academy of Sciences

1996 - ACM Fellow Bernard Chazelle has made fundamental contributions in the design and analysis of algorithms in computational geometry.

1994 - Fellow of John Simon Guggenheim Memorial Foundation


What is he best known for?

The fields of study he is best known for:

  • Algorithm
  • Geometry
  • Artificial intelligence

Bernard Chazelle spends much of his time researching Combinatorics, Algorithm, Computational geometry, Discrete mathematics and Time complexity. His research integrates issues of Intersection, Convex combination and Simple polygon, Regular polygon in his study of Combinatorics. His Algorithm research is multidisciplinary, incorporating elements of Output-sensitive algorithm, Theoretical computer science and Discrepancy theory.

Bernard Chazelle combines subjects such as Simple, Type, Rectangle, Distribution and Calculus with his study of Computational geometry. His work investigates the relationship between Discrete mathematics and topics such as Linear programming that intersect with problems in Integer programming, Position and Heuristic. His Time complexity research incorporates elements of Randomized algorithm and Probabilistic analysis of algorithms.

His most cited work include:

  • Shape distributions (1442 citations)
  • Triangulating a simple polygon in linear time (566 citations)
  • Matching 3D models with shape distributions (542 citations)

What are the main themes of his work throughout his whole career to date?

His primary scientific interests are in Combinatorics, Discrete mathematics, Algorithm, Computational geometry and Upper and lower bounds. He has included themes like Range searching, Convex hull and Convex polytope in his Combinatorics study. His study focuses on the intersection of Discrete mathematics and fields such as Monotonic function with connections in the field of Property testing.

His Algorithm research is multidisciplinary, incorporating elements of Voronoi diagram, Theoretical computer science, Output-sensitive algorithm and Distribution. His Computational geometry research includes themes of Line segment and Discrepancy theory. The various areas that Bernard Chazelle examines in his Time complexity study include Plane and Deterministic algorithm.

He most often published in these fields:

  • Combinatorics (45.29%)
  • Discrete mathematics (27.90%)
  • Algorithm (25.72%)

What were the highlights of his more recent work (between 2011-2020)?

  • Statistical physics (5.07%)
  • Theoretical computer science (11.59%)
  • Conjecture (3.62%)

In recent papers he was focusing on the following fields of study:

His scientific interests lie mostly in Statistical physics, Theoretical computer science, Conjecture, Almost surely and Gene. His research investigates the connection with Theoretical computer science and areas like Successor cardinal which intersect with concerns in Efficient algorithm and Event graph. The Almost surely study combines topics in areas such as Probabilistic logic, Graph, Mixing and Social network.

Bernard Chazelle works mostly in the field of Function, limiting it down to concerns involving Logarithm and, occasionally, Algorithm. The study incorporates disciplines such as Voronoi diagram, Convex geometry and Regular polygon in addition to Algorithm. His Discrete mathematics research integrates issues from Carry and Point.

Between 2011 and 2020, his most popular works were:

  • Parallel Computational Geometry (62 citations)
  • On the convergence of the Hegselmann-Krause system (60 citations)
  • Inertial Hegselmann-Krause Systems (35 citations)

In his most recent research, the most cited papers focused on:

  • Algorithm
  • Geometry
  • Artificial intelligence

The scientist’s investigation covers issues in Conjecture, Applied mathematics, Inertial frame of reference, Statistical physics and Equivalence. His Conjecture research is multidisciplinary, incorporating perspectives in Real line and Finite set. His Applied mathematics research incorporates themes from Asymptotic computational complexity, Mathematical optimization, Flocking and Well posedness.

Statistical physics combines with fields such as Dynamic network analysis, Almost surely, Multi-agent system, Type and Bifurcation analysis in his work. His Dynamic network analysis research is multidisciplinary, relying on both Dynamical systems theory, Control theory and Turing machine. His studies link Artificial intelligence with Equivalence.

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.

Top Publications

Shape distributions

Robert Osada;Thomas Funkhouser;Bernard Chazelle;David Dobkin.
ACM Transactions on Graphics (2002)

2106 Citations

Triangulating a simple polygon in linear time

Bernard Chazelle.
Discrete and Computational Geometry (1991)

906 Citations

Matching 3D models with shape distributions

R. Osada;T. Funkhouser;B. Chazelle;D. Dobkin.
international conference on shape modeling and applications (2001)

836 Citations

The Discrepancy Method: Randomness and Complexity

Bernard Chazelle.

596 Citations

An optimal algorithm for intersecting line segments in the plane

Bernard Chazelle;Herbert Edelsbrunner.
Journal of the ACM (1992)

589 Citations

Fractional cascading: I. A data structuring technique

Bernard Chazelle;Leonidas J. Guibas.
Algorithmica (1986)

578 Citations

Whole-proteome prediction of protein function via graph-theoretic analysis of interaction maps

Elena Nabieva;Kam Jim;Amit Agarwal;Bernard Chazelle.
Bioinformatics (2005)

531 Citations

Filtering search: a new approach to query answering

Bernard Chazelle.
SIAM Journal on Computing (1986)

449 Citations

Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform

Nir Ailon;Bernard Chazelle.
symposium on the theory of computing (2006)

446 Citations

An optimal convex hull algorithm in any fixed dimension

Bernard Chazelle.
Discrete and Computational Geometry (1993)

440 Citations

Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.

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

Contact us

Top Scientists Citing Bernard Chazelle

Micha Sharir

Micha Sharir

Tel Aviv University

Publications: 266

Pankaj K. Agarwal

Pankaj K. Agarwal

Duke University

Publications: 143

Michael T. Goodrich

Michael T. Goodrich

University of California, Irvine

Publications: 100

Timothy M. Chan

Timothy M. Chan

University of Illinois at Urbana-Champaign

Publications: 90

Leonidas J. Guibas

Leonidas J. Guibas

Stanford University

Publications: 84

Boris Aronov

Boris Aronov

New York University

Publications: 82

Danny Z. Chen

Danny Z. Chen

University of Notre Dame

Publications: 73

Mark de Berg

Mark de Berg

Eindhoven University of Technology

Publications: 69

Sariel Har-Peled

Sariel Har-Peled

University of Illinois at Urbana-Champaign

Publications: 69

Joseph S. B. Mitchell

Joseph S. B. Mitchell

Stony Brook University

Publications: 67

János Pach

János Pach

Alfréd Rényi Institute of Mathematics

Publications: 62

David Eppstein

David Eppstein

University of California, Irvine

Publications: 61

Godfried T. Toussaint

Godfried T. Toussaint

New York University Abu Dhabi

Publications: 60

Subhash Suri

Subhash Suri

University of California, Santa Barbara

Publications: 59

Jack Snoeyink

Jack Snoeyink

University of North Carolina at Chapel Hill

Publications: 52

Something went wrong. Please try again later.