Bernard Chazelle

According to our database, Bernard Chazelle authored at least 189 papers between 1979 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2024

The <i>s</i>-Energy and Its Applications.

Bernard Chazelle, Kritkorn Karntikoon

CoRR, 2024

The Geometry of Cyclical Social Trends.

Bernard Chazelle, Kritkorn Karntikoon, Jakob Nogler

CoRR, 2024

2023

A Connectivity-Sensitive Approach to Consensus Dynamics.

Bernard Chazelle, Kritkorn Karntikoon

Proceedings of the 2nd Symposium on Algorithmic Foundations of Dynamic Networks, 2023

2022

A Geometric Approach to Inelastic Collapse.

Yufei Zheng, Kritkorn Karntikoon, Bernard Chazelle

J. Comput. Geom., 2022

Quick Relaxation in Collective Motion.

Bernard Chazelle, Kritkorn Karntikoon

Proceedings of the 61st IEEE Conference on Decision and Control, 2022

2021

Extracting Semantic Information from Dynamic Graphs of Geometric Data.

Devavrat Vivek Dabke, Bernard Chazelle

Proceedings of the Complex Networks & Their Applications X - Volume 2, Proceedings of the Tenth International Conference on Complex Networks and Their Applications COMPLEX NETWORKS 2021, Madrid, Spain, November 30, 2021

2020

On the Periodicity of Random Walks in Dynamic Networks.

Bernard Chazelle

IEEE Trans. Netw. Sci. Eng., 2020

A Guided Network Propagation Approach to Identify Disease Genes that Combines Prior and New Information.

Borislav H. Hristov, Bernard Chazelle, Mona Singh

Proceedings of the Research in Computational Molecular Biology, 2020

2019

A Sharp Bound on the s-Energy and Its Applications to Averaging Systems.

Bernard Chazelle

IEEE Trans. Autom. Control., 2019

Iterated Learning in Dynamic Social Networks.

Bernard Chazelle, Chu Wang

J. Mach. Learn. Res., 2019

Some Observations on Dynamic Random Walks and Network Renormalization.

Bernard Chazelle

Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

2018

A Sharp Bound on the s-Energy.

Bernard Chazelle

CoRR, 2018

Toward a Theory of Markov Influence Systems and their Renormalization.

Bernard Chazelle

Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

2017

Inertial Hegselmann-Krause Systems.

Bernard Chazelle, Chu Wang

IEEE Trans. Autom. Control., 2017

Self-Sustaining Iterated Learning.

Bernard Chazelle, Chu Wang

Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

Gaussian Learning-Without-Recall in a dynamic social network.

Chu Wang, Bernard Chazelle

Proceedings of the 2017 American Control Conference, 2017

2016

The Challenges of Natural Algorithms.

Bernard Chazelle

Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, CO, USA, July 20, 2016

Noisy Hegselmann-Krause systems: Phase transition and the 2R-conjecture.

Chu Wang, Qianxiao Li, Weinan E, Bernard Chazelle

Proceedings of the 55th IEEE Conference on Decision and Control, 2016

2015

Algorithmic Renormalization for Network Dynamics.

Bernard Chazelle

IEEE Trans. Netw. Sci. Eng., 2015

Diffusive Influence Systems.

Bernard Chazelle

SIAM J. Comput., 2015

Data Structures on Event Graphs.

Bernard Chazelle, Wolfgang Mulzer

Algorithmica, 2015

Communication, Dynamics, and Renormalization.

Bernard Chazelle

Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

2014

How Many Bits Can a Flock of Birds Compute?

Bernard Chazelle

Theory Comput., 2014

The Convergence of Bird Flocking.

Bernard Chazelle

J. ACM, 2014

2013

On the convergence of the Hegselmann-Krause system.

Arnab Bhattacharyya, Mark Braverman, Bernard Chazelle, Huy L. Nguyen

Proceedings of the Innovations in Theoretical Computer Science, 2013

2012

Natural algorithms and influence systems.

Bernard Chazelle

Commun. ACM, 2012

The Dynamics of Influence Systems.

Bernard Chazelle

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011

Self-Improving Algorithms.

Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri

SIAM J. Comput., 2011

The Total s-Energy of a Multiagent System.

Bernard Chazelle

SIAM J. Control. Optim., 2011

Online geometric reconstruction.

Bernard Chazelle, C. Seshadhri

J. ACM, 2011

Computing Hereditary Convex Structures.

Bernard Chazelle, Wolfgang Mulzer

Discret. Comput. Geom., 2011

2010

Faster dimension reduction.

Nir Ailon, Bernard Chazelle

Commun. ACM, 2010

Analytical Tools for Natural Algorithms.

Bernard Chazelle

Proceedings of the Innovations in Computer Science, 2010

A geometric approach to collective motion.

Bernard Chazelle

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

The geometry of flocking.

Bernard Chazelle

Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009

The Fast Johnson--Lindenstrauss Transform and Approximate Nearest Neighbors.

Nir Ailon, Bernard Chazelle

SIAM J. Comput., 2009

Markov Incremental Constructions.

Bernard Chazelle, Wolfgang Mulzer

Discret. Comput. Geom., 2009

Natural algorithms.

Bernard Chazelle

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Analyzing and Interrogating Biological Networks (Abstract).

Eric Banks, Elena Nabieva, Bernard Chazelle, Ryan Peterson, Mona Singh

Proceedings of the Bioinformatics and Computational Biology, 2009

2008

Organization of Physical Interactomes as Uncovered by Network Schemas.

Eric Banks, Elena Nabieva, Bernard Chazelle, Mona Singh

PLoS Comput. Biol., 2008

Approximate range searching in higher dimension.

Bernard Chazelle, Ding Liu, Avner Magen

Comput. Geom., 2008

Technical perspective: finding a good neighbor, near and fast.

Bernard Chazelle

Commun. ACM, 2008

Property-Preserving Data Reconstruction.

Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu

Algorithmica, 2008

2007

Estimating the distance to a monotone function.

Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu

Random Struct. Algorithms, 2007

Ushering in a New Era of Algorithm Design.

Bernard Chazelle

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006

Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform.

Nir Ailon, Bernard Chazelle

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Self-improving algorithms.

Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005

Approximating the Minimum Spanning Tree Weight in Sublinear Time.

Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan

SIAM J. Comput., 2005

Sublinear Geometric Algorithms.

Bernard Chazelle, Ding Liu, Avner Magen

SIAM J. Comput., 2005

Lower bounds for linear degeneracy testing.

Nir Ailon, Bernard Chazelle

J. ACM, 2005

Is the thrill gone?

Sanjeev Arora, Bernard Chazelle

Commun. ACM, 2005

Solving and analyzing side-chain positioning problems using linear and integer programming.

Carleton Kingsford, Bernard Chazelle, Mona Singh

Bioinform., 2005

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

Elena Nabieva, Kam Jim, Amit Agarwal, Bernard Chazelle, Mona Singh

Proceedings of the Proceedings Thirteenth International Conference on Intelligent Systems for Molecular Biology 2005, 2005

Algorithmic Techniques and Tools from Computational Geometry.

Bernard Chazelle

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2004

Cuttings.

Bernard Chazelle

Proceedings of the Handbook of Data Structures and Applications., 2004

The discrepancy method in computational geometry.

Bernard Chazelle

Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

Lower bounds for intersection searching and fractional cascading in higher dimension.

Bernard Chazelle, Ding Liu

J. Comput. Syst. Sci., 2004

A Semidefinite Programming Approach to Side Chain Positioning with New Rounding Strategies.

Bernard Chazelle, Carl Kingsford, Mona Singh

INFORMS J. Comput., 2004

Information Theory in Property Testing and Monotonicity Testing in Higher Dimension

Nir Ailon, Bernard Chazelle

Electron. Colloquium Comput. Complex., 2004

The Power of Nonmonotonicity in Geometric Searching.

Bernard Chazelle

Discret. Comput. Geom., 2004

A Reflective Symmetry Descriptor for 3D Models.

Michael M. Kazhdan, Bernard Chazelle, David P. Dobkin, Thomas A. Funkhouser, Szymon Rusinkiewicz

Algorithmica, 2004

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

Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ayellet Tal

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Who says you have to look at the input? The brave new world of sublinear computing.

Bernard Chazelle

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003

Sublinear Computing.

Bernard Chazelle

Proceedings of the Algorithms, 2003

The Side-Chain Positioning Problem: A Semidefinite Programming Formulation With New Rounding Schemes.

Bernard Chazelle, Carl Kingsford, Mona Singh

Proceedings of the PCK50, 2003

2002

Shape distributions.

Robert Osada, Thomas A. Funkhouser, Bernard Chazelle, David P. Dobkin

ACM Trans. Graph., 2002

Splitting a Delaunay Triangulation in Linear Time.

Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristán, Monique Teillaud

Algorithmica, 2002

A Reflective Symmetry Descriptor.

Michael M. Kazhdan, Bernard Chazelle, David P. Dobkin, Adam Finkelstein, Thomas A. Funkhouser

Proceedings of the Computer Vision, 2002

2001

A Trace Bound for the Hereditary Discrepancy.

Bernard Chazelle, Alexey Lvov

Discret. Comput. Geom., 2001

The Discrepancy of Boxes in Higher Dimension.

Bernard Chazelle, Alexey Lvov

Discret. Comput. Geom., 2001

Matching 3D Models with Shape Distributions.

Robert Osada, Thomas A. Funkhouser, Bernard Chazelle, David P. Dobkin

Proceedings of the 2001 International Conference on Shape Modeling and Applications (SMI 2001), 2001

The discrepancy method - randomness and complexity.

Bernard Chazelle

Cambridge University Press, ISBN: 978-0-521-00357-5, 2001

2000

A minimum spanning tree algorithm with Inverse-Ackermann type complexity.

Bernard Chazelle

J. ACM, 2000

The soft heap: an approximate priority queue with optimal error rate.

Bernard Chazelle

J. ACM, 2000

Self-customized BSP trees for collision detection.

Sigal Ar, Bernard Chazelle, Ayellet Tal

Comput. Geom., 2000

Irregularities of Distribution, Derandomization, and Complexity Theory.

Bernard Chazelle

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000

1999

Product Range Spaces, Sensitive Sampling, and Derandomization.

Hervé Brönnimann, Bernard Chazelle, Jirí Matousek

SIAM J. Comput., 1999

A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube.

Amit Chakrabarti, Bernard Chazelle, Benjamin Gum, Alexey Lvov

Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999

Geometric Searching over the Rationals.

Bernard Chazelle

Proceedings of the Algorithms, 1999

1998

A Spectral Approach to Lower Bounds with Applications to Geometric Searching.

Bernard Chazelle

SIAM J. Comput., 1998

Optimal slope selection via cuttings.

Hervé Brönnimann, Bernard Chazelle

Comput. Geom., 1998

The Discrepancy Method.

Bernard Chazelle

Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

Car-Pooling as a Data Structuring Device: The Soft Heap.

Bernard Chazelle

Proceedings of the Algorithms, 1998

1997

Lower Bounds for Off-Line Range Searching.

Bernard Chazelle

Discret. Comput. Geom., 1997

Strategies for Polyhedral Surface Decomposition: an Experimental Study.

Bernard Chazelle, David P. Dobkin, Nadia Shouraboura, Ayellet Tal

Comput. Geom., 1997

Decomposing the Boundary of a Nonconvex Polyhedron.

Bernard Chazelle, Leonidas Palios

Algorithmica, 1997

Discrepancy Theory and Computational Geometry.

Bernard Chazelle

Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997

A Faster Deterministic Algorithm for Minimum Spanning Trees.

Bernard Chazelle

Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997

1996

On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension.

Bernard Chazelle, Jirí Matousek

J. Algorithms, 1996

BOXTREE: A Hierarchical Representation for Surfaces in 3D.

Gill Barequet, Bernard Chazelle, Leonidas J. Guibas, Joseph S. B. Mitchell, Ayellet Tal

Comput. Graph. Forum, 1996

Lines in Space: Combinatorics and Algorithms.

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jorge Stolfi

Algorithmica, 1996

The Computational Geometry Impact Task Force Report: An Executive Summary.

Bernard Chazelle

Proceedings of the Applied Computational Geormetry, 1996

Foreword.

Fred S. Roberts, Bernard Chazelle, Stephen R. Mahaney

Proceedings of the Spin Verification System, 1996

1995

Bounds on the Size of Tetrahedralizations.

Bernard Chazelle, Nadia Shouraboura

Discret. Comput. Geom., 1995

An Elementary Approach to Lower Bounds in Geometric Discrepancy.

Bernard Chazelle, Jirí Matousek, Micha Sharir

Discret. Comput. Geom., 1995

Improved Bounds on Weak epsilon-Nets for Convex Sets.

Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl

Discret. Comput. Geom., 1995

Simplex Range Reporting on a Pointer Machine.

Bernard Chazelle, Burton Rosenberg

Comput. Geom., 1995

Derandomizing an Output-sensitive Convex Hull Algorithm in Three Dimensions.

Bernard Chazelle, Jirí Matousek

Comput. Geom., 1995

Convex Surface Decomposition.

Bernard Chazelle, David P. Dobkin, Nadia Shouraboura, Ayellet Tal

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994

Selecting Heavily Covered Points.

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir

SIAM J. Comput., 1994

Triangulating disjoint Jordan chains.

Reuven Bar-Yehuda, Bernard Chazelle

Int. J. Comput. Geom. Appl., 1994

Point Location Among Hyperplanes and Unidirectional Ray-shooting.

Bernard Chazelle, Joel Friedman

Comput. Geom., 1994

Algorithms for Bichromatic Line-Segment Problems Polyhedral Terrains.

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir

Algorithmica, 1994

Ray Shooting in Polygons Using Geodesic Triangulations.

Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink

Algorithmica, 1994

Computational geometry: a retrospective.

Bernard Chazelle

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

A Spectral Approach to Lower Bounds

Bernard Chazelle

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993

Computing a Face in an Arrangement of Line Segments and Related Problems.

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink

SIAM J. Comput., 1993

Diameter, Width, Closest Line Pair, and Parametric Searching.

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir

Discret. Comput. Geom., 1993

Cutting Hyperplanes for Divide-and-Conquer.

Bernard Chazelle

Discret. Comput. Geom., 1993

An Optimal Convex Hull Algorithm in Any Fixed Dimension.

Bernard Chazelle

Discret. Comput. Geom., 1993

How Hard Is Half-Space Range Searching.

Hervé Brönnimann, Bernard Chazelle, János Pach

Discret. Comput. Geom., 1993

On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimensions.

Bernard Chazelle, Jirí Matousek

Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

Deterministic sampling and optimization.

Bernard Chazelle

Proceedings of the System Modelling and Optimization: Proceedings of the 16th IFIP-TC7 Conference, 1993

Geometric Discrepancy Revisited

Bernard Chazelle

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992

An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra.

Bernard Chazelle

SIAM J. Comput., 1992

An Optimal Algorithm for Intersecting Line Segments in the Plane.

Bernard Chazelle, Herbert Edelsbrunner

J. ACM, 1992

Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems.

Bernard Chazelle, Micha Sharir, Emo Welzl

Algorithmica, 1992

Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine.

Bernard Chazelle, Burton Rosenberg

Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

How Hard is Halfspace Range Searching?

Hervé Brönnimann, Bernard Chazelle

Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991

A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and its Applications.

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir

Theor. Comput. Sci., 1991

The complexity of computing partial sums off-line.

Bernard Chazelle, Burton Rosenberg

Int. J. Comput. Geom. Appl., 1991

Triangulating a Simple Polygon in Linear Time.

Bernard Chazelle

Discret. Comput. Geom., 1991

Points and Triangles in the Plane and Halving Planes in Space.

Boris Aronov, Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Rephael Wenger

Discret. Comput. Geom., 1991

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

Comput. Geom., 1991

Computing a Face in an Arrangement of Line Segments.

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink

Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

Computational Geometry for the Gourmet: Old Fare and New Dishes.

Bernard Chazelle

Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

An Optimal Convex Hull Algorithm and New Results on Cuttings (Extended Abstract)

Bernard Chazelle

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990

Lower Bounds for Orthogonal Range Searching II. The Arithmetic Model

Bernard Chazelle

J. ACM, July, 1990

Lower Bounds for Orthogonal Range Searching: I. The Reporting Case

Bernard Chazelle

J. ACM, April, 1990

An Algorithm for Generalized Point Location and its Applications.

Bernard Chazelle, Micha Sharir

J. Symb. Comput., 1990

Triangulating a Nonconvex Polytope.

Bernard Chazelle, Leonidas Palios

Discret. Comput. Geom., 1990

A deterministic view of random sampling and its use in geometry.

Bernard Chazelle, Joel Friedman

Comb., 1990

Searching in Higher Dimension.

Bernard Chazelle

Proceedings of the Algorithms, 1990

Slimming Down by Adding: Selecting Heavily Covered Points.

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989

Quasi-Optimal Range Searching in Space of Finite VC-Dimension.

Bernard Chazelle, Emo Welzl

Discret. Comput. Geom., 1989

Visibility and Intersection Problems in Plane Geometry.

Bernard Chazelle, Leonidas J. Guibas

Discret. Comput. Geom., 1989

The Complexity of Cutting Complexes.

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas

Discret. Comput. Geom., 1989

Lines in Space-Combinatorics, Algorithms and Applications

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

A Singly-Expenential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications.

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir

Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989

An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra (Detailed Abstract)

Bernard Chazelle

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

Computing Partial Sums in Multidimensional Arrays.

Bernard Chazelle, Burton Rosenberg

Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

Triangulating a Non-Convex Polytype.

Bernard Chazelle, Leonidas Palios

Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1988

A Functional Approach to Data Structures and Its Use in Multidimensional Searching.

Bernard Chazelle

SIAM J. Comput., 1988

An Algorithm for Segment-Dragging and Its Implementation.

Bernard Chazelle

Algorithmica, 1988

Parallel Computational Geometry.

Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap

Algorithmica, 1988

1987

An Improved Algorithm for Constructing <i>k</i> th-Order Voronoi Diagrams.

Bernard Chazelle, Herbert Edelsbrunner

IEEE Trans. Computers, 1987

Intersection of convex objects in two and three dimensions.

Bernard Chazelle, David P. Dobkin

J. ACM, 1987

Linear Space Data Structures for Two Types of Range Search.

Bernard Chazelle, Herbert Edelsbrunner

Discret. Comput. Geom., 1987

Computing on a Free Tree via Complexity-Preserving Mappings.

Bernard Chazelle

Algorithmica, 1987

Editor's Foreword.

Bernard Chazelle

Algorithmica, 1987

Some Techniques for Geometric Searching with Implicit Set Representations.

Bernard Chazelle

Acta Informatica, 1987

The Complexity of Cutting Convex Polytopes

Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas

Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

Polytope Range Searching and Integral Geometry (Extended Abstract)

Bernard Chazelle

Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1986

Computing the Largest Empty Rectangle.

Bernard Chazelle, Robert L. (Scot) Drysdale III, D. T. Lee

SIAM J. Comput., 1986

Filtering Search: A New Approach to Query-Answering.

Bernard Chazelle

SIAM J. Comput., 1986

Reporting and Counting Segment Intersections.

Bernard Chazelle

J. Comput. Syst. Sci., 1986

New Upper Bounds for Neighbor Searching

Bernard Chazelle, Richard Cole, Franco P. Preparata, Chee-Keng Yap

Inf. Control., 1986

Halfspace Range Search: An Algorithmic Application of k-Sets.

Bernard Chazelle, Franco P. Preparata

Discret. Comput. Geom., 1986

On a circle placement problem.

Bernard Marie Chazelle, D. T. Lee

Computing, 1986

Fractional Cascading: II. Applications.

Bernard Chazelle, Leonidas J. Guibas

Algorithmica, 1986

Fractional Cascading: I. A Data Structuring Technique.

Bernard Chazelle, Leonidas J. Guibas

Algorithmica, 1986

Lower Bounds on the Complexity of Multidimensional Searching (Extended Abstract)

Bernard Chazelle

Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

Linear Data Structures for Two Types of Range Search.

Bernard Chazelle, Herbert Edelsbrunner

Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986

1985

A Model of Computation for VLSI with Related Complexity Results

Bernard Chazelle, Louis Monier

J. ACM, July, 1985

On the convex layers of a planar set.

Bernard Chazelle

IEEE Trans. Inf. Theory, 1985

Optimal Solutions for a Class of Point Retrieval Problems.

Bernard Chazelle, Herbert Edelsbrunner

J. Symb. Comput., 1985

How to Search in History

Bernard Chazelle

Inf. Control., 1985

The Power of Geometric Duality.

Bernard Chazelle, Leonidas J. Guibas, D. T. Lee

BIT, 1985

Fast Searching in a Real Algebraic Manifold with Applications to Geometric Complexity.

Bernard Chazelle

Proceedings of the Mathematical Foundations of Software Development, 1985

Fractional Cascading: A Data Structuring Technique with Geometric Applications.

Bernard Chazelle, Leonidas J. Guibas

Proceedings of the Automata, 1985

Slimming Down Search Structures: A Functional Approach to Algorithm Design

Bernard Chazelle

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

Parallel Computational Geometry (Extended Abstract)

Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

Visibility and intersectin problems in plane geometry.

Bernard Chazelle, Leonidas J. Guibas

Proceedings of the First Annual Symposium on Computational Geometry, 1985

An improved algorithm for constructing kth-order Voronoi diagrams.

Bernard Chazelle, Herbert Edelsbrunner

Proceedings of the First Annual Symposium on Computational Geometry, 1985

New techniques for computing order statistics in Euclidean space (extended abstract).

Bernard Chazelle

Proceedings of the First Annual Symposium on Computational Geometry, 1985

1984

Triangulation and Shape-Complexity.

Bernard Chazelle, Janet Incerpi

ACM Trans. Graph., 1984

Computational Geometry on a Systolic Chip.

Bernard Chazelle

IEEE Trans. Computers, 1984

Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm.

Bernard Chazelle

SIAM J. Comput., 1984

Computing the connected components of D-ranges.

Bernard Chazelle, Janet Incerpi

Bull. EATCS, 1984

Intersecting Is Easier than Sorting

Bernard Chazelle

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

The Complexity and Decidability of Separation.

Bernard Chazelle, Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood

Proceedings of the Automata, 1984

1983

Unbounded Hardware is Equivalent to Deterministic Turing Machines.

Bernard Chazelle, Louis Monier

Theor. Comput. Sci., 1983

The Bottom-Left Bin-Packing Heuristic: An Efficient Implementation.

Bernard Chazelle

IEEE Trans. Computers, 1983

An Improved Algorithm for the Fixed-Radius Neighbor Problem.

Bernard Chazelle

Inf. Process. Lett., 1983

A Decision Procedure for Optimal Polyhedron Partitioning.

Bernard Chazelle

Inf. Process. Lett., 1983

1982

A Theorem on Polygon Cutting with Applications

Bernard Chazelle

Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

1981

Convex Decompositions of Polyhedra

Bernard Chazelle

Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

1980

Detection is Easier than Computation (Extended Abstract)

Bernard Chazelle, David P. Dobkin

Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

1979

Decomposing a Polygon into its Convex Parts

Bernard Chazelle, David P. Dobkin

Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30, 1979