Chazelle, Bernard - Department of Computer Science, Princeton University

• Return to List Item: 5 of 99 First Last MSN-Support Help Retrieve citation in BibTeX or ASCII format.
• SIAM J. COMPUT. c 2005 Society for Industrial and Applied Mathematics Vol. 34, No. 6, pp. 13701379
• Estimating the Distance to a Monotone Function Bernard Chazelle
• The Algorithm: Idiom of Modern Science http://www.cs.princeton.edu/~chazelle/pubs/algorithm-print.html 1 of 14 9/26/2007 12:22 PM
• Computing Hereditary Convex Structures Bernard Chazelle
• DOI: 10.1007/s00453-003-1050-5 Algorithmica (2004) 38: 201225
• Computational Geometry for the Gourmet Old Fare and New Dishes
• FEbrUary 2010 | VoL. 53 | No. 2 | communicAtions of the Acm 97 Faster Dimension Reduction
• Technical Perspective: Finding a Good Neighbor, Near and Fast
• Analytical Tools for Natural Algorithms Bernard Chazelle
• Natural Algorithms Bernard Chazelle
• Algorithmica (2008) 51: 160182 DOI 10.1007/s00453-007-9075-9
• Computational Geometry 39 (2008) 2429 www.elsevier.com/locate/comgeo
• BIOINFORMATICS Vol. 21 Suppl. 1 2005, pages i302i310
• Bernard Chazelle Princeton University
• INFORMS Journal on Computing Vol. 16, No. 4, Fall 2004, pp. 380392
• 0-8493-8524-5/97/$0.00+$.50 c 1997 by CRC Press LLC
• A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching
• DOI: 10.1007/s00453-002-0939-8 Algorithmica (2002) 34: 3946
• Geometric Searching over the Rationals Bernard Chazelle
• A SPECTRAL APPROACH TO LOWER BOUNDS WITH APPLICATIONS TO GEOMETRIC SEARCHING
• SIAM J. COMPUT. Vol. 23, No. 6, pp. 1138-1151, December 1994
• Computational Geometry: Theory and Applications 1 (1992) 305-323 Counting and cutting cycles of
• Lower Bounds for Orthogonal Range Searching: II. The Arithmetic Model
• SIAM J. COMPUT. Voi. 15, No. 1, February 1986
• A Model of Computation for VLSI with Related Complexity Results
• SIAM J. COMPUT. Vol. 13, No. 3, August 1984
• Criticality Considerations in the Design of Geometric Algorithms Bernard Chazelle
• Information Processing Letters 16 (1983) 193-198 North-Holland Publishing Company
• Theoretical Computer Science 24 (1983) 123-130 North-Holland
• Information Processing Letters 16 (1983) 75-78 North-Holland Publishing Company
• Zbl 0960.65149 Chazelle, Bernard
• Self-Improving Algorithms Bernard Chazelle
• Copyright Bernard Chazelle July 2009 home Printable PDF How to Argue Against Torture
• Copyright Bernard Chazelle October 2008 home by Bernard Chazelle
• Bush the Empire Slayer http://www.cs.princeton.edu/~chazelle/politics/bush-jan07-print.html 1 of 11 1/14/2007 7:02 PM
• Background In March, 2003, military forces, mainly from the USA and the UK, invaded Iraq. We did a survey to compare mortality during the period of 146 months before the invasion with the 178 months after it.
• Bernard Chazelle Curriculum Vitae
• Discrete Comput Geom (2009) 42: 399420 DOI 10.1007/s00454-009-9170-6
• Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. COMPUT. c 2011 Society for Industrial and Applied Mathematics
• COMMUNICATIONS OF THE ACM August 2005/Vol. 48, No. 8 31 he irony is hard to miss
• Lower Bounds for Orthogonal Range Searching: I. The Reporting Case
• Information and Computation 204 (2006) 17041717 www.elsevier.com/locate/ic
• SIAM J. COMPUT. c 2006 Society for Industrial and Applied Mathematics Vol. 35, No. 3, pp. 627646
• Shape Distributions ROBERT OSADA, THOMAS FUNKHOUSER, BERNARD CHAZELLE, and DAVID DOBKIN
• Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. COMPUT. c 2009 Society for Industrial and Applied Mathematics
• http://www.elsevier.com/locate/jcss Journal of Computer and System Sciences 68 (2004) 269284
• The Bloomier Filter: An Efficient Data Structure for Static Support Lookup Tables
• Saving the American Left: The Case for a New Progressive Creed http://www.cs.princeton.edu/~chazelle/politics/creed-print.html 1 of 12 4/6/2008 6:30 PM
• DOI: 10.1007/s00454-001-0030-2 Discrete Comput Geom 26:221231 (2001) Discrete & Computational
• Z .JOURNAL OF ALGORITHMS 21, 579 597 1996 ARTICLE NO. 0060
• BIOINFORMATICS ORIGINAL PAPER Vol. 21 no. 7 2005, pages 10281036
• Lower Bounds for Linear Degeneracy Testing NIR AILON AND BERNARD CHAZELLE
• C E L E B R A T I N G 7 5 Y E A R S 1 9 2 9 -2 0 0 4 Vol. 60, No. 2 A publication of the Population Reference Bureau
• Online Geometric Reconstruction Bernard Chazelle
• EUROGRAPHICS '96 / J. Rossignac and F. Sillion (Guest Editors), Blackwell Publishers
• Theoretical Computer Science 84 (1991) 77-105 A singly exponential stratification
• Organization of Physical Interactomes as Uncovered by Network Schemas
• Algorithmica (1997) 17: 245265 Algorithmica
• COMPLEXITY BOUNDS VIA ROTH'S METHOD OF ORTHOGONAL FUNCTIONS
• IEEE TRANSACTIONS ON INFORhlATION THEORY, VOL. IT-31, NO. 4, JULY 1985 509 On the Convex Layers of a Planar Set
• SIAM J. COMPUT. Vol. 15, No. 3, August 1986
• SIAM J. COMPUT. Vol. 21, No. 4, pp. 671-696, August 1992
• glory. That done, you are seized by doubt. How wise is it to inflict the full brunt of your genius
• North Station North Station
• TRIANGULATION AND SHAPE-BERNARD CHAZELLE AND JANET INCERPI
• SIAM J. COMPUT. Vol. 17, No. 3, June 1988
• -1 10-1/2 1/2 0 1 2 3G GG G
• Intersection of ConvexObjects in Two andThree B. CHAZELLE
• SIAM J. COMPUT. Vol. 22, No. 6, pp. 1286-1302, December 1993
• Computing Partial Sums in Multidimensional Arrays (Detailed Abstract)
• Computational TheoryandApplications
• An Optimal Algorithm for Intersecting Line Segments in the Plane
• CREDIT:P.HUEY/SCIENCE PERSPECTIVES process extension, and how is the megakary-
• Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. CONTROL OPTIM. c 2011 Society for Industrial and Applied Mathematics
• Discrete Comput Geom (2011) 45: 796823 DOI 10.1007/s00454-011-9346-8
• Online Geometric Reconstruction BERNARD CHAZELLE, Princeton University