| 2020 | RECOMB | A Guided Network Propagation Approach to Identify Disease Genes that Combines Prior and New Information. | Borislav H. Hristov, Bernard Chazelle, Mona Singh |
| 2019 | FCT | Some Observations on Dynamic Random Walks and Network Renormalization. | Bernard Chazelle |
| 2016 | GECCO | The Challenges of Natural Algorithms. | Bernard Chazelle |
| 2015 | CIAC | Communication, Dynamics, and Renormalization. | Bernard Chazelle |
| 2012 | ESA | Data Structures on Event Graphs. | Bernard Chazelle, Wolfgang Mulzer |
| 2012 | FOCS | The Dynamics of Influence Systems. | Bernard Chazelle |
| 2009 | SODA | Natural algorithms. | Bernard Chazelle |
| 2007 | ICALP | Ushering in a New Era of Algorithm Design. | Bernard Chazelle |
| 2006 | SODA | Self-improving algorithms. | Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu |
| 2006 | STOC | Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform. | Nir Ailon, Bernard Chazelle |
| 2005 | FOCS | Algorithmic Techniques and Tools from Computational Geometry. | Bernard Chazelle |
| 2005 | ISMB | Whole-proteome prediction of protein function via graph-theoretic analysis of interaction maps. | Elena Nabieva, Kam Jim, Amit Agarwal, Bernard Chazelle, Mona Singh |
| 2005 | STACS | Information Theory in Property Testing and Monotonicity Testing in Higher Dimension. | Nir Ailon, Bernard Chazelle |
| 2004 | ISAAC | Property-Preserving Data Reconstruction. | Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu |
| 2004 | SODA | Who says you have to look at the input? The brave new world of sublinear computing. | Bernard Chazelle |
| 2004 | SODA | The Bloomier filter: an efficient data structure for static support lookup tables. | Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ayellet Tal |
| 2004 | STOC | Lower bounds for linear degeneracy testing. | Nir Ailon, Bernard Chazelle |
| 2003 | ESA | Sublinear Computing. | Bernard Chazelle |
| 2003 | STOC | Sublinear geometric algorithms. | Bernard Chazelle, Ding Liu, Avner Magen |
| 2002 | ECCV | A Reflective Symmetry Descriptor. | Michael M. Kazhdan, Bernard Chazelle, David P. Dobkin, Adam Finkelstein, Thomas A. Funkhouser |
| 2001 | ESA | Splitting a Delaunay Triangulation in Linear Time. | Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Merc Mora, Vera Sacristn, Monique Teillaud |
| 2001 | ICALP | Approximating the Minimum Spanning Tree Weight in Sublinear Time. | Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan |
| 2001 | STOC | Lower bounds for intersection searching and fractional cascading in higher dimension. | Bernard Chazelle, Ding Liu |
| 1999 | ESA | Geometric Searching over the Rationals. | Bernard Chazelle |
| 1999 | STOC | A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube. | Amit Chakrabarti, Bernard Chazelle, Benjamin Gum, Alexey Lvov |
| 1998 | ESA | Car-Pooling as a Data Structuring Device: The Soft Heap. | Bernard Chazelle |
| 1998 | ISAAC | The Discrepancy Method. | Bernard Chazelle |
| 1997 | FOCS | A Faster Deterministic Algorithm for Minimum Spanning Trees. | Bernard Chazelle |
| 1997 | WADS | Discrepancy Theory and Computational Geometry. | Bernard Chazelle |
| 1995 | STOC | Lower bounds for off-line range searching. | Bernard Chazelle |
| 1994 | FOCS | A Spectral Approach to Lower Bounds | Bernard Chazelle |
| 1994 | STOC | Computational geometry: a retrospective. | Bernard Chazelle |
| 1993 | FOCS | Product Range Spaces, Sensitive Sampling, and Derandomization | Herv Brnnimann, Bernard Chazelle, Jir Matousek |
| 1993 | FOCS | Geometric Discrepancy Revisited | Bernard Chazelle |
| 1993 | SODA | On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimensions. | Bernard Chazelle, Jir Matousek |
| 1993 | STOC | Improved bounds on weak epsilon-nets for convex sets. | Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl |
| 1992 | ICALP | Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine. | Bernard Chazelle, Burton Rosenberg |
| 1991 | FOCS | An Optimal Convex Hull Algorithm and New Results on Cuttings (Extended Abstract) | Bernard Chazelle |
| 1991 | ICALP | Computational Geometry for the Gourmet: Old Fare and New Dishes. | Bernard Chazelle |
| 1991 | ICALP | Ray Shooting in Polygons Using Geodesic Triangulations. | Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink |
| 1991 | SODA | Computing a Face in an Arrangement of Line Segments. | Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink |
| 1990 | FOCS | Triangulating a Simple Polygon in Linear Time | Bernard Chazelle |
| 1990 | FOCS | Counting and Cutting Cycles of Lines and Rods in Space | Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink |
| 1989 | FOCS | An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra (Detailed Abstract) | Bernard Chazelle |
| 1989 | ICALP | A Singly-Expenential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications. | Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir |
| 1989 | STOC | Lines in Space-Combinatorics, Algorithms and Applications | Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir |
| 1988 | FOCS | An Optimal Algorithm for Intersecting Line Segments in the Plane | Bernard Chazelle, Herbert Edelsbrunner |
| 1988 | FOCS | A Deterministic View of Random Sampling and its Use in Geometry | Bernard Chazelle, Joel Friedman |
| 1987 | FOCS | Polytope Range Searching and Integral Geometry (Extended Abstract) | Bernard Chazelle |
| 1987 | STOC | The Complexity of Cutting Convex Polytopes | Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas |
| 1986 | FOCS | Lower Bounds on the Complexity of Multidimensional Searching (Extended Abstract) | Bernard Chazelle |
| 1985 | FOCS | Parallel Computational Geometry (Extended Abstract) | Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm 'Dnlaing, Chee-Keng Yap |
| 1985 | FOCS | Slimming Down Search Structures: A Functional Approach to Algorithm Design | Bernard Chazelle |
| 1985 | ICALP | Optimal Solutions for a Class of Point Retrieval Problems. | Bernard Chazelle, Herbert Edelsbrunner |
| 1985 | ICALP | Fractional Cascading: A Data Structuring Technique with Geometric Applications. | Bernard Chazelle, Leonidas J. Guibas |
| 1984 | FOCS | Computing on a Free Tree via Complexity-Preserving Mappings | Bernard Chazelle |
| 1984 | ICALP | The Complexity and Decidability of Separation. | Bernard Chazelle, Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood |
| 1984 | STOC | Intersecting Is Easier than Sorting | Bernard Chazelle |
| 1984 | STACS | Computing the Largest Empty Rectangle. | Bernard Chazelle, Robert L. (Scot) Drysdale III, D. T. Lee |
| 1983 | FCT | How to Search in History. | Bernard Chazelle |
| 1983 | FOCS | Filtering Search: A New Approach to Query-Answering | Bernard Chazelle |
| 1983 | FOCS | The Power of Geometric Duality | Bernard Chazelle, Leonidas J. Guibas, D. T. Lee |
| 1982 | FOCS | A Theorem on Polygon Cutting with Applications | Bernard Chazelle |
| 1981 | STOC | Convex Decompositions of Polyhedra | Bernard Chazelle |
| 1981 | STOC | A Model of Computation for VLSI with Related Complexity Results | Bernard Chazelle, Louis Monier |
| 1980 | STOC | Detection is Easier than Computation (Extended Abstract) | Bernard Chazelle, David P. Dobkin |
| 1979 | STOC | Decomposing a Polygon into its Convex Parts | Bernard Chazelle, David P. Dobkin |