Bernard Chazelle

242 papers A* 50A 13B 6C 3Journal 123Unranked 44

Year	Rank	Type	Title / Venue / Authors
2025	—	`conf`	Genealogical Searching. CDC Bernard Chazelle, Kritkorn Karntikoon
2024	J	`jnl`	The CoRR Bernard Chazelle, Kritkorn Karntikoon
2024	—	`conf`	The Geometry of Cyclical Social Trends. CDC Bernard Chazelle, Kritkorn Karntikoon, Jakob Nogler
2024	J	`jnl`	The Geometry of Cyclical Social Trends. CoRR Bernard Chazelle, Kritkorn Karntikoon, Jakob Nogler
2023	—	`conf`	A Connectivity-Sensitive Approach to Consensus Dynamics. SAND Bernard Chazelle, Kritkorn Karntikoon
2022	J	`jnl`	A Geometric Approach to Inelastic Collapse. J. Comput. Geom. Yufei Zheng, Kritkorn Karntikoon, Bernard Chazelle
2022	—	`conf`	Quick Relaxation in Collective Motion. CDC Bernard Chazelle, Kritkorn Karntikoon
2022	J	`jnl`	Quick Relaxation in Collective Motion. CoRR Bernard Chazelle, Kritkorn Karntikoon
2021	—	`conf`	Extracting Semantic Information from Dynamic Graphs of Geometric Data. COMPLEX NETWORKS Devavrat Vivek Dabke, Bernard Chazelle
2020	B	`conf`	A Guided Network Propagation Approach to Identify Disease Genes that Combines Prior and New Information. RECOMB Borislav H. Hristov, Bernard Chazelle, Mona Singh
2020	J	`jnl`	On the Periodicity of Random Walks in Dynamic Networks. IEEE Trans. Netw. Sci. Eng. Bernard Chazelle
2019	J	`jnl`	A Sharp Bound on the s-Energy and Its Applications to Averaging Systems. IEEE Trans. Autom. Control. Bernard Chazelle
2019	J	`jnl`	Iterated Learning in Dynamic Social Networks. J. Mach. Learn. Res. Bernard Chazelle, Chu Wang
2019	B	`conf`	Some Observations on Dynamic Random Walks and Network Renormalization. FCT Bernard Chazelle
2018	J	`jnl`	A Sharp Bound on the s-Energy. CoRR Bernard Chazelle
2018	A	`conf`	Toward a Theory of Markov Influence Systems and their Renormalization. ITCS Bernard Chazelle
2018	J	`jnl`	Toward a Theory of Markov Influence Systems and their Renormalization. CoRR Bernard Chazelle
2017	C	`conf`	Gaussian Learning-Without-Recall in a dynamic social network. ACC Chu Wang, Bernard Chazelle
2017	J	`jnl`	Inertial Hegselmann-Krause Systems. IEEE Trans. Autom. Control. Bernard Chazelle, Chu Wang
2017	A	`conf`	Self-Sustaining Iterated Learning. ITCS Bernard Chazelle, Chu Wang
2016	C	`conf`	Inertial Hegselmann-Krause systems. ACC Bernard Chazelle, Chu Wang
2016	—	`conf`	Noisy Hegselmann-Krause systems: Phase transition and the 2R-conjecture. CDC Chu Wang, Qianxiao Li, Weinan E, Bernard Chazelle
2016	J	`jnl`	Self-Sustaining Iterated Learning. CoRR Bernard Chazelle, Chu Wang
2016	A	`conf`	The Challenges of Natural Algorithms. GECCO Bernard Chazelle
2015	J	`jnl`	Algorithmic Renormalization for Network Dynamics. IEEE Trans. Netw. Sci. Eng. Bernard Chazelle
2015	C	`conf`	Communication, Dynamics, and Renormalization. CIAC Bernard Chazelle
2015	J	`jnl`	Data Structures on Event Graphs. Algorithmica Bernard Chazelle, Wolfgang Mulzer
2015	J	`jnl`	Diffusive Influence Systems. SIAM J. Comput. Bernard Chazelle
2015	J	`jnl`	Inertial Hegselmann-Krause Systems. CoRR Bernard Chazelle, Chu Wang
2014	J	`jnl`	How Many Bits Can a Flock of Birds Compute? Theory Comput. Bernard Chazelle
2014	J	`jnl`	The Convergence of Bird Flocking. J. ACM Bernard Chazelle
2013	A	`conf`	On the convergence of the Hegselmann-Krause system. ITCS Arnab Bhattacharyya, Mark Braverman, Bernard Chazelle, Huy L. Nguyen
2012	J	`jnl`	Data Structures on Event Graphs CoRR Bernard Chazelle, Wolfgang Mulzer
2012	A	`conf`	Data Structures on Event Graphs. ESA Bernard Chazelle, Wolfgang Mulzer
2012	J	`jnl`	Natural algorithms and influence systems. Commun. ACM Bernard Chazelle
2012	J	`jnl`	On the Convergence of the Hegselmann-Krause System CoRR Arnab Bhattacharyya, Mark Braverman, Bernard Chazelle, Huy L. Nguyen
2012	J	`jnl`	The Dynamics of Influence Systems CoRR Bernard Chazelle
2012	A*	`conf`	The Dynamics of Influence Systems. FOCS Bernard Chazelle
2011	J	`jnl`	Computing Hereditary Convex Structures. Discret. Comput. Geom. Bernard Chazelle, Wolfgang Mulzer
2011	A	`ed.`	Innovations in Computer Science - ICS 2011, Tsinghua University, Beijing, China, January 7-9, 2011. Proceedings ICS Bernard Chazelle
2011	J	`jnl`	Online geometric reconstruction. J. ACM Bernard Chazelle, C. Seshadhri
2011	J	`jnl`	Self-Improving Algorithms. SIAM J. Comput. Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri
2011	J	`jnl`	The Total s-Energy of a Multiagent System. SIAM J. Control. Optim. Bernard Chazelle
2010	—	`conf`	A geometric approach to collective motion. SCG Bernard Chazelle
2010	A	`conf`	Analytical Tools for Natural Algorithms. ICS Bernard Chazelle
2010	J	`jnl`	Faster dimension reduction. Commun. ACM Nir Ailon, Bernard Chazelle
2010	J	`jnl`	The Total s-Energy of a Multiagent System CoRR Bernard Chazelle
2010	—	`conf`	The geometry of flocking. SCG Bernard Chazelle
2009	—	`conf`	Analyzing and Interrogating Biological Networks (Abstract). BICoB Eric Banks, Elena Nabieva, Bernard Chazelle, Ryan Peterson, Mona Singh
2009	—	`conf`	Computing hereditary convex structures. SCG Bernard Chazelle, Wolfgang Mulzer
2009	J	`jnl`	Markov Incremental Constructions. Discret. Comput. Geom. Bernard Chazelle, Wolfgang Mulzer
2009	A*	`conf`	Natural algorithms. SODA Bernard Chazelle
2009	J	`jnl`	Self-Improving Algorithms CoRR Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri
2009	J	`jnl`	The Convergence of Bird Flocking CoRR Bernard Chazelle
2009	J	`jnl`	The Fast Johnson--Lindenstrauss Transform and Approximate Nearest Neighbors. SIAM J. Comput. Nir Ailon, Bernard Chazelle
2008	J	`jnl`	Approximate range searching in higher dimension. Comput. Geom. Bernard Chazelle, Ding Liu, Avner Magen
2008	—	`conf`	Markov incremental constructions. SCG Bernard Chazelle, Wolfgang Johann Heinrich Mulzer
2008	J	`jnl`	Organization of Physical Interactomes as Uncovered by Network Schemas. PLoS Comput. Biol. Eric Banks, Elena Nabieva, Bernard Chazelle, Mona Singh
2008	J	`jnl`	Property-Preserving Data Reconstruction. Algorithmica Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu
2008	J	`jnl`	Technical perspective: finding a good neighbor, near and fast. Commun. ACM Bernard Chazelle
2007	J	`jnl`	Estimating the distance to a monotone function. Random Struct. Algorithms Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu
2007	A*	`conf`	Ushering in a New Era of Algorithm Design. ICALP Bernard Chazelle
2006	A*	`conf`	Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform. STOC Nir Ailon, Bernard Chazelle
2006	J	`jnl`	Information theory in property testing and monotonicity testing in higher dimension. Inf. Comput. Nir Ailon, Bernard Chazelle
2006	—	`conf`	Online geometric reconstruction. SCG Bernard Chazelle, C. Seshadhri
2006	A*	`conf`	Self-improving algorithms. SODA Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu
2005	A*	`conf`	Algorithmic Techniques and Tools from Computational Geometry. FOCS Bernard Chazelle
2005	J	`jnl`	Approximating the Minimum Spanning Tree Weight in Sublinear Time. SIAM J. Comput. Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan
2005	A	`conf`	Information Theory in Property Testing and Monotonicity Testing in Higher Dimension. STACS Nir Ailon, Bernard Chazelle
2005	J	`jnl`	Is the thrill gone? Commun. ACM Sanjeev Arora, Bernard Chazelle
2005	J	`jnl`	Lower bounds for linear degeneracy testing. J. ACM Nir Ailon, Bernard Chazelle
2005	J	`jnl`	Solving and analyzing side-chain positioning problems using linear and integer programming. Bioinform. Carleton Kingsford, Bernard Chazelle, Mona Singh
2005	—	`conf`	Sublinear Geometric Algorithms. Sublinear Algorithms Bernard Chazelle, Ding Liu, Avner Magen
2005	J	`jnl`	Sublinear Geometric Algorithms. SIAM J. Comput. Bernard Chazelle, Ding Liu, Avner Magen
2005	—	`conf`	Whole-proteome prediction of protein function via graph-theoretic analysis of interaction maps. ISMB (Supplement of Bioinformatics) Elena Nabieva, Kam Jim, Amit Agarwal, Bernard Chazelle, Mona Singh
2004	J	`jnl`	A Reflective Symmetry Descriptor for 3D Models. Algorithmica Michael M. Kazhdan, Bernard Chazelle, David P. Dobkin, Thomas A. Funkhouser, Szymon Rusinkiewicz
2004	J	`jnl`	A Semidefinite Programming Approach to Side Chain Positioning with New Rounding Strategies. INFORMS J. Comput. Bernard Chazelle, Carl Kingsford, Mona Singh
2004	—	`conf`	Approximate range searching in higher dimension. CCCG Ding Liu, Bernard Chazelle, Avner Magen
2004	—	`ch.`	Cuttings. Handbook of Data Structures and Applications Bernard Chazelle
2004	—	`conf`	Estimating the Distance to a Monotone Function. APPROX-RANDOM Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu
2004	J	`jnl`	Information Theory in Property Testing and Monotonicity Testing in Higher Dimension Electron. Colloquium Comput. Complex. Nir Ailon, Bernard Chazelle
2004	J	`jnl`	Lower bounds for intersection searching and fractional cascading in higher dimension. J. Comput. Syst. Sci. Bernard Chazelle, Ding Liu
2004	A*	`conf`	Lower bounds for linear degeneracy testing. STOC Nir Ailon, Bernard Chazelle
2004	B	`conf`	Property-Preserving Data Reconstruction. ISAAC Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu
2004	A*	`conf`	The Bloomier filter: an efficient data structure for static support lookup tables. SODA Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ayellet Tal
2004	J	`jnl`	The Power of Nonmonotonicity in Geometric Searching. Discret. Comput. Geom. Bernard Chazelle
2004	—	`ch.`	The discrepancy method in computational geometry. Handbook of Discrete and Computational Geometry, 2nd Ed. Bernard Chazelle
2004	A*	`conf`	Who says you have to look at the input? The brave new world of sublinear computing. SODA Bernard Chazelle
2003	A	`conf`	Sublinear Computing. ESA Bernard Chazelle
2003	A*	`conf`	Sublinear geometric algorithms. STOC Bernard Chazelle, Ding Liu, Avner Magen
2003	—	`conf`	The Side-Chain Positioning Problem: A Semidefinite Programming Formulation With New Rounding Schemes. PCK50 Bernard Chazelle, Carl Kingsford, Mona Singh
2002	—	`conf`	A Reflective Symmetry Descriptor. ECCV (2) Michael M. Kazhdan, Bernard Chazelle, David P. Dobkin, Adam Finkelstein, Thomas A. Funkhouser
2002	J	`jnl`	Shape distributions. ACM Trans. Graph. Robert Osada, Thomas A. Funkhouser, Bernard Chazelle, David P. Dobkin
2002	J	`jnl`	Splitting a Delaunay Triangulation in Linear Time. Algorithmica Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristán, Monique Teillaud
2002	—	`conf`	The power of nonmonotonicity in geometric searching. SCG Bernard Chazelle
2001	J	`jnl`	A Trace Bound for the Hereditary Discrepancy. Discret. Comput. Geom. Bernard Chazelle, Alexey Lvov
2001	A*	`conf`	Approximating the Minimum Spanning Tree Weight in Sublinear Time. ICALP Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan
2001	A*	`conf`	Lower bounds for intersection searching and fractional cascading in higher dimension. STOC Bernard Chazelle, Ding Liu
2001	—	`conf`	Matching 3D Models with Shape Distributions. Shape Modeling International Robert Osada, Thomas A. Funkhouser, Bernard Chazelle, David P. Dobkin
2001	A	`conf`	Splitting a Delaunay Triangulation in Linear Time. ESA Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristán, Monique Teillaud
2001	J	`jnl`	The Discrepancy of Boxes in Higher Dimension. Discret. Comput. Geom. Bernard Chazelle, Alexey Lvov
2001	—	`book`	The discrepancy method - randomness and complexity. Bernard Chazelle
2000	J	`jnl`	A minimum spanning tree algorithm with Inverse-Ackermann type complexity. J. ACM Bernard Chazelle
2000	—	`conf`	A trace bound for the hereditary discrepancy. SCG Bernard Chazelle, Alexey Lvov
2000	—	`conf`	Irregularities of Distribution, Derandomization, and Complexity Theory. FSTTCS Bernard Chazelle
2000	J	`jnl`	Self-customized BSP trees for collision detection. Comput. Geom. Sigal Ar, Bernard Chazelle, Ayellet Tal
2000	J	`jnl`	The soft heap: an approximate priority queue with optimal error rate. J. ACM Bernard Chazelle
1999	A*	`conf`	A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube. STOC Amit Chakrabarti, Bernard Chazelle, Benjamin Gum, Alexey Lvov
1999	A	`conf`	Geometric Searching over the Rationals. ESA Bernard Chazelle
1999	J	`jnl`	Product Range Spaces, Sensitive Sampling, and Derandomization. SIAM J. Comput. Hervé Brönnimann, Bernard Chazelle, Jirí Matousek
1998	J	`jnl`	A Spectral Approach to Lower Bounds with Applications to Geometric Searching. SIAM J. Comput. Bernard Chazelle
1998	A	`conf`	Car-Pooling as a Data Structuring Device: The Soft Heap. ESA Bernard Chazelle
1998	J	`jnl`	Optimal slope selection via cuttings. Comput. Geom. Hervé Brönnimann, Bernard Chazelle
1998	B	`conf`	The Discrepancy Method. ISAAC Bernard Chazelle
1997	A*	`conf`	A Faster Deterministic Algorithm for Minimum Spanning Trees. FOCS Bernard Chazelle
1997	J	`jnl`	Decomposing the Boundary of a Nonconvex Polyhedron. Algorithmica Bernard Chazelle, Leonidas Palios
1997	B	`conf`	Discrepancy Theory and Computational Geometry. WADS Bernard Chazelle
1997	J	`jnl`	Lower Bounds for Off-Line Range Searching. Discret. Comput. Geom. Bernard Chazelle
1997	J	`jnl`	Strategies for Polyhedral Surface Decomposition: an Experimental Study. Comput. Geom. Bernard Chazelle, David P. Dobkin, Nadia Shouraboura, Ayellet Tal
1996	J	`jnl`	BOXTREE: A Hierarchical Representation for Surfaces in 3D. Comput. Graph. Forum Gill Barequet, Bernard Chazelle, Leonidas J. Guibas, Joseph S. B. Mitchell, Ayellet Tal
1996	—	`conf`	Foreword. The Spin Verification System Fred S. Roberts, Bernard Chazelle, Stephen R. Mahaney
1996	J	`jnl`	Lines in Space: Combinatorics and Algorithms. Algorithmica Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jorge Stolfi
1996	J	`jnl`	On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension. J. Algorithms Bernard Chazelle, Jirí Matousek
1996	—	`conf`	The Computational Geometry Impact Task Force Report: An Executive Summary. WACG Bernard Chazelle
1995	J	`jnl`	An Elementary Approach to Lower Bounds in Geometric Discrepancy. Discret. Comput. Geom. Bernard Chazelle, Jirí Matousek, Micha Sharir
1995	J	`jnl`	Bounds on the Size of Tetrahedralizations. Discret. Comput. Geom. Bernard Chazelle, Nadia Shouraboura
1995	—	`conf`	Convex Surface Decomposition. SCG Bernard Chazelle, David P. Dobkin, Nadia Shouraboura, Ayellet Tal
1995	J	`jnl`	Derandomizing an Output-sensitive Convex Hull Algorithm in Three Dimensions. Comput. Geom. Bernard Chazelle, Jirí Matousek
1995	J	`jnl`	Improved Bounds on Weak epsilon-Nets for Convex Sets. Discret. Comput. Geom. Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl
1995	A*	`conf`	Lower bounds for off-line range searching. STOC Bernard Chazelle
1995	J	`jnl`	Simplex Range Reporting on a Pointer Machine. Comput. Geom. Bernard Chazelle, Burton Rosenberg
1995	—	`conf`	Strategies for Polyhedral Surface Decomposition: An Experimental Study. SCG Bernard Chazelle, David P. Dobkin, Nadia Shouraboura, Ayellet Tal
1994	A*	`conf`	A Spectral Approach to Lower Bounds FOCS Bernard Chazelle
1994	J	`jnl`	Algorithms for Bichromatic Line-Segment Problems Polyhedral Terrains. Algorithmica Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
1994	—	`conf`	Bounds on the Size of Tetrahedralizations. SCG Bernard Chazelle, Nadia Shouraboura
1994	A*	`conf`	Computational geometry: a retrospective. STOC Bernard Chazelle
1994	—	`conf`	Optimal Slope Selection Via Cuttings. CCCG Hervé Brönnimann, Bernard Chazelle
1994	J	`jnl`	Point Location Among Hyperplanes and Unidirectional Ray-shooting. Comput. Geom. Bernard Chazelle, Joel Friedman
1994	J	`jnl`	Ray Shooting in Polygons Using Geodesic Triangulations. Algorithmica Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink
1994	J	`jnl`	Selecting Heavily Covered Points. SIAM J. Comput. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir
1994	J	`jnl`	Triangulating disjoint Jordan chains. Int. J. Comput. Geom. Appl. Reuven Bar-Yehuda, Bernard Chazelle
1993	J	`jnl`	An Optimal Convex Hull Algorithm in Any Fixed Dimension. Discret. Comput. Geom. Bernard Chazelle
1993	J	`jnl`	Computing a Face in an Arrangement of Line Segments and Related Problems. SIAM J. Comput. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink
1993	J	`jnl`	Cutting Hyperplanes for Divide-and-Conquer. Discret. Comput. Geom. Bernard Chazelle
1993	—	`conf`	Deterministic sampling and optimization. System Modelling and Optimization Bernard Chazelle
1993	J	`jnl`	Diameter, Width, Closest Line Pair, and Parametric Searching. Discret. Comput. Geom. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
1993	A*	`conf`	Geometric Discrepancy Revisited FOCS Bernard Chazelle
1993	J	`jnl`	How Hard Is Half-Space Range Searching. Discret. Comput. Geom. Hervé Brönnimann, Bernard Chazelle, János Pach
1993	A*	`conf`	Improved bounds on weak epsilon-nets for convex sets. STOC Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl
1993	A*	`conf`	On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimensions. SODA Bernard Chazelle, Jirí Matousek
1993	A*	`conf`	Product Range Spaces, Sensitive Sampling, and Derandomization FOCS Hervé Brönnimann, Bernard Chazelle, Jirí Matousek
1992	J	`jnl`	An Optimal Algorithm for Intersecting Line Segments in the Plane. J. ACM Bernard Chazelle, Herbert Edelsbrunner
1992	J	`jnl`	An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra. SIAM J. Comput. Bernard Chazelle
1992	—	`conf`	Decomposing the Boundary of a Nonconvex Polyhedron. SWAT Bernard Chazelle, Leonidas Palios
1992	—	`conf`	Diameter, Width, Closest Line Pair, and Parametric Searching. SCG Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
1992	—	`conf`	How Hard is Halfspace Range Searching? SCG Hervé Brönnimann, Bernard Chazelle
1992	A*	`conf`	Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine. ICALP Bernard Chazelle, Burton Rosenberg
1992	J	`jnl`	Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems. Algorithmica Bernard Chazelle, Micha Sharir, Emo Welzl
1991	J	`jnl`	A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and its Applications. Theor. Comput. Sci. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
1991	A*	`conf`	An Optimal Convex Hull Algorithm and New Results on Cuttings (Extended Abstract) FOCS Bernard Chazelle
1991	A*	`conf`	Computational Geometry for the Gourmet: Old Fare and New Dishes. ICALP Bernard Chazelle
1991	A*	`conf`	Computing a Face in an Arrangement of Line Segments. SODA Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink
1991	J	`jnl`	Counting and Cutting Cycles of Lines and Rods in Space. Comput. Geom. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
1991	J	`jnl`	Points and Triangles in the Plane and Halving Planes in Space. Discret. Comput. Geom. Boris Aronov, Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Rephael Wenger
1991	A*	`conf`	Ray Shooting in Polygons Using Geodesic Triangulations. ICALP Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, John Hershberger, Micha Sharir, Jack Snoeyink
1991	J	`jnl`	The complexity of computing partial sums off-line. Int. J. Comput. Geom. Appl. Bernard Chazelle, Burton Rosenberg
1991	J	`jnl`	Triangulating a Simple Polygon in Linear Time. Discret. Comput. Geom. Bernard Chazelle
1990	J	`jnl`	A deterministic view of random sampling and its use in geometry. Comb. Bernard Chazelle, Joel Friedman
1990	J	`jnl`	An Algorithm for Generalized Point Location and its Applications. J. Symb. Comput. Bernard Chazelle, Micha Sharir
1990	A*	`conf`	Counting and Cutting Cycles of Lines and Rods in Space FOCS Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
1990	J	`jnl`	Lower Bounds for Orthogonal Range Searching II. The Arithmetic Model J. ACM Bernard Chazelle
1990	J	`jnl`	Lower Bounds for Orthogonal Range Searching: I. The Reporting Case J. ACM Bernard Chazelle
1990	—	`conf`	Points and Triangles in the Plane and Halving Planes in Space. SCG Boris Aronov, Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Rephael Wenger
1990	—	`conf`	Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems. SCG Bernard Chazelle, Micha Sharir, Emo Welzl
1990	—	`conf`	Searching in Higher Dimension. SIGAL International Symposium on Algorithms Bernard Chazelle
1990	—	`conf`	Slimming Down by Adding: Selecting Heavily Covered Points. SCG Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir
1990	J	`jnl`	Triangulating a Nonconvex Polytope. Discret. Comput. Geom. Bernard Chazelle, Leonidas Palios
1990	A*	`conf`	Triangulating a Simple Polygon in Linear Time FOCS Bernard Chazelle
1989	A*	`conf`	A Singly-Expenential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications. ICALP Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
1989	A*	`conf`	An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra (Detailed Abstract) FOCS Bernard Chazelle
1989	—	`conf`	Computing Partial Sums in Multidimensional Arrays. SCG Bernard Chazelle, Burton Rosenberg
1989	A*	`conf`	Lines in Space-Combinatorics, Algorithms and Applications STOC Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir
1989	J	`jnl`	Quasi-Optimal Range Searching in Space of Finite VC-Dimension. Discret. Comput. Geom. Bernard Chazelle, Emo Welzl
1989	J	`jnl`	The Complexity of Cutting Complexes. Discret. Comput. Geom. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas
1989	—	`conf`	Triangulating a Non-Convex Polytype. SCG Bernard Chazelle, Leonidas Palios
1989	J	`jnl`	Visibility and Intersection Problems in Plane Geometry. Discret. Comput. Geom. Bernard Chazelle, Leonidas J. Guibas
1988	A*	`conf`	A Deterministic View of Random Sampling and its Use in Geometry FOCS Bernard Chazelle, Joel Friedman
1988	J	`jnl`	A Functional Approach to Data Structures and Its Use in Multidimensional Searching. SIAM J. Comput. Bernard Chazelle
1988	J	`jnl`	An Algorithm for Segment-Dragging and Its Implementation. Algorithmica Bernard Chazelle
1988	A*	`conf`	An Optimal Algorithm for Intersecting Line Segments in the Plane FOCS Bernard Chazelle, Herbert Edelsbrunner
1988	J	`jnl`	Parallel Computational Geometry. Algorithmica Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap
1987	J	`jnl`	An Improved Algorithm for Constructing IEEE Trans. Computers Bernard Chazelle, Herbert Edelsbrunner
1987	J	`jnl`	Computing on a Free Tree via Complexity-Preserving Mappings. Algorithmica Bernard Chazelle
1987	J	`jnl`	Editor's Foreword. Algorithmica Bernard Chazelle
1987	J	`jnl`	Intersection of convex objects in two and three dimensions. J. ACM Bernard Chazelle, David P. Dobkin
1987	J	`jnl`	Linear Space Data Structures for Two Types of Range Search. Discret. Comput. Geom. Bernard Chazelle, Herbert Edelsbrunner
1987	A*	`conf`	Polytope Range Searching and Integral Geometry (Extended Abstract) FOCS Bernard Chazelle
1987	J	`jnl`	Some Techniques for Geometric Searching with Implicit Set Representations. Acta Informatica Bernard Chazelle
1987	A*	`conf`	The Complexity of Cutting Convex Polytopes STOC Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas
1986	J	`jnl`	Computing the Largest Empty Rectangle. SIAM J. Comput. Bernard Chazelle, Robert L. (Scot) Drysdale III, D. T. Lee
1986	J	`jnl`	Filtering Search: A New Approach to Query-Answering. SIAM J. Comput. Bernard Chazelle
1986	J	`jnl`	Fractional Cascading: I. A Data Structuring Technique. Algorithmica Bernard Chazelle, Leonidas J. Guibas
1986	J	`jnl`	Fractional Cascading: II. Applications. Algorithmica Bernard Chazelle, Leonidas J. Guibas
1986	J	`jnl`	Halfspace Range Search: An Algorithmic Application of k-Sets. Discret. Comput. Geom. Bernard Chazelle, Franco P. Preparata
1986	—	`conf`	Linear Data Structures for Two Types of Range Search. SCG Bernard Chazelle, Herbert Edelsbrunner
1986	A*	`conf`	Lower Bounds on the Complexity of Multidimensional Searching (Extended Abstract) FOCS Bernard Chazelle
1986	J	`jnl`	New Upper Bounds for Neighbor Searching Inf. Control. Bernard Chazelle, Richard Cole, Franco P. Preparata, Chee-Keng Yap
1986	J	`jnl`	Reporting and Counting Segment Intersections. J. Comput. Syst. Sci. Bernard Chazelle
1985	J	`jnl`	A Model of Computation for VLSI with Related Complexity Results J. ACM Bernard Chazelle, Louis Monier
1985	—	`conf`	An improved algorithm for constructing kth-order Voronoi diagrams. SCG Bernard Chazelle, Herbert Edelsbrunner
1985	—	`conf`	Fast Searching in a Real Algebraic Manifold with Applications to Geometric Complexity. TAPSOFT, Vol.1 Bernard Chazelle
1985	A*	`conf`	Fractional Cascading: A Data Structuring Technique with Geometric Applications. ICALP Bernard Chazelle, Leonidas J. Guibas
1985	—	`conf`	Halfspace range search: an algorithmic application of K-sets. SCG Bernard Chazelle, Franco P. Preparata
1985	J	`jnl`	How to Search in History Inf. Control. Bernard Chazelle
1985	—	`conf`	New techniques for computing order statistics in Euclidean space (extended abstract). SCG Bernard Chazelle
1985	J	`jnl`	On the convex layers of a planar set. IEEE Trans. Inf. Theory Bernard Chazelle
1985	A*	`conf`	Optimal Solutions for a Class of Point Retrieval Problems. ICALP Bernard Chazelle, Herbert Edelsbrunner
1985	J	`jnl`	Optimal Solutions for a Class of Point Retrieval Problems. J. Symb. Comput. Bernard Chazelle, Herbert Edelsbrunner
1985	A*	`conf`	Parallel Computational Geometry (Extended Abstract) FOCS Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap
1985	A*	`conf`	Slimming Down Search Structures: A Functional Approach to Algorithm Design FOCS Bernard Chazelle
1985	J	`jnl`	The Power of Geometric Duality. BIT Bernard Chazelle, Leonidas J. Guibas, D. T. Lee
1985	—	`conf`	Visibility and intersectin problems in plane geometry. SCG Bernard Chazelle, Leonidas J. Guibas
1984	J	`jnl`	Computational Geometry on a Systolic Chip. IEEE Trans. Computers Bernard Chazelle
1984	A*	`conf`	Computing on a Free Tree via Complexity-Preserving Mappings FOCS Bernard Chazelle
1984	A	`conf`	Computing the Largest Empty Rectangle. STACS Bernard Chazelle, Robert L. (Scot) Drysdale III, D. T. Lee
1984	J	`jnl`	Computing the connected components of D-ranges. Bull. EATCS Bernard Chazelle, Janet Incerpi
1984	J	`jnl`	Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm. SIAM J. Comput. Bernard Chazelle
1984	A*	`conf`	Intersecting Is Easier than Sorting STOC Bernard Chazelle
1984	A*	`conf`	The Complexity and Decidability of Separation. ICALP Bernard Chazelle, Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood
1984	J	`jnl`	Triangulation and Shape-Complexity. ACM Trans. Graph. Bernard Chazelle, Janet Incerpi
1983	J	`jnl`	A Decision Procedure for Optimal Polyhedron Partitioning. Inf. Process. Lett. Bernard Chazelle
1983	J	`jnl`	An Improved Algorithm for the Fixed-Radius Neighbor Problem. Inf. Process. Lett. Bernard Chazelle
1983	A*	`conf`	Filtering Search: A New Approach to Query-Answering FOCS Bernard Chazelle
1983	B	`conf`	How to Search in History. FCT Bernard Chazelle
1983	J	`jnl`	The Bottom-Left Bin-Packing Heuristic: An Efficient Implementation. IEEE Trans. Computers Bernard Chazelle
1983	A*	`conf`	The Power of Geometric Duality FOCS Bernard Chazelle, Leonidas J. Guibas, D. T. Lee
1983	J	`jnl`	Unbounded Hardware is Equivalent to Deterministic Turing Machines. Theor. Comput. Sci. Bernard Chazelle, Louis Monier
1982	A*	`conf`	A Theorem on Polygon Cutting with Applications FOCS Bernard Chazelle
1981	A*	`conf`	A Model of Computation for VLSI with Related Complexity Results STOC Bernard Chazelle, Louis Monier
1981	A*	`conf`	Convex Decompositions of Polyhedra STOC Bernard Chazelle
1980	A*	`conf`	Detection is Easier than Computation (Extended Abstract) STOC Bernard Chazelle, David P. Dobkin
1979	A*	`conf`	Decomposing a Polygon into its Convex Parts STOC Bernard Chazelle, David P. Dobkin