The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Bernard Chazelle: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  172. Markov incremental constructions. [Citation Graph (, )][DBLP]


  173. Visibility and intersectin problems in plane geometry. [Citation Graph (, )][DBLP]


  174. Computing hereditary convex structures. [Citation Graph (, )][DBLP]


  175. The geometry of flocking. [Citation Graph (, )][DBLP]


  176. A geometric approach to collective motion. [Citation Graph (, )][DBLP]


  177. An improved algorithm for constructing kth-order Voronoi diagrams. [Citation Graph (, )][DBLP]


  178. Halfspace range search: an algorithmic application of K-sets. [Citation Graph (, )][DBLP]


  179. New techniques for computing order statistics in Euclidean space (extended abstract). [Citation Graph (, )][DBLP]


  180. Sublinear Geometric Algorithms. [Citation Graph (, )][DBLP]


  181. Natural algorithms. [Citation Graph (, )][DBLP]


  182. Analyzing and Interrogating Biological Networks (Abstract). [Citation Graph (, )][DBLP]


  183. Analytical Tools for Natural Algorithms. [Citation Graph (, )][DBLP]


  184. Property-Preserving Data Reconstruction. [Citation Graph (, )][DBLP]


  185. Technical perspective: finding a good neighbor, near and fast. [Citation Graph (, )][DBLP]


  186. Faster dimension reduction. [Citation Graph (, )][DBLP]


  187. The Convergence of Bird Flocking [Citation Graph (, )][DBLP]


  188. Self-Improving Algorithms [Citation Graph (, )][DBLP]


  189. The Total s-Energy of a Multiagent System [Citation Graph (, )][DBLP]


  190. Markov Incremental Constructions. [Citation Graph (, )][DBLP]


Search in 0.149secs, Finished in 0.155secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002