2026 Bernard Chazelle: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	81	1027	995	547	527	247	25926

Research.com Recognitions

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

Overview

Bernard Chazelle is affiliated with Princeton University in the United States and has contributed significantly to research in the field of Biochemistry, Genetics and Molecular Biology.

Their main research areas include Bioinformatics and Genomic Networks, Gene expression and cancer classification, Mathematical and Theoretical Epidemiology and Ecology Models, Diffusion and Search Dynamics, Genomics and Phylogenetic Studies, RNA and protein synthesis mechanisms, and Genomics and Chromatin Dynamics.

Their subfields of study emphasize Molecular Biology, Computer Vision and Pattern Recognition, Genetics, Public Health, Environmental and Occupational Health, and Modeling and Simulation.

Bernard Chazelle has published several papers across various venues. Recent publications include:

"uKIN Combines New and Prior Information with Guided Network Propagation to Accurately Identify Disease Genes", 2020, Cell Systems
"PertInInt: An Integrative, Analytical Approach to Rapidly Uncover Cancer Driver Genes with Perturbed Interactions and Functionalities", 2020, Cell Systems
"Network-augmented compartmental models to track asymptomatic disease spread", 2023, Bioinformatics Advances
"A Guided Network Propagation Approach to Identify Disease Genes that Combines Prior and New Information", 2020, Lecture notes in computer science
"Quick Relaxation in Collective Motion", 2022, arXiv (Cornell University)

Frequent co-authors working with Bernard Chazelle include Mona Singh, Kritkorn Karntikoon, Borislav H. Hristov, Devavrat Vivek Dabke, and Shilpa N. Kobren.

The scientist has published in well-known academic venues, notably:

arXiv (Cornell University)
Cell Systems
Bioinformatics Advances
Lecture notes in computer science
2022 IEEE 61st Conference on Decision and Control (CDC)

Awards and recognitions received by Bernard Chazelle comprise:

Fellow of the American Academy of Arts and Sciences, 2004
Member of the European Academy of Sciences, 2003
ACM Fellow, 1996, for fundamental contributions in the design and analysis of algorithms in computational geometry
Fellow of John Simon Guggenheim Memorial Foundation, 1994

Best Publications

Shape distributions

Robert Osada;Thomas Funkhouser;Bernard Chazelle;David Dobkin

2394
Citations
Triangulating a simple polygon in linear time

Bernard Chazelle

1111
Citations
Matching 3D models with shape distributions

R. Osada;T. Funkhouser;B. Chazelle;D. Dobkin;D. Dobkin

912
Citations
An optimal algorithm for intersecting line segments in the plane

Bernard Chazelle;Herbert Edelsbrunner

722
Citations
The Discrepancy Method: Randomness and Complexity

Bernard Chazelle

668
Citations
Fractional cascading: I. A data structuring technique

Bernard Chazelle;Leonidas J. Guibas

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

Elena Nabieva;Kam Jim;Amit Agarwal;Bernard Chazelle

603
Citations
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform

Nir Ailon;Bernard Chazelle

585
Citations
Filtering search: a new approach to query answering

Bernard Chazelle

569
Citations
An optimal convex hull algorithm in any fixed dimension

Bernard Chazelle

547
Citations
The Fast Johnson-Lindenstrauss Transform and Approximate Nearest Neighbors

Nir Ailon;Bernard Chazelle

532
Citations
Parallel Computational Geometry

Alok Aggarwal;Bernard Chazelle;Leo Guibas;Colm O'Dunlaing

515
Citations
The Bloomier filter: an efficient data structure for static support lookup tables

Bernard Chazelle;Joe Kilian;Ronitt Rubinfeld;Ayellet Tal

509
Citations
A minimum spanning tree algorithm with inverse-Ackermann type complexity

Bernard Chazelle

492
Citations
The power of geometric duality

Bernard Chazelle;Leo J. Guibas;D. T. Lee

452
Citations
Functional approach to data structures and its use in multidimensional searching

Bernard Chazelle

449
Citations
Cutting hyperplanes for divide-and-conquer

Bernard Chazelle

404
Citations
A deterministic view of random sampling and its use in geometry

Bernard Chazelle;Joel Friedman

392
Citations
A theorem on polygon cutting with applications

Bernard Chazelle

388
Citations
Visibility and intersection problems in plane geometry

Bernard Chazelle;Leonidas J. Guibas

371
Citations
The Discrepancy Method

Bernard Chazelle;Bernard Chazelle

284
Citations

Frequent Co-Authors

Herbert Edelsbrunner Institute of Science and Technology Austria

Micha Sharir Tel Aviv University

Leonidas J. Guibas Stanford University

David P. Dobkin Princeton University

Ayellet Tal Technion – Israel Institute of Technology

Jack Snoeyink University of North Carolina at Chapel Hill

Emo Welzl ETH Zurich

Raimund Seidel Saarland University

Der-Tsai Lee Academia Sinica

Ronitt Rubinfeld MIT

External Links

Wikipedia of Bernard Chazelle Personal website of Bernard Chazelle Google Scholar page

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

Related Online Degrees & Career Pathways

Studying Computer Science in the USA opens doors to a variety of rewarding online degree options and career pathways. Many students consider Computer Science among the best college majors due to its high demand and versatile applications across industries.

If you’re planning further studies, you might wonder what is the easiest masters degree to pursue online. While “easiest” is subjective, many master’s programs focus on flexible coursework and accelerated formats, making it easier for busy professionals to advance their careers.

For those considering doctoral-level education, there are affordable phd programs that provide rigorous training without a hefty financial burden. Additionally, some educators and professionals look for the fastest online edd programs to quickly gain advanced skills and credentials.

With the vast array of online degrees available, students can tailor their learning experience to match their career goals while balancing flexibility, affordability, and academic rigor.