2023 - Research.com Mathematics in United States Leader Award
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
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 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.
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.
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.
Robert Osada;Thomas Funkhouser;Bernard Chazelle;David Dobkin.
ACM Transactions on Graphics (2002)
Triangulating a simple polygon in linear time
Discrete and Computational Geometry (1991)
Matching 3D models with shape distributions
R. Osada;T. Funkhouser;B. Chazelle;D. Dobkin;D. Dobkin.
international conference on shape modeling and applications (2001)
An optimal algorithm for intersecting line segments in the plane
Bernard Chazelle;Herbert Edelsbrunner.
Journal of the ACM (1992)
The Discrepancy Method: Randomness and Complexity
Fractional cascading: I. A data structuring technique
Bernard Chazelle;Leonidas J. Guibas.
Whole-proteome prediction of protein function via graph-theoretic analysis of interaction maps
Elena Nabieva;Kam Jim;Amit Agarwal;Bernard Chazelle.
Filtering search: a new approach to query answering
SIAM Journal on Computing (1986)
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
Nir Ailon;Bernard Chazelle.
symposium on the theory of computing (2006)
An optimal convex hull algorithm in any fixed dimension
Discrete and Computational Geometry (1993)
If you think any of the details on this page are incorrect, let us know.
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: