dblp.uni-trier.dewww.uni-trier.de

Bernard Chazelle Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
182EEEric Banks, Elena Nabieva, Bernard Chazelle, Ryan Peterson, Mona Singh: Analyzing and Interrogating Biological Networks (Abstract). BICoB 2009: 14-15
181EEBernard Chazelle: Natural algorithms. SODA 2009: 422-431
180EEBernard Chazelle, Wolfgang Mulzer: Computing hereditary convex structures. Symposium on Computational Geometry 2009: 61-70
179EEBernard Chazelle: The Convergence of Bird Flocking CoRR abs/0905.4241: (2009)
178EENir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri: Self-Improving Algorithms CoRR abs/0907.0884: (2009)
2008
177EEBernard Chazelle, Wolfgang Johann Heinrich Mulzer: Markov incremental constructions. Symposium on Computational Geometry 2008: 156-163
176EENir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu: Property-Preserving Data Reconstruction. Algorithmica 51(2): 160-182 (2008)
175EEBernard Chazelle: Technical perspective: finding a good neighbor, near and fast. Commun. ACM 51(1): 115 (2008)
174EEBernard Chazelle, Ding Liu, Avner Magen: Approximate range searching in higher dimension. Comput. Geom. 39(1): 24-29 (2008)
2007
173EEBernard Chazelle: Ushering in a New Era of Algorithm Design. ICALP 2007: 1
172EENir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu: Estimating the distance to a monotone function. Random Struct. Algorithms 31(3): 371-383 (2007)
2006
171EENir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu: Self-improving algorithms. SODA 2006: 261-270
170EENir Ailon, Bernard Chazelle: Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform. STOC 2006: 557-563
169EEBernard Chazelle, C. Seshadhri: Online geometric reconstruction. Symposium on Computational Geometry 2006: 386-394
168EENir Ailon, Bernard Chazelle: Information theory in property testing and monotonicity testing in higher dimension. Inf. Comput. 204(11): 1704-1717 (2006)
2005
167EEBernard Chazelle: Algorithmic Techniques and Tools from Computational Geometry. FOCS 2005: 7
166EEElena 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
165EENir Ailon, Bernard Chazelle: Information Theory in Property Testing and Monotonicity Testing in Higher Dimension. STACS 2005: 434-447
164EEBernard Chazelle, Ding Liu, Avner Magen: Sublinear Geometric Algorithms. Sublinear Algorithms 2005
163EECarleton L. Kingsford, Bernard Chazelle, Mona Singh: Solving and analyzing side-chain positioning problems using linear and integer programming. Bioinformatics 21(7): 1028-1039 (2005)
162EESanjeev Arora, Bernard Chazelle: Is the thrill gone? Commun. ACM 48(8): 31-33 (2005)
161EENir Ailon, Bernard Chazelle: Lower bounds for linear degeneracy testing. J. ACM 52(2): 157-171 (2005)
160EEBernard Chazelle, Ronitt Rubinfeld, Luca Trevisan: Approximating the Minimum Spanning Tree Weight in Sublinear Time. SIAM J. Comput. 34(6): 1370-1379 (2005)
159EEBernard Chazelle, Ding Liu, Avner Magen: Sublinear Geometric Algorithms. SIAM J. Comput. 35(3): 627-646 (2005)
2004
158EENir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu: Estimating the Distance to a Monotone Function. APPROX-RANDOM 2004: 229-236
157EEDing Liu, Bernard Chazelle, Avner Magen: Approximate range searching in higher dimension. CCCG 2004: 154-157
156EENir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu: Property-Preserving Data Reconstruction. ISAAC 2004: 16-27
155EEBernard Chazelle: Who says you have to look at the input? The brave new world of sublinear computing. SODA 2004: 141
154EEBernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ayellet Tal: The Bloomier filter: an efficient data structure for static support lookup tables. SODA 2004: 30-39
153EENir Ailon, Bernard Chazelle: Lower bounds for linear degeneracy testing. STOC 2004: 554-560
152EEBernard Chazelle: The Power of Nonmonotonicity in Geometric Searching. Discrete & Computational Geometry 31(1): 3-16 (2004)
151EENir Ailon, Bernard Chazelle: Information Theory in Property Testing and Monotonicity Testing in Higher Dimension Electronic Colloquium on Computational Complexity (ECCC)(068): (2004)
150EEBernard 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)
149EEBernard Chazelle, Ding Liu: Lower bounds for intersection searching and fractional cascading in higher dimension. J. Comput. Syst. Sci. 68(2): 269-284 (2004)
2003
148EEBernard Chazelle: Sublinear Computing. ESA 2003: 1
147 Bernard Chazelle, Carl Kingsford, Mona Singh: The Side-Chain Positioning Problem: A Semidefinite Programming Formulation With New Rounding Schemes. PCK50 2003: 86-94
146EEBernard Chazelle, Ding Liu, Avner Magen: Sublinear geometric algorithms. STOC 2003: 531-540
145EEMichael 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)
2002
144EEMichael M. Kazhdan, Bernard Chazelle, David P. Dobkin, Adam Finkelstein, Thomas A. Funkhouser: A Reflective Symmetry Descriptor. ECCV (2) 2002: 642-656
143EEBernard Chazelle: The power of nonmonotonicity in geometric searching. Symposium on Computational Geometry 2002: 88-93
142EERobert Osada, Thomas A. Funkhouser, Bernard Chazelle, David P. Dobkin: Shape distributions. ACM Trans. Graph. 21(4): 807-832 (2002)
141EEBernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristan, Monique Teillaud: Splitting a Delaunay Triangulation in Linear Time. Algorithmica 34(1): 39-46 (2002)
2001
140EEBernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristan, Monique Teillaud: Splitting a Delaunay Triangulation in Linear Time. ESA 2001: 312-320
139EEBernard Chazelle, Ronitt Rubinfeld, Luca Trevisan: Approximating the Minimum Spanning Tree Weight in Sublinear Time. ICALP 2001: 190-200
138EEBernard Chazelle, Ding Liu: Lower bounds for intersection searching and fractional cascading in higher dimension. STOC 2001: 322-329
137EERobert Osada, Thomas A. Funkhouser, Bernard Chazelle, David P. Dobkin: Matching 3D Models with Shape Distributions. Shape Modeling International 2001: 154-166
136EEBernard Chazelle, Alexey Lvov: The Discrepancy of Boxes in Higher Dimension. Discrete & Computational Geometry 25(4): 519-524 (2001)
135EEBernard Chazelle, Alexey Lvov: A Trace Bound for the Hereditary Discrepancy. Discrete & Computational Geometry 26(2): 221-231 (2001)
2000
134EEBernard Chazelle: Irregularities of Distribution, Derandomization, and Complexity Theory. FSTTCS 2000: 46-54
133EEBernard Chazelle, Alexey Lvov: A trace bound for the hereditary discrepancy. Symposium on Computational Geometry 2000: 64-69
132 Sigal Ar, Bernard Chazelle, Ayellet Tal: Self-customized BSP trees for collision detection. Comput. Geom. 15(1-3): 91-102 (2000)
131EEBernard Chazelle: The soft heap: an approximate priority queue with optimal error rate. J. ACM 47(6): 1012-1027 (2000)
130EEBernard Chazelle: A minimum spanning tree algorithm with Inverse-Ackermann type complexity. J. ACM 47(6): 1028-1047 (2000)
1999
129EEBernard Chazelle: Geometric Searching over the Rationals. ESA 1999: 354-365
128EEAmit 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
127 Hervé Brönnimann, Bernard Chazelle, Jirí Matousek: Product Range Spaces, Sensitive Sampling, and Derandomization. SIAM J. Comput. 28(5): 1552-1575 (1999)
1998
126EEBernard Chazelle: Car-Pooling as a Data Structuring Device: The Soft Heap. ESA 1998: 35-42
125EEBernard Chazelle: The Discrepancy Method. ISAAC 1998: 1-3
124 Hervé Brönnimann, Bernard Chazelle: Optimal slope selection via cuttings. Comput. Geom. 10(1): 23-29 (1998)
123 Bernard Chazelle: A Spectral Approach to Lower Bounds with Applications to Geometric Searching. SIAM J. Comput. 27(2): 545-556 (1998)
1997
122EEBernard Chazelle: A Faster Deterministic Algorithm for Minimum Spanning Trees. FOCS 1997: 22-31
121 Bernard Chazelle: Discrepancy Theory and Computational Geometry. WADS 1997: 1-2
120 Bernard Chazelle, Leonidas Palios: Decomposing the Boundary of a Nonconvex Polyhedron. Algorithmica 17(3): 245-265 (1997)
119 Bernard Chazelle, David P. Dobkin, Nadia Shouraboura, Ayellet Tal: Strategies for Polyhedral Surface Decomposition: an Experimental Study. Comput. Geom. 7: 327-342 (1997)
118EEBernard Chazelle: Lower Bounds for Off-Line Range Searching. Discrete & Computational Geometry 17(1): 53-65 (1997)
1996
117 Bernard Chazelle: The Computational Geometry Impact Task Force Report: An Executive Summary. WACG 1996: 59-65
116 Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jorge Stolfi: Lines in Space: Combinatorics and Algorithms. Algorithmica 15(5): 428-447 (1996)
115EEGill 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)
114 Bernard Chazelle, Jirí Matousek: On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension. J. Algorithms 21(3): 579-597 (1996)
1995
113EEBernard Chazelle: Lower bounds for off-line range searching. STOC 1995: 733-740
112EEBernard Chazelle, David P. Dobkin, Nadia Shouraboura, Ayellet Tal: Strategies for Polyhedral Surface Decomposition: An Experimental Study. Symposium on Computational Geometry 1995: 297-305
111EEBernard Chazelle, David P. Dobkin, Nadia Shouraboura, Ayellet Tal: Convex Surface Decomposition. Symposium on Computational Geometry 1995: V9-V10
110 Bernard Chazelle, Burton Rosenberg: Simplex Range Reporting on a Pointer Machine. Comput. Geom. 5: 237-247 (1995)
109 Bernard Chazelle, Jirí Matousek: Derandomizing an Output-sensitive Convex Hull Algorithm in Three Dimensions. Comput. Geom. 5: 27-32 (1995)
108 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)
107 Bernard Chazelle, Jirí Matousek, Micha Sharir: An Elementary Approach to Lower Bounds in Geometric Discrepancy. Discrete & Computational Geometry 13: 363-381 (1995)
106 Bernard Chazelle, Nadia Shouraboura: Bounds on the Size of Tetrahedralizations. Discrete & Computational Geometry 14(4): 429-444 (1995)
1994
105 Hervé Brönnimann, Bernard Chazelle: Optimal Slope Selection Via Cuttings. CCCG 1994: 99-103
104 Bernard Chazelle: A Spectral Approach to Lower Bounds FOCS 1994: 674-682
103EEBernard Chazelle: Computational geometry: a retrospective. STOC 1994: 75-94
102EEBernard Chazelle, Nadia Shouraboura: Bounds on the Size of Tetrahedralizations. Symposium on Computational Geometry 1994: 231-239
101 Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir: Algorithms for Bichromatic Line-Segment Problems Polyhedral Terrains. Algorithmica 11(2): 116-132 (1994)
100 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)
99 Bernard Chazelle, Joel Friedman: Point Location Among Hyperplanes and Unidirectional Ray-shooting. Comput. Geom. 4: 53-62 (1994)
98 Reuven Bar-Yehuda, Bernard Chazelle: Triangulating disjoint Jordan chains. Int. J. Comput. Geometry Appl. 4(4): 475-481 (1994)
97 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)
1993
96 Bernard Chazelle: Geometric Discrepancy Revisited FOCS 1993: 392-399
95 Hervé Brönnimann, Bernard Chazelle, Jirí Matousek: Product Range Spaces, Sensitive Sampling, and Derandomization FOCS 1993: 400-409
94 Bernard Chazelle, Jirí Matousek: On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimensions. SODA 1993: 281-290
93EEBernard 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
92 Hervé Brönnimann, Bernard Chazelle, János Pach: How Hard Is Half-Space Range Searching. Discrete & Computational Geometry 10: 143-155 (1993)
91 Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir: Diameter, Width, Closest Line Pair, and Parametric Searching. Discrete & Computational Geometry 10: 183-196 (1993)
90 Bernard Chazelle: An Optimal Convex Hull Algorithm in Any Fixed Dimension. Discrete & Computational Geometry 10: 377-409 (1993)
89 Bernard Chazelle: Cutting Hyperplanes for Divide-and-Conquer. Discrete & Computational Geometry 9: 145-158 (1993)
88 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)
1992
87EEBernard Chazelle, Burton Rosenberg: Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine. ICALP 1992: 439-449
86EEBernard Chazelle, Leonidas Palios: Decomposing the Boundary of a Nonconvex Polyhedron. SWAT 1992: 364-375
85EEBernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir: Diameter, Width, Closest Line Pair, and Parametric Searching. Symposium on Computational Geometry 1992: 120-129
84EEHervé Brönnimann, Bernard Chazelle: How Hard is Halfspace Range Searching? Symposium on Computational Geometry 1992: 271-275
83 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)
82EEBernard Chazelle, Herbert Edelsbrunner: An Optimal Algorithm for Intersecting Line Segments in the Plane. J. ACM 39(1): 1-54 (1992)
81 Bernard Chazelle: An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra. SIAM J. Comput. 21(4): 671-696 (1992)
1991
80 Bernard Chazelle: An Optimal Convex Hull Algorithm and New Results on Cuttings (Extended Abstract) FOCS 1991: 29-38
79EEBernard 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
78EEBernard Chazelle: Computational Geometry for the Gourmet: Old Fare and New Dishes. ICALP 1991: 686-696
77 Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jack Snoeyink: Computing a Face in an Arrangement of Line Segments. SODA 1991: 441-448
76 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)
75 Boris Aronov, Bernard Chazelle, Herbert Edelsbrunner: Points and Triangles in the Plane and Halving Planes in Space. Discrete & Computational Geometry 6: 435-442 (1991)
74 Bernard Chazelle: Triangulating a Simple Polygon in Linear Time. Discrete & Computational Geometry 6: 485-524 (1991)
73 Bernard Chazelle, Burton Rosenberg: The complexity of computing partial sums off-line. Int. J. Comput. Geometry Appl. 1(1): 33-45 (1991)
72 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)
1990
71 Bernard Chazelle: Triangulating a Simple Polygon in Linear Time FOCS 1990: 220-230
70 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
69EEBernard Chazelle: Searching in Higher Dimension. SIGAL International Symposium on Algorithms 1990: 155
68EEBoris 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
67EEBernard 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
66EEBernard Chazelle, Micha Sharir, Emo Welzl: Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems. Symposium on Computational Geometry 1990: 23-33
65 Bernard Chazelle, Joel Friedman: A deterministic view of random sampling and its use in geometry. Combinatorica 10(3): 229-249 (1990)
64 Bernard Chazelle, Leonidas Palios: Triangulating a Nonconvex Polytope. Discrete & Computational Geometry 5: 505-526 (1990)
63EEBernard Chazelle: Lower Bounds for Orthogonal Range Searching: I. The Reporting Case J. ACM 37(2): 200-212 (1990)
62EEBernard Chazelle: Lower Bounds for Orthogonal Range Searching II. The Arithmetic Model J. ACM 37(3): 439-463 (1990)
61 Bernard Chazelle, Micha Sharir: An Algorithm for Generalized Point Location and its Applications. J. Symb. Comput. 10(3/4): 281-310 (1990)
1989
60 Bernard Chazelle: An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra (Detailed Abstract) FOCS 1989: 586-591
59EEBernard 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
58 Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir: Lines in Space-Combinatorics, Algorithms and Applications STOC 1989: 382-393
57EEBernard Chazelle, Burton Rosenberg: Computing Partial Sums in Multidimensional Arrays. Symposium on Computational Geometry 1989: 131-139
56EEBernard Chazelle, Leonidas Palios: Triangulating a Non-Convex Polytype. Symposium on Computational Geometry 1989: 393-400
55 Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas: The Complexity of Cutting Complexes. Discrete & Computational Geometry 4: 139-181 (1989)
54 Bernard Chazelle, Emo Welzl: Quasi-Optimal Range Searching in Space of Finite VC-Dimension. Discrete & Computational Geometry 4: 467-489 (1989)
53 Bernard Chazelle, Leonidas J. Guibas: Visibility and Intersection Problems in Plane Geometry. Discrete & Computational Geometry 4: 551-581 (1989)
1988
52 Bernard Chazelle, Joel Friedman: A Deterministic View of Random Sampling and its Use in Geometry FOCS 1988: 539-549
51 Bernard Chazelle, Herbert Edelsbrunner: An Optimal Algorithm for Intersecting Line Segments in the Plane FOCS 1988: 590-600
50 Bernard Chazelle: An Algorithm for Segment-Dragging and Its Implementation. Algorithmica 3: 205-221 (1988)
49 Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap: Parallel Computational Geometry. Algorithmica 3: 293-327 (1988)
48 Bernard Chazelle: A Functional Approach to Data Structures and Its Use in Multidimensional Searching. SIAM J. Comput. 17(3): 427-462 (1988)
1987
47 Bernard Chazelle: Polytope Range Searching and Integral Geometry (Extended Abstract) FOCS 1987: 1-10
46 Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas: The Complexity of Cutting Convex Polytopes STOC 1987: 66-76
45 Bernard Chazelle: Some Techniques for Geometric Searching with Implicit Set Representations. Acta Inf. 24(5): 565-582 (1987)
44 Bernard Chazelle: Editor's Foreword. Algorithmica 2: 135-136 (1987)
43 Bernard Chazelle: Computing on a Free Tree via Complexity-Preserving Mappings. Algorithmica 2: 337-361 (1987)
42 Bernard Chazelle, Herbert Edelsbrunner: Linear Space Data Structures for Two Types of Range Search. Discrete & Computational Geometry 2: 113-126 (1987)
41 Bernard Chazelle, Herbert Edelsbrunner: An Improved Algorithm for Constructing k th-Order Voronoi Diagrams. IEEE Trans. Computers 36(11): 1349-1354 (1987)
40EEBernard Chazelle, David P. Dobkin: Intersection of convex objects in two and three dimensions. J. ACM 34(1): 1-27 (1987)
1986
39 Bernard Chazelle: Lower Bounds on the Complexity of Multidimensional Searching (Extended Abstract) FOCS 1986: 87-96
38EEBernard Chazelle, Herbert Edelsbrunner: Linear Data Structures for Two Types of Range Search. Symposium on Computational Geometry 1986: 293-302
37 Bernard Chazelle, Leonidas J. Guibas: Fractional Cascading: I. A Data Structuring Technique. Algorithmica 1(2): 133-162 (1986)
36 Bernard Chazelle, Leonidas J. Guibas: Fractional Cascading: II. Applications. Algorithmica 1(2): 163-191 (1986)
35 Bernard Chazelle, Franco P. Preparata: Halfspace Range Search: An Algorithmic Application of k-Sets. Discrete & Computational Geometry 1: 83-93 (1986)
34 Bernard Chazelle, R. Cole, Franco P. Preparata, Chee-Keng Yap: New Upper Bounds for Neighbor Searching Information and Control 68(1-3): 105-124 (1986)
33 Bernard Chazelle: Reporting and Counting Segment Intersections. J. Comput. Syst. Sci. 32(2): 156-182 (1986)
32 Bernard Chazelle, Robert L. (Scot) Drysdale III, D. T. Lee: Computing the Largest Empty Rectangle. SIAM J. Comput. 15(1): 300-315 (1986)
31 Bernard Chazelle: Filtering Search: A New Approach to Query-Answering. SIAM J. Comput. 15(3): 703-724 (1986)
1985
30 Bernard Chazelle: Slimming Down Search Structures: A Functional Approach to Algorithm Design FOCS 1985: 165-174
29 Alok Aggarwal, Bernard Chazelle, Leonidas J. Guibas, Colm Ó'Dúnlaing, Chee-Keng Yap: Parallel Computational Geometry (Extended Abstract) FOCS 1985: 468-477
28EEBernard Chazelle, Herbert Edelsbrunner: Optimal Solutions for a Class of Point Retrieval Problems. ICALP 1985: 80-89
27EEBernard Chazelle, Leonidas J. Guibas: Fractional Cascading: A Data Structuring Technique with Geometric Applications. ICALP 1985: 90-100
26EEBernard Chazelle: Fast Searching in a Real Algebraic Manifold with Applications to Geometric Complexity. TAPSOFT, Vol.1 1985: 145-156
25 Bernard Chazelle, Leonidas J. Guibas, D. T. Lee: The Power of Geometric Duality. BIT 25(1): 76-90 (1985)
24 Bernard Chazelle: On the convex layers of a planar set. IEEE Transactions on Information Theory 31(4): 509-517 (1985)
23 Bernard Chazelle: How to Search in History Information and Control 64(1-3): 77-99 (1985)
22EEBernard Chazelle, Louis Monier: A Model of Computation for VLSI with Related Complexity Results J. ACM 32(3): 573-588 (1985)
21 Bernard Chazelle, Herbert Edelsbrunner: Optimal Solutions for a Class of Point Retrieval Problems. J. Symb. Comput. 1(1): 47-56 (1985)
1984
20 Bernard Chazelle: Computing on a Free Tree via Complexity-Preserving Mappings FOCS 1984: 358-368
19EEBernard Chazelle, Thomas Ottmann, Eljas Soisalon-Soininen, Derick Wood: The Complexity and Decidability of Separation. ICALP 1984: 119-127
18EEBernard Chazelle, Robert L. (Scot) Drysdale III, D. T. Lee: Computing the Largest Empty Rectangle. STACS 1984: 43-54
17 Bernard Chazelle: Intersecting Is Easier than Sorting STOC 1984: 125-134
16EEBernard Chazelle, Janet Incerpi: Triangulation and Shape-Complexity. ACM Trans. Graph. 3(2): 135-152 (1984)
15 Bernard Chazelle, Janet Incerpi: Computing the connected components of D-ranges. Bulletin of the EATCS 22: 9-10 (1984)
14 Bernard Chazelle: Computational Geometry on a Systolic Chip. IEEE Trans. Computers 33(9): 774-785 (1984)
13 Bernard Chazelle: Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm. SIAM J. Comput. 13(3): 488-507 (1984)
1983
12 Bernard Chazelle: How to Search in History. FCT 1983: 52-63
11 Bernard Chazelle: Filtering Search: A New Approach to Query-Answering FOCS 1983: 122-132
10 Bernard Chazelle, Leonidas J. Guibas, D. T. Lee: The Power of Geometric Duality FOCS 1983: 217-225
9 Bernard Chazelle: The Bottom-Left Bin-Packing Heuristic: An Efficient Implementation. IEEE Trans. Computers 32(8): 697-707 (1983)
8 Bernard Chazelle: A Decision Procedure for Optimal Polyhedron Partitioning. Inf. Process. Lett. 16(2): 75-78 (1983)
7 Bernard Chazelle: An Improved Algorithm for the Fixed-Radius Neighbor Problem. Inf. Process. Lett. 16(4): 193-198 (1983)
6 Bernard Chazelle, Louis Monier: Unbounded Hardware is Equivalent to Deterministic Turing Machines. Theor. Comput. Sci. 24: 123-130 (1983)
1982
5 Bernard Chazelle: A Theorem on Polygon Cutting with Applications FOCS 1982: 339-349
1981
4 Bernard Chazelle, Louis Monier: A Model of Computation for VLSI with Related Complexity Results STOC 1981: 318-325
3 Bernard Chazelle: Convex Decompositions of Polyhedra STOC 1981: 70-79
1980
2 Bernard Chazelle, David P. Dobkin: Detection is Easier than Computation (Extended Abstract) STOC 1980: 146-153
1979
1 Bernard Chazelle, David P. Dobkin: Decomposing a Polygon into its Convex Parts STOC 1979: 38-48

Coauthor Index

1Vera Sacristán Adinolfi (Vera Sacristan) [140] [141]
2Amit Agarwal [166]
3Alok Aggarwal [29] [49]
4Nir Ailon [151] [153] [156] [158] [161] [165] [168] [170] [171] [172] [176] [178]
5Sigal Ar [132]
6Boris Aronov [68] [75]
7Sanjeev Arora [162]
8Eric Banks [182]
9Reuven Bar-Yehuda [98]
10Gill Barequet [115]
11Hervé Brönnimann [84] [92] [95] [105] [124] [127]
12Amit Chakrabarti [128]
13Kenneth L. Clarkson [178]
14R. Cole [34]
15Seshadhri Comandur [156] [158] [171] [172] [176]
16Olivier Devillers [140] [141]
17David P. Dobkin [1] [2] [40] [111] [112] [119] [137] [142] [144] [145]
18Robert L. Scot Drysdale (Robert L. (Scot) Drysdale III) [18] [32]
19Herbert Edelsbrunner [21] [28] [38] [41] [42] [46] [51] [55] [58] [59] [67] [68] [70] [72] [75] [76] [77] [79] [82] [85] [88] [91] [93] [97] [100] [101] [108] [116]
20Adam Finkelstein [144]
21Joel Friedman [52] [65] [99]
22Thomas A. Funkhouser [137] [142] [144] [145]
23Michelangelo Grigni [79] [93] [100] [108]
24Leonidas J. Guibas [10] [25] [27] [29] [36] [37] [46] [49] [53] [55] [58] [59] [67] [68] [70] [72] [76] [77] [79] [85] [88] [91] [93] [97] [100] [101] [108] [115] [116]
25Benjamin Gum [128]
26John Hershberger [67] [79] [97] [100]
27Ferran Hurtado [140] [141]
28Janet Incerpi [15] [16]
29Kam Jim [166]
30Michael M. Kazhdan [144] [145]
31Joe Kilian [154]
32Carl Kingsford [147] [150]
33Carleton L. Kingsford [163]
34D. T. Lee (Der-Tsai Lee) [10] [18] [25] [32]
35Ding Liu [138] [146] [149] [156] [157] [158] [159] [164] [171] [172] [174] [176] [178]
36Alexey Lvov [128] [133] [135] [136]
37Avner Magen [146] [157] [159] [164] [174]
38Jirí Matousek [94] [95] [107] [109] [114] [127]
39Joseph S. B. Mitchell [115]
40Louis Monier [4] [6] [22]
41Mercè Mora [140] [141]
42Wolfgang Mulzer (Wolfgang Johann Heinrich Mulzer) [177] [178] [180]
43Elena Nabieva [166] [182]
44Colm Ó'Dúnlaing [29] [49]
45Robert Osada [137] [142]
46Thomas Ottmann [19]
47János Pach [92]
48Leonidas Palios [56] [64] [86] [120]
49Ryan Peterson [182]
50Richard Pollack [70] [76]
51Franco P. Preparata [34] [35]
52Burton Rosenberg [57] [73] [87] [110]
53Ronitt Rubinfeld [139] [154] [160]
54Szymon Rusinkiewicz [145]
55Raimund Seidel [67] [70] [76] [97]
56C. Seshadhri [169] [178]
57Micha Sharir [58] [59] [61] [66] [67] [68] [70] [72] [76] [77] [79] [83] [85] [88] [91] [93] [97] [100] [101] [107] [108] [116]
58Nadia Shouraboura [102] [106] [111] [112] [119]
59Mona Singh [147] [150] [163] [166] [182]
60Jack Snoeyink [70] [76] [77] [79] [88] [100]
61Eljas Soisalon-Soininen [19]
62Jorge Stolfi [116]
63Ayellet Tal [111] [112] [115] [119] [132] [154]
64Monique Teillaud [140] [141]
65Luca Trevisan [139] [160]
66Emo Welzl [54] [66] [83] [93] [108]
67Rephael Wenger [68]
68Derick Wood [19]
69Chee-Keng Yap (Chee Yap) [29] [34] [49]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)