Bernard Chazelle

Arnab Bhattacharyya, Mark Braverman, Bernard Chazelle, Huy L. Nguyen: On the convergence of the Hegselmann-Krause system. ITCS 2013: 61-66

Bernard Chazelle: Natural algorithms and influence systems. Commun. ACM 55(12): 101-110 (2012)

Bernard Chazelle, Wolfgang Mulzer: Data Structures on Event Graphs. ESA 2012: 313-324

Bernard Chazelle: The Dynamics of Influence Systems. FOCS 2012: 311-320

Bernard Chazelle: The Dynamics of Influence Systems. CoRR abs/1204.3946 (2012)

Bernard Chazelle, Wolfgang Mulzer: Data Structures on Event Graphs. CoRR abs/1206.6193 (2012)

Arnab Bhattacharyya, Mark Braverman, Bernard Chazelle, Huy L. Nguyen: On the Convergence of the Hegselmann-Krause System. CoRR abs/1211.1909 (2012)

Bernard Chazelle, Wolfgang Mulzer: Computing Hereditary Convex Structures. Discrete & Computational Geometry 45(4): 796-823 (2011)

Bernard Chazelle, C. Seshadhri: Online geometric reconstruction. J. ACM 58(4): 14 (2011)

Bernard Chazelle: The Total s-Energy of a Multiagent System. SIAM J. Control and Optimization 49(4): 1680-1706 (2011)

Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri: Self-Improving Algorithms. SIAM J. Comput. 40(2): 350-375 (2011)

Bernard Chazelle (Ed.): Innovations in Computer Science - ICS 2010, Tsinghua University, Beijing, China, January 7-9, 2011. Proceedings. Tsinghua University Press 2011, isbn 978-7-302-24517-9

Nir Ailon, Bernard Chazelle: Faster dimension reduction. Commun. ACM 53(2): 97-104 (2010)

Bernard Chazelle: The geometry of flocking. Symposium on Computational Geometry 2010: 19-28

Bernard Chazelle: A geometric approach to collective motion. Symposium on Computational Geometry 2010: 117-126

Bernard Chazelle: Analytical Tools for Natural Algorithms. ICS 2010: 32-41

Bernard Chazelle: The Total s-Energy of a Multiagent System. CoRR abs/1004.1447 (2010)

Bernard Chazelle, Wolfgang Mulzer: Markov Incremental Constructions. Discrete & Computational Geometry 42(3): 399-420 (2009)

Nir Ailon, Bernard Chazelle: The Fast Johnson--Lindenstrauss Transform and Approximate Nearest Neighbors. SIAM J. Comput. 39(1): 302-322 (2009)

Eric Banks, Elena Nabieva, Bernard Chazelle, Ryan Peterson, Mona Singh: Analyzing and Interrogating Biological Networks (Abstract). BICoB 2009: 14-15

Bernard Chazelle, Wolfgang Mulzer: Computing hereditary convex structures. Symposium on Computational Geometry 2009: 61-70

Bernard Chazelle: Natural algorithms. SODA 2009: 422-431

Bernard Chazelle: The Convergence of Bird Flocking. CoRR abs/0905.4241 (2009)

Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri: Self-Improving Algorithms. CoRR abs/0907.0884 (2009)

Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu: Property-Preserving Data Reconstruction. Algorithmica 51(2): 160-182 (2008)

Bernard Chazelle: Technical perspective: finding a good neighbor, near and fast. Commun. ACM 51(1): 115 (2008)

Bernard Chazelle, Ding Liu, Avner Magen: Approximate range searching in higher dimension. Comput. Geom. 39(1): 24-29 (2008)

Eric Banks, Elena Nabieva, Bernard Chazelle, Mona Singh: Organization of Physical Interactomes as Uncovered by Network Schemas. PLoS Computational Biology 4(10) (2008)

Bernard Chazelle, Wolfgang Johann Heinrich Mulzer: Markov incremental constructions. Symposium on Computational Geometry 2008: 156-163

Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu: Estimating the distance to a monotone function. Random Struct. Algorithms 31(3): 371-383 (2007)

Bernard Chazelle: Ushering in a New Era of Algorithm Design. ICALP 2007: 1

Nir Ailon, Bernard Chazelle: Information theory in property testing and monotonicity testing in higher dimension. Inf. Comput. 204(11): 1704-1717 (2006)

Bernard Chazelle, C. Seshadhri: Online geometric reconstruction. Symposium on Computational Geometry 2006: 386-394

Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu: Self-improving algorithms. SODA 2006: 261-270

Nir Ailon, Bernard Chazelle: Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform. STOC 2006: 557-563

Carleton L. Kingsford, Bernard Chazelle, Mona Singh: Solving and analyzing side-chain positioning problems using linear and integer programming. Bioinformatics 21(7): 1028-1039 (2005)

Sanjeev Arora, Bernard Chazelle: Is the thrill gone? Commun. ACM 48(8): 31-33 (2005)

Nir Ailon, Bernard Chazelle: Lower bounds for linear degeneracy testing. J. ACM 52(2): 157-171 (2005)

Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan: Approximating the Minimum Spanning Tree Weight in Sublinear Time. SIAM J. Comput. 34(6): 1370-1379 (2005)

Bernard Chazelle, Ding Liu, Avner Magen: Sublinear Geometric Algorithms. SIAM J. Comput. 35(3): 627-646 (2005)

Bernard Chazelle, Ding Liu, Avner Magen: Sublinear Geometric Algorithms. Sublinear Algorithms 2005

Bernard Chazelle: Algorithmic Techniques and Tools from Computational Geometry. FOCS 2005: 7

Elena Nabieva, Kam Jim, Amit Agarwal, Bernard Chazelle, Mona Singh: Whole-proteome prediction of protein function via graph-theoretic analysis of interaction maps. ISMB (Supplement of Bioinformatics) 2005: 302-310

Nir Ailon, Bernard Chazelle: Information Theory in Property Testing and Monotonicity Testing in Higher Dimension. STACS 2005: 434-447

Bernard Chazelle: The Power of Nonmonotonicity in Geometric Searching. Discrete & Computational Geometry 31(1): 3-16 (2004)

Bernard Chazelle, Carl Kingsford, Mona Singh: A Semidefinite Programming Approach to Side Chain Positioning with New Rounding Strategies. INFORMS Journal on Computing 16(4): 380-392 (2004)

Bernard Chazelle, Ding Liu: Lower bounds for intersection searching and fractional cascading in higher dimension. J. Comput. Syst. Sci. 68(2): 269-284 (2004)

Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu: Estimating the Distance to a Monotone Function. APPROX-RANDOM 2004: 229-236

Ding Liu, Bernard Chazelle, Avner Magen: Approximate range searching in higher dimension. CCCG 2004: 154-157

Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu: Property-Preserving Data Reconstruction. ISAAC 2004: 16-27

Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ayellet Tal: The Bloomier filter: an efficient data structure for static support lookup tables. SODA 2004: 30-39

Bernard Chazelle: Who says you have to look at the input? The brave new world of sublinear computing. SODA 2004: 141

Nir Ailon, Bernard Chazelle: Lower bounds for linear degeneracy testing. STOC 2004: 554-560

Nir Ailon, Bernard Chazelle: Information Theory in Property Testing and Monotonicity Testing in Higher Dimension. Electronic Colloquium on Computational Complexity (ECCC)(068) (2004)

Michael M. Kazhdan, Bernard Chazelle, David P. Dobkin, Thomas A. Funkhouser, Szymon Rusinkiewicz: A Reflective Symmetry Descriptor for 3D Models. Algorithmica 38(1): 201-225 (2003)

Bernard Chazelle, Carl Kingsford, Mona Singh: The Side-Chain Positioning Problem: A Semidefinite Programming Formulation With New Rounding Schemes. PCK50 2003: 86-94

Bernard Chazelle: Sublinear Computing. ESA 2003: 1

Bernard Chazelle, Ding Liu, Avner Magen: Sublinear geometric algorithms. STOC 2003: 531-540

Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristan, Monique Teillaud: Splitting a Delaunay Triangulation in Linear Time. Algorithmica 34(1): 39-46 (2002)

Robert Osada, Thomas A. Funkhouser, Bernard Chazelle, David P. Dobkin: Shape distributions. ACM Trans. Graph. 21(4): 807-832 (2002)

Bernard Chazelle: The power of nonmonotonicity in geometric searching. Symposium on Computational Geometry 2002: 88-93

Michael M. Kazhdan, Bernard Chazelle, David P. Dobkin, Adam Finkelstein, Thomas A. Funkhouser: A Reflective Symmetry Descriptor. ECCV (2) 2002: 642-656

Bernard Chazelle: The discrepancy method - randomness and complexity. Cambridge University Press 2001, isbn 978-0-521-00357-5, pp. I-XVIII, 1-475

Bernard Chazelle, Alexey Lvov: The Discrepancy of Boxes in Higher Dimension. Discrete & Computational Geometry 25(4): 519-524 (2001)

Bernard Chazelle, Alexey Lvov: A Trace Bound for the Hereditary Discrepancy. Discrete & Computational Geometry 26(2): 221-231 (2001)

Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristan, Monique Teillaud: Splitting a Delaunay Triangulation in Linear Time. ESA 2001: 312-320

Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan: Approximating the Minimum Spanning Tree Weight in Sublinear Time. ICALP 2001: 190-200

Robert Osada, Thomas A. Funkhouser, Bernard Chazelle, David P. Dobkin: Matching 3D Models with Shape Distributions. Shape Modeling International 2001: 154-166

Bernard Chazelle, Ding Liu: Lower bounds for intersection searching and fractional cascading in higher dimension. STOC 2001: 322-329

Sigal Ar, Bernard Chazelle, Ayellet Tal: Self-customized BSP trees for collision detection. Comput. Geom. 15(1-3): 91-102 (2000)

Bernard Chazelle: The soft heap: an approximate priority queue with optimal error rate. J. ACM 47(6): 1012-1027 (2000)

Bernard Chazelle: A minimum spanning tree algorithm with Inverse-Ackermann type complexity. J. ACM 47(6): 1028-1047 (2000)

Bernard Chazelle, Alexey Lvov: A trace bound for the hereditary discrepancy. Symposium on Computational Geometry 2000: 64-69

Bernard Chazelle: Irregularities of Distribution, Derandomization, and Complexity Theory. FSTTCS 2000: 46-54

Hervé Brönnimann, Bernard Chazelle, Jirí Matousek: Product Range Spaces, Sensitive Sampling, and Derandomization. SIAM J. Comput. 28(5): 1552-1575 (1999)

Bernard Chazelle: Geometric Searching over the Rationals. ESA 1999: 354-365

Amit Chakrabarti, Bernard Chazelle, Benjamin Gum, Alexey Lvov: A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube. STOC 1999: 305-311

Hervé Brönnimann, Bernard Chazelle: Optimal slope selection via cuttings. Comput. Geom. 10(1): 23-29 (1998)

Bernard Chazelle: A Spectral Approach to Lower Bounds with Applications to Geometric Searching. SIAM J. Comput. 27(2): 545-556 (1998)

Bernard Chazelle: Car-Pooling as a Data Structuring Device: The Soft Heap. ESA 1998: 35-42

Bernard Chazelle: The Discrepancy Method. ISAAC 1998: 1-3

Bernard Chazelle, Leonidas Palios: Decomposing the Boundary of a Nonconvex Polyhedron. Algorithmica 17(3): 245-265 (1997)

Bernard Chazelle, David P. Dobkin, Nadia Shouraboura, Ayellet Tal: Strategies for Polyhedral Surface Decomposition: an Experimental Study. Comput. Geom. 7: 327-342 (1997)

Bernard Chazelle: Lower Bounds for Off-Line Range Searching. Discrete & Computational Geometry 17(1): 53-65 (1997)

Bernard Chazelle: A Faster Deterministic Algorithm for Minimum Spanning Trees. FOCS 1997: 22-31

Bernard Chazelle: Discrepancy Theory and Computational Geometry. WADS 1997: 1-2

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jorge Stolfi: Lines in Space: Combinatorics and Algorithms. Algorithmica 15(5): 428-447 (1996)

Gill Barequet, Bernard Chazelle, Leonidas J. Guibas, Joseph S. B. Mitchell, Ayellet Tal: BOXTREE: A Hierarchical Representation for Surfaces in 3D. Comput. Graph. Forum 15(3): 387-396 (1996)

Bernard Chazelle, Jirí Matousek: On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension. J. Algorithms 21(3): 579-597 (1996)

Bernard Chazelle: The Computational Geometry Impact Task Force Report: An Executive Summary. WACG 1996: 59-65

Bernard Chazelle, Jirí Matousek: Derandomizing an Output-sensitive Convex Hull Algorithm in Three Dimensions. Comput. Geom. 5: 27-32 (1995)

Bernard Chazelle, Burton Rosenberg: Simplex Range Reporting on a Pointer Machine. Comput. Geom. 5: 237-247 (1995)

Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl: Improved Bounds on Weak epsilon-Nets for Convex Sets. Discrete & Computational Geometry 13: 1-15 (1995)

Bernard Chazelle, Jirí Matousek, Micha Sharir: An Elementary Approach to Lower Bounds in Geometric Discrepancy. Discrete & Computational Geometry 13: 363-381 (1995)

Bernard Chazelle, Nadia Shouraboura: Bounds on the Size of Tetrahedralizations. Discrete & Computational Geometry 14(4): 429-444 (1995)

Bernard Chazelle, David P. Dobkin, Nadia Shouraboura, Ayellet Tal: Strategies for Polyhedral Surface Decomposition: An Experimental Study. Symposium on Computational Geometry 1995: 297-305

Bernard Chazelle, David P. Dobkin, Nadia Shouraboura, Ayellet Tal: Convex Surface Decomposition. Symposium on Computational Geometry 1995: V9-V10

Bernard Chazelle: Lower bounds for off-line range searching. STOC 1995: 733-740

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir: Algorithms for Bichromatic Line-Segment Problems Polyhedral Terrains. Algorithmica 11(2): 116-132 (1994)

Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink: Ray Shooting in Polygons Using Geodesic Triangulations. Algorithmica 12(1): 54-68 (1994)

Bernard Chazelle, Joel Friedman: Point Location Among Hyperplanes and Unidirectional Ray-shooting. Comput. Geom. 4: 53-62 (1994)

Reuven Bar-Yehuda, Bernard Chazelle: Triangulating disjoint Jordan chains. Int. J. Comput. Geometry Appl. 4(4): 475-481 (1994)

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir: Selecting Heavily Covered Points. SIAM J. Comput. 23(6): 1138-1151 (1994)

Hervé Brönnimann, Bernard Chazelle: Optimal Slope Selection Via Cuttings. CCCG 1994: 99-103

Bernard Chazelle, Nadia Shouraboura: Bounds on the Size of Tetrahedralizations. Symposium on Computational Geometry 1994: 231-239

Bernard Chazelle: A Spectral Approach to Lower Bounds. FOCS 1994: 674-682

Bernard Chazelle: Computational geometry: a retrospective. STOC 1994: 75-94

Bernard Chazelle: Cutting Hyperplanes for Divide-and-Conquer. Discrete & Computational Geometry 9: 145-158 (1993)

Hervé Brönnimann, Bernard Chazelle, János Pach: How Hard Is Half-Space Range Searching. Discrete & Computational Geometry 10: 143-155 (1993)

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir: Diameter, Width, Closest Line Pair, and Parametric Searching. Discrete & Computational Geometry 10: 183-196 (1993)

Bernard Chazelle: An Optimal Convex Hull Algorithm in Any Fixed Dimension. Discrete & Computational Geometry 10: 377-409 (1993)

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink: Computing a Face in an Arrangement of Line Segments and Related Problems. SIAM J. Comput. 22(6): 1286-1302 (1993)

Bernard Chazelle: Geometric Discrepancy Revisited. FOCS 1993: 392-399

Hervé Brönnimann, Bernard Chazelle, Jirí Matousek: Product Range Spaces, Sensitive Sampling, and Derandomization. FOCS 1993: 400-409

Bernard Chazelle, Jirí Matousek: On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimensions. SODA 1993: 281-290

Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl: Improved bounds on weak epsilon-nets for convex sets. STOC 1993: 495-504

Bernard Chazelle, Micha Sharir, Emo Welzl: Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems. Algorithmica 8(5&6): 407-429 (1992)

Bernard Chazelle, Herbert Edelsbrunner: An Optimal Algorithm for Intersecting Line Segments in the Plane. J. ACM 39(1): 1-54 (1992)

Bernard Chazelle: An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra. SIAM J. Comput. 21(4): 671-696 (1992)

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir: Diameter, Width, Closest Line Pair, and Parametric Searching. Symposium on Computational Geometry 1992: 120-129

Hervé Brönnimann, Bernard Chazelle: How Hard is Halfspace Range Searching? Symposium on Computational Geometry 1992: 271-275

Bernard Chazelle, Burton Rosenberg: Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine. ICALP 1992: 439-449

Bernard Chazelle, Leonidas Palios: Decomposing the Boundary of a Nonconvex Polyhedron. SWAT 1992: 364-375

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink: Counting and Cutting Cycles of Lines and Rods in Space. Comput. Geom. 1: 305-323 (1991)

Boris Aronov, Bernard Chazelle, Herbert Edelsbrunner: Points and Triangles in the Plane and Halving Planes in Space. Discrete & Computational Geometry 6: 435-442 (1991)

Bernard Chazelle: Triangulating a Simple Polygon in Linear Time. Discrete & Computational Geometry 6: 485-524 (1991)

Bernard Chazelle, Burton Rosenberg: The complexity of computing partial sums off-line. Int. J. Comput. Geometry Appl. 1(1): 33-45 (1991)

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir: A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and its Applications. Theor. Comput. Sci. 84(1): 77-105 (1991)

Bernard Chazelle: An Optimal Convex Hull Algorithm and New Results on Cuttings (Extended Abstract). FOCS 1991: 29-38

Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink: Ray Shooting in Polygons Using Geodesic Triangulations. ICALP 1991: 661-646

Bernard Chazelle: Computational Geometry for the Gourmet: Old Fare and New Dishes. ICALP 1991: 686-696

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink: Computing a Face in an Arrangement of Line Segments. SODA 1991: 441-448

Bernard Chazelle, Joel Friedman: A deterministic view of random sampling and its use in geometry. Combinatorica 10(3): 229-249 (1990)

Bernard Chazelle, Leonidas Palios: Triangulating a Nonconvex Polytope. Discrete & Computational Geometry 5: 505-526 (1990)

Bernard Chazelle: Lower Bounds for Orthogonal Range Searching: I. The Reporting Case. J. ACM 37(2): 200-212 (1990)

Bernard Chazelle: Lower Bounds for Orthogonal Range Searching II. The Arithmetic Model. J. ACM 37(3): 439-463 (1990)

Bernard Chazelle, Micha Sharir: An Algorithm for Generalized Point Location and its Applications. J. Symb. Comput. 10(3/4): 281-310 (1990)

Bernard Chazelle, Micha Sharir, Emo Welzl: Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems. Symposium on Computational Geometry 1990: 23-33

Boris Aronov, Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Rephael Wenger: Points and Triangles in the Plane and Halving Planes in Space. Symposium on Computational Geometry 1990: 112-115

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir: Slimming Down by Adding: Selecting Heavily Covered Points. Symposium on Computational Geometry 1990: 116-127

Bernard Chazelle: Triangulating a Simple Polygon in Linear Time. FOCS 1990: 220-230

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink: Counting and Cutting Cycles of Lines and Rods in Space. FOCS 1990: 242-251

Bernard Chazelle: Searching in Higher Dimension. SIGAL International Symposium on Algorithms 1990: 155

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas: The Complexity of Cutting Complexes. Discrete & Computational Geometry 4: 139-181 (1989)

Bernard Chazelle, Emo Welzl: Quasi-Optimal Range Searching in Space of Finite VC-Dimension. Discrete & Computational Geometry 4: 467-489 (1989)

Bernard Chazelle, Leonidas J. Guibas: Visibility and Intersection Problems in Plane Geometry. Discrete & Computational Geometry 4: 551-581 (1989)

Bernard Chazelle, Burton Rosenberg: Computing Partial Sums in Multidimensional Arrays. Symposium on Computational Geometry 1989: 131-139

Bernard Chazelle, Leonidas Palios: Triangulating a Non-Convex Polytype. Symposium on Computational Geometry 1989: 393-400

Bernard Chazelle: An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra (Detailed Abstract). FOCS 1989: 586-591

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir: A Singly-Expenential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications. ICALP 1989: 179-193

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir: Lines in Space-Combinatorics, Algorithms and Applications. STOC 1989: 382-393

Bernard Chazelle: An Algorithm for Segment-Dragging and Its Implementation. Algorithmica 3: 205-221 (1988)

Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap: Parallel Computational Geometry. Algorithmica 3: 293-327 (1988)

Bernard Chazelle: A Functional Approach to Data Structures and Its Use in Multidimensional Searching. SIAM J. Comput. 17(3): 427-462 (1988)

Bernard Chazelle, Joel Friedman: A Deterministic View of Random Sampling and its Use in Geometry. FOCS 1988: 539-549

Bernard Chazelle, Herbert Edelsbrunner: An Optimal Algorithm for Intersecting Line Segments in the Plane. FOCS 1988: 590-600

Bernard Chazelle: Some Techniques for Geometric Searching with Implicit Set Representations. Acta Inf. 24(5): 565-582 (1987)

Bernard Chazelle: Editor's Foreword. Algorithmica 2: 135-136 (1987)

Bernard Chazelle: Computing on a Free Tree via Complexity-Preserving Mappings. Algorithmica 2: 337-361 (1987)

Bernard Chazelle, Herbert Edelsbrunner: Linear Space Data Structures for Two Types of Range Search. Discrete & Computational Geometry 2: 113-126 (1987)

Bernard Chazelle, David P. Dobkin: Intersection of convex objects in two and three dimensions. J. ACM 34(1): 1-27 (1987)

Bernard Chazelle, Herbert Edelsbrunner: An Improved Algorithm for Constructing k th-Order Voronoi Diagrams. IEEE Trans. Computers 36(11): 1349-1354 (1987)

Bernard Chazelle: Polytope Range Searching and Integral Geometry (Extended Abstract). FOCS 1987: 1-10

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas: The Complexity of Cutting Convex Polytopes. STOC 1987: 66-76

Bernard Chazelle, Leonidas J. Guibas: Fractional Cascading: I. A Data Structuring Technique. Algorithmica 1(2): 133-162 (1986)

Bernard Chazelle, Leonidas J. Guibas: Fractional Cascading: II. Applications. Algorithmica 1(2): 163-191 (1986)

Bernard Chazelle, Franco P. Preparata: Halfspace Range Search: An Algorithmic Application of k-Sets. Discrete & Computational Geometry 1: 83-93 (1986)

Bernard Chazelle, Richard Cole, Franco P. Preparata, Chee-Keng Yap: New Upper Bounds for Neighbor Searching. Information and Control 68(1-3): 105-124 (1986)

Bernard Chazelle: Reporting and Counting Segment Intersections. J. Comput. Syst. Sci. 32(2): 156-182 (1986)

Bernard Chazelle, Robert L. (Scot) Drysdale III, D. T. Lee: Computing the Largest Empty Rectangle. SIAM J. Comput. 15(1): 300-315 (1986)

Bernard Chazelle: Filtering Search: A New Approach to Query-Answering. SIAM J. Comput. 15(3): 703-724 (1986)

Bernard Chazelle, Herbert Edelsbrunner: Linear Data Structures for Two Types of Range Search. Symposium on Computational Geometry 1986: 293-302

Bernard Chazelle: Lower Bounds on the Complexity of Multidimensional Searching (Extended Abstract). FOCS 1986: 87-96

Bernard Chazelle, Leonidas J. Guibas, D. T. Lee: The Power of Geometric Duality. BIT 25(1): 76-90 (1985)

Bernard Chazelle: How to Search in History. Information and Control 64(1-3): 77-99 (1985)

Bernard Chazelle, Louis Monier: A Model of Computation for VLSI with Related Complexity Results. J. ACM 32(3): 573-588 (1985)

Bernard Chazelle, Herbert Edelsbrunner: Optimal Solutions for a Class of Point Retrieval Problems. J. Symb. Comput. 1(1): 47-56 (1985)

Bernard Chazelle: On the convex layers of a planar set. IEEE Transactions on Information Theory 31(4): 509-517 (1985)

Bernard Chazelle, Franco P. Preparata: Halfspace range search: an algorithmic application of K-sets. Symposium on Computational Geometry 1985: 107-115

Bernard Chazelle: New techniques for computing order statistics in Euclidean space (extended abstract). Symposium on Computational Geometry 1985: 125-134

Bernard Chazelle, Leonidas J. Guibas: Visibility and intersectin problems in plane geometry. Symposium on Computational Geometry 1985: 135-146

Bernard Chazelle, Herbert Edelsbrunner: An improved algorithm for constructing kth-order Voronoi diagrams. Symposium on Computational Geometry 1985: 228-234

Bernard Chazelle: Slimming Down Search Structures: A Functional Approach to Algorithm Design. FOCS 1985: 165-174

Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap: Parallel Computational Geometry (Extended Abstract). FOCS 1985: 468-477

Bernard Chazelle, Herbert Edelsbrunner: Optimal Solutions for a Class of Point Retrieval Problems. ICALP 1985: 80-89

Bernard Chazelle, Leonidas J. Guibas: Fractional Cascading: A Data Structuring Technique with Geometric Applications. ICALP 1985: 90-100

Bernard Chazelle: Fast Searching in a Real Algebraic Manifold with Applications to Geometric Complexity. TAPSOFT, Vol.1 1985: 145-156

Bernard Chazelle, Janet Incerpi: Computing the connected components of D-ranges. Bulletin of the EATCS 22: 9-10 (1984)

Bernard Chazelle: Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm. SIAM J. Comput. 13(3): 488-507 (1984)

Bernard Chazelle: Computational Geometry on a Systolic Chip. IEEE Trans. Computers 33(9): 774-785 (1984)

Bernard Chazelle, Janet Incerpi: Triangulation and Shape-Complexity. ACM Trans. Graph. 3(2): 135-152 (1984)

Bernard Chazelle: Computing on a Free Tree via Complexity-Preserving Mappings. FOCS 1984: 358-368

Bernard Chazelle, Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood: The Complexity and Decidability of Separation. ICALP 1984: 119-127

Bernard Chazelle, Robert L. (Scot) Drysdale III, D. T. Lee: Computing the Largest Empty Rectangle. STACS 1984: 43-54

Bernard Chazelle: Intersecting Is Easier than Sorting. STOC 1984: 125-134

Bernard Chazelle: A Decision Procedure for Optimal Polyhedron Partitioning. Inf. Process. Lett. 16(2): 75-78 (1983)

Bernard Chazelle: An Improved Algorithm for the Fixed-Radius Neighbor Problem. Inf. Process. Lett. 16(4): 193-198 (1983)

Bernard Chazelle: The Bottom-Left Bin-Packing Heuristic: An Efficient Implementation. IEEE Trans. Computers 32(8): 697-707 (1983)

Bernard Chazelle, Louis Monier: Unbounded Hardware is Equivalent to Deterministic Turing Machines. Theor. Comput. Sci. 24: 123-130 (1983)

Bernard Chazelle: How to Search in History. FCT 1983: 52-63

Bernard Chazelle: Filtering Search: A New Approach to Query-Answering. FOCS 1983: 122-132

Bernard Chazelle, Leonidas J. Guibas, D. T. Lee: The Power of Geometric Duality. FOCS 1983: 217-225

Bernard Chazelle: A Theorem on Polygon Cutting with Applications. FOCS 1982: 339-349

Bernard Chazelle: Convex Decompositions of Polyhedra. STOC 1981: 70-79

Bernard Chazelle, Louis Monier: A Model of Computation for VLSI with Related Complexity Results. STOC 1981: 318-325

Bernard Chazelle, David P. Dobkin: Detection is Easier than Computation (Extended Abstract). STOC 1980: 146-153

Bernard Chazelle, David P. Dobkin: Decomposing a Polygon into its Convex Parts. STOC 1979: 38-48