Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDBernard Chazelle
Bernard Marie Chazelle
Person information
- affiliation: Princeton University, Department of Computer Science
- affiliation: Institute for Advanced Study (IAS), Princeton
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[j109]Bernard Chazelle
:
On the Periodicity of Random Walks in Dynamic Networks. IEEE Trans. Netw. Sci. Eng. 7(3): 1337-1343 (2020)- [c109]Borislav H. Hristov, Bernard Chazelle, Mona Singh:
A Guided Network Propagation Approach to Identify Disease Genes that Combines Prior and New Information. RECOMB 2020: 251-252
2010 – 2019
- 2019
- [j108]Bernard Chazelle, Chu Wang:
Iterated Learning in Dynamic Social Networks. J. Mach. Learn. Res. 20: 29:1-29:28 (2019) - [j107]Bernard Chazelle:
A Sharp Bound on the s-Energy and Its Applications to Averaging Systems. IEEE Trans. Autom. Control. 64(10): 4385-4390 (2019) - [c108]Bernard Chazelle:
Some Observations on Dynamic Random Walks and Network Renormalization. FCT 2019: 18-28 - 2018
- [c107]Bernard Chazelle:
Toward a Theory of Markov Influence Systems and their Renormalization. ITCS 2018: 58:1-58:18 - [i12]Bernard Chazelle:
A Sharp Bound on the s-Energy. CoRR abs/1802.01207 (2018) - [i11]Bernard Chazelle:
Toward a Theory of Markov Influence Systems and their Renormalization. CoRR abs/1802.01208 (2018) - 2017
- [j106]Bernard Chazelle, Chu Wang:
Inertial Hegselmann-Krause Systems. IEEE Trans. Autom. Control. 62(8): 3905-3913 (2017) - [c106]Chu Wang, Bernard Chazelle:
Gaussian Learning-Without-Recall in a dynamic social network. ACC 2017: 5109-5114 - [c105]Bernard Chazelle, Chu Wang:
Self-Sustaining Iterated Learning. ITCS 2017: 17:1-17:17 - 2016
- [c104]Bernard Chazelle, Chu Wang:
Inertial Hegselmann-Krause systems. ACC 2016: 1936-1941 - [c103]Chu Wang, Qianxiao Li, Weinan E, Bernard Chazelle:
Noisy Hegselmann-Krause systems: Phase transition and the 2R-conjecture. CDC 2016: 2632-2637 - [c102]Bernard Chazelle:
The Challenges of Natural Algorithms. GECCO 2016: 1 - [i10]Bernard Chazelle, Chu Wang:
Self-Sustaining Iterated Learning. CoRR abs/1609.03960 (2016) - 2015
- [j105]Bernard Chazelle, Wolfgang Mulzer:
Data Structures on Event Graphs. Algorithmica 71(4): 1007-1020 (2015) - [j104]Bernard Chazelle:
Diffusive Influence Systems. SIAM J. Comput. 44(5): 1403-1442 (2015) - [j103]Bernard Chazelle:
Algorithmic Renormalization for Network Dynamics. IEEE Trans. Netw. Sci. Eng. 2(1): 1-16 (2015) - [c101]Bernard Chazelle:
Communication, Dynamics, and Renormalization. CIAC 2015: 1-32 - [i9]Bernard Chazelle, Chu Wang:
Inertial Hegselmann-Krause Systems. CoRR abs/1502.03332 (2015) - 2014
- [j102]Bernard Chazelle:
The Convergence of Bird Flocking. J. ACM 61(4): 21:1-21:35 (2014) - [j101]Bernard Chazelle:
How Many Bits Can a Flock of Birds Compute? Theory Comput. 10: 421-451 (2014) - 2013
- [c100]Arnab Bhattacharyya, Mark Braverman, Bernard Chazelle, Huy L. Nguyen:
On the convergence of the Hegselmann-Krause system. ITCS 2013: 61-66 - 2012
- [j100]Bernard Chazelle:
Natural algorithms and influence systems. Commun. ACM 55(12): 101-110 (2012) - [c99]Bernard Chazelle, Wolfgang Mulzer:
Data Structures on Event Graphs. ESA 2012: 313-324 - [c98]Bernard Chazelle:
The Dynamics of Influence Systems. FOCS 2012: 311-320 - [i8]Bernard Chazelle:
The Dynamics of Influence Systems. CoRR abs/1204.3946 (2012) - [i7]Bernard Chazelle, Wolfgang Mulzer:
Data Structures on Event Graphs. CoRR abs/1206.6193 (2012) - [i6]Arnab Bhattacharyya, Mark Braverman, Bernard Chazelle, Huy L. Nguyen:
On the Convergence of the Hegselmann-Krause System. CoRR abs/1211.1909 (2012) - 2011
- [j99]Bernard Chazelle, Wolfgang Mulzer:
Computing Hereditary Convex Structures. Discret. Comput. Geom. 45(4): 796-823 (2011) - [j98]Bernard Chazelle, C. Seshadhri:
Online geometric reconstruction. J. ACM 58(4): 14:1-14:32 (2011) - [j97]Bernard Chazelle:
The Total s-Energy of a Multiagent System. SIAM J. Control. Optim. 49(4): 1680-1706 (2011) - [j96]Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri:
Self-Improving Algorithms. SIAM J. Comput. 40(2): 350-375 (2011) - [e1]Bernard Chazelle:
Innovations in Computer Science - ICS 2011, Tsinghua University, Beijing, China, January 7-9, 2011. Proceedings. Tsinghua University Press 2011, ISBN 978-7-302-24517-9 [contents] - 2010
- [j95]Nir Ailon, Bernard Chazelle:
Faster dimension reduction. Commun. ACM 53(2): 97-104 (2010) - [c97]Bernard Chazelle:
The geometry of flocking. Symposium on Computational Geometry 2010: 19-28 - [c96]Bernard Chazelle:
A geometric approach to collective motion. Symposium on Computational Geometry 2010: 117-126 - [c95]Bernard Chazelle:
Analytical Tools for Natural Algorithms. ICS 2010: 32-41 - [i5]Bernard Chazelle:
The Total s-Energy of a Multiagent System. CoRR abs/1004.1447 (2010)
2000 – 2009
- 2009
- [j94]Bernard Chazelle, Wolfgang Mulzer:
Markov Incremental Constructions. Discret. Comput. Geom. 42(3): 399-420 (2009) - [j93]Nir Ailon, Bernard Chazelle:
The Fast Johnson--Lindenstrauss Transform and Approximate Nearest Neighbors. SIAM J. Comput. 39(1): 302-322 (2009) - [c94]Eric Banks, Elena Nabieva, Bernard Chazelle, Ryan Peterson, Mona Singh:
Analyzing and Interrogating Biological Networks (Abstract). BICoB 2009: 14-15 - [c93]Bernard Chazelle, Wolfgang Mulzer:
Computing hereditary convex structures. Symposium on Computational Geometry 2009: 61-70 - [c92]Bernard Chazelle:
Natural algorithms. SODA 2009: 422-431 - [i4]Bernard Chazelle:
The Convergence of Bird Flocking. CoRR abs/0905.4241 (2009) - [i3]Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri:
Self-Improving Algorithms. CoRR abs/0907.0884 (2009) - 2008
- [j92]Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu:
Property-Preserving Data Reconstruction. Algorithmica 51(2): 160-182 (2008) - [j91]Bernard Chazelle:
Technical perspective: finding a good neighbor, near and fast. Commun. ACM 51(1): 115 (2008) - [j90]Bernard Chazelle, Ding Liu, Avner Magen:
Approximate range searching in higher dimension. Comput. Geom. 39(1): 24-29 (2008) - [j89]Eric Banks, Elena Nabieva, Bernard Chazelle, Mona Singh:
Organization of Physical Interactomes as Uncovered by Network Schemas. PLoS Comput. Biol. 4(10) (2008) - [c91]Bernard Chazelle, Wolfgang Johann Heinrich Mulzer:
Markov incremental constructions. Symposium on Computational Geometry 2008: 156-163 - 2007
- [j88]Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu:
Estimating the distance to a monotone function. Random Struct. Algorithms 31(3): 371-383 (2007) - [c90]Bernard Chazelle:
Ushering in a New Era of Algorithm Design. ICALP 2007: 1 - 2006
- [j87]Nir Ailon, Bernard Chazelle:
Information theory in property testing and monotonicity testing in higher dimension. Inf. Comput. 204(11): 1704-1717 (2006) - [c89]Bernard Chazelle, C. Seshadhri:
Online geometric reconstruction. Symposium on Computational Geometry 2006: 386-394 - [c88]Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu:
Self-improving algorithms. SODA 2006: 261-270 - [c87]Nir Ailon, Bernard Chazelle:
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform. STOC 2006: 557-563 - 2005
- [j86]Carleton L. Kingsford, Bernard Chazelle, Mona Singh:
Solving and analyzing side-chain positioning problems using linear and integer programming. Bioinform. 21(7): 1028-1039 (2005) - [j85]Sanjeev Arora, Bernard Chazelle:
Is the thrill gone? Commun. ACM 48(8): 31-33 (2005) - [j84]Nir Ailon, Bernard Chazelle:
Lower bounds for linear degeneracy testing. J. ACM 52(2): 157-171 (2005) - [j83]Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan:
Approximating the Minimum Spanning Tree Weight in Sublinear Time. SIAM J. Comput. 34(6): 1370-1379 (2005) - [j82]Bernard Chazelle, Ding Liu, Avner Magen:
Sublinear Geometric Algorithms. SIAM J. Comput. 35(3): 627-646 (2005) - [c86]Bernard Chazelle:
Algorithmic Techniques and Tools from Computational Geometry. FOCS 2005: 7 - [c85]Elena 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 - [c84]Nir Ailon, Bernard Chazelle:
Information Theory in Property Testing and Monotonicity Testing in Higher Dimension. STACS 2005: 434-447 - [i2]Bernard Chazelle, Ding Liu, Avner Magen:
Sublinear Geometric Algorithms. Sublinear Algorithms 2005 - 2004
- [j81]Michael M. Kazhdan, Bernard Chazelle, David P. Dobkin, Thomas A. Funkhouser, Szymon Rusinkiewicz:
A Reflective Symmetry Descriptor for 3D Models. Algorithmica 38(1): 201-225 (2004) - [j80]Bernard Chazelle:
The Power of Nonmonotonicity in Geometric Searching. Discret. Comput. Geom. 31(1): 3-16 (2004) - [j79]Bernard Chazelle, Carl Kingsford, Mona Singh:
A Semidefinite Programming Approach to Side Chain Positioning with New Rounding Strategies. INFORMS J. Comput. 16(4): 380-392 (2004) - [j78]Bernard Chazelle, Ding Liu:
Lower bounds for intersection searching and fractional cascading in higher dimension. J. Comput. Syst. Sci. 68(2): 269-284 (2004) - [c83]Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu:
Estimating the Distance to a Monotone Function. APPROX-RANDOM 2004: 229-236 - [c82]Ding Liu, Bernard Chazelle, Avner Magen:
Approximate range searching in higher dimension. CCCG 2004: 154-157 - [c81]Nir Ailon, Bernard Chazelle, Seshadhri Comandur, Ding Liu:
Property-Preserving Data Reconstruction. ISAAC 2004: 16-27 - [c80]Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ayellet Tal:
The Bloomier filter: an efficient data structure for static support lookup tables. SODA 2004: 30-39 - [c79]Bernard Chazelle:
Who says you have to look at the input? The brave new world of sublinear computing. SODA 2004: 141 - [c78]Nir Ailon, Bernard Chazelle:
Lower bounds for linear degeneracy testing. STOC 2004: 554-560 - [r2]Bernard Chazelle:
The discrepancy method in computational geometry. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 983-996 - [r1]Bernard Chazelle:
Cuttings. Handbook of Data Structures and Applications 2004 - [i1]Nir Ailon, Bernard Chazelle:
Information Theory in Property Testing and Monotonicity Testing in Higher Dimension. Electron. Colloquium Comput. Complex.(068) (2004) - 2003
- [c77]Bernard Chazelle, Carl Kingsford, Mona Singh:
The Side-Chain Positioning Problem: A Semidefinite Programming Formulation With New Rounding Schemes. PCK50 2003: 86-94 - [c76]Bernard Chazelle:
Sublinear Computing. ESA 2003: 1 - [c75]Bernard Chazelle, Ding Liu, Avner Magen:
Sublinear geometric algorithms. STOC 2003: 531-540 - 2002
- [j77]Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristán, Monique Teillaud:
Splitting a Delaunay Triangulation in Linear Time. Algorithmica 34(1): 39-46 (2002) - [j76]Robert Osada, Thomas A. Funkhouser, Bernard Chazelle, David P. Dobkin:
Shape distributions. ACM Trans. Graph. 21(4): 807-832 (2002) - [c74]Bernard Chazelle:
The power of nonmonotonicity in geometric searching. Symposium on Computational Geometry 2002: 88-93 - [c73]Michael M. Kazhdan, Bernard Chazelle, David P. Dobkin, Adam Finkelstein, Thomas A. Funkhouser:
A Reflective Symmetry Descriptor. ECCV (2) 2002: 642-656 - 2001
- [b1]Bernard Chazelle:
The discrepancy method - randomness and complexity. Cambridge University Press 2001, ISBN 978-0-521-00357-5, pp. I-XVIII, 1-475 - [j75]Bernard Chazelle, Alexey Lvov:
The Discrepancy of Boxes in Higher Dimension. Discret. Comput. Geom. 25(4): 519-524 (2001) - [j74]Bernard Chazelle, Alexey Lvov:
A Trace Bound for the Hereditary Discrepancy. Discret. Comput. Geom. 26(2): 221-231 (2001) - [c72]Bernard Chazelle, Olivier Devillers, Ferran Hurtado, Mercè Mora, Vera Sacristán, Monique Teillaud:
Splitting a Delaunay Triangulation in Linear Time. ESA 2001: 312-320 - [c71]Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan:
Approximating the Minimum Spanning Tree Weight in Sublinear Time. ICALP 2001: 190-200 - [c70]Robert Osada, Thomas A. Funkhouser, Bernard Chazelle, David P. Dobkin:
Matching 3D Models with Shape Distributions. Shape Modeling International 2001: 154-166 - [c69]Bernard Chazelle, Ding Liu:
Lower bounds for intersection searching and fractional cascading in higher dimension. STOC 2001: 322-329 - 2000
- [j73]Sigal Ar, Bernard Chazelle, Ayellet Tal:
Self-customized BSP trees for collision detection. Comput. Geom. 15(1-3): 91-102 (2000) - [j72]Bernard Chazelle:
The soft heap: an approximate priority queue with optimal error rate. J. ACM 47(6): 1012-1027 (2000) - [j71]Bernard Chazelle:
A minimum spanning tree algorithm with Inverse-Ackermann type complexity. J. ACM 47(6): 1028-1047 (2000) - [c68]Bernard Chazelle, Alexey Lvov:
A trace bound for the hereditary discrepancy. Symposium on Computational Geometry 2000: 64-69 - [c67]Bernard Chazelle:
Irregularities of Distribution, Derandomization, and Complexity Theory. FSTTCS 2000: 46-54
1990 – 1999
- 1999
- [j70]Hervé Brönnimann, Bernard Chazelle, Jirí Matousek:
Product Range Spaces, Sensitive Sampling, and Derandomization. SIAM J. Comput. 28(5): 1552-1575 (1999) - [c66]Bernard Chazelle:
Geometric Searching over the Rationals. ESA 1999: 354-365 - [c65]Amit 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 - 1998
- [j69]Hervé Brönnimann, Bernard Chazelle:
Optimal slope selection via cuttings. Comput. Geom. 10(1): 23-29 (1998) - [j68]Bernard Chazelle:
A Spectral Approach to Lower Bounds with Applications to Geometric Searching. SIAM J. Comput. 27(2): 545-556 (1998) - [c64]Bernard Chazelle:
Car-Pooling as a Data Structuring Device: The Soft Heap. ESA 1998: 35-42 - [c63]Bernard Chazelle:
The Discrepancy Method. ISAAC 1998: 1-3 - 1997
- [j67]Bernard Chazelle, Leonidas Palios:
Decomposing the Boundary of a Nonconvex Polyhedron. Algorithmica 17(3): 245-265 (1997) - [j66]Bernard Chazelle, David P. Dobkin, Nadia Shouraboura, Ayellet Tal:
Strategies for Polyhedral Surface Decomposition: an Experimental Study. Comput. Geom. 7: 327-342 (1997) - [j65]Bernard Chazelle:
Lower Bounds for Off-Line Range Searching. Discret. Comput. Geom. 17(1): 53-65 (1997) - [c62]Bernard Chazelle:
A Faster Deterministic Algorithm for Minimum Spanning Trees. FOCS 1997: 22-31 - [c61]Bernard Chazelle:
Discrepancy Theory and Computational Geometry. WADS 1997: 1-2 - 1996
- [j64]Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Jorge Stolfi:
Lines in Space: Combinatorics and Algorithms. Algorithmica 15(5): 428-447 (1996) - [j63]Gill 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) - [j62]Bernard Chazelle, Jirí Matousek:
On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension. J. Algorithms 21(3): 579-597 (1996) - [c60]Fred S. Roberts, Bernard Chazelle, Stephen R. Mahaney:
Foreword. The Spin Verification System 1996: vii- - [c59]Bernard Chazelle:
The Computational Geometry Impact Task Force Report: An Executive Summary. WACG 1996: 59-65 - 1995
- [j61]Bernard Chazelle, Jirí Matousek:
Derandomizing an Output-sensitive Convex Hull Algorithm in Three Dimensions. Comput. Geom. 5: 27-32 (1995) - [j60]Bernard Chazelle, Burton Rosenberg:
Simplex Range Reporting on a Pointer Machine. Comput. Geom. 5: 237-247 (1995) - [j59]Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl:
Improved Bounds on Weak epsilon-Nets for Convex Sets. Discret. Comput. Geom. 13: 1-15 (1995) - [j58]Bernard Chazelle, Jirí Matousek, Micha Sharir:
An Elementary Approach to Lower Bounds in Geometric Discrepancy. Discret. Comput. Geom. 13: 363-381 (1995) - [j57]Bernard Chazelle, Nadia Shouraboura:
Bounds on the Size of Tetrahedralizations. Discret. Comput. Geom. 14(4): 429-444 (1995) - [c58]Bernard Chazelle, David P. Dobkin, Nadia Shouraboura, Ayellet Tal:
Strategies for Polyhedral Surface Decomposition: An Experimental Study. Symposium on Computational Geometry 1995: 297-305 - [c57]Bernard Chazelle, David P. Dobkin, Nadia Shouraboura, Ayellet Tal:
Convex Surface Decomposition. Symposium on Computational Geometry 1995: V9-V10 - [c56]Bernard Chazelle:
Lower bounds for off-line range searching. STOC 1995: 733-740 - 1994
- [j56]Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir:
Algorithms for Bichromatic Line-Segment Problems Polyhedral Terrains. Algorithmica 11(2): 116-132 (1994) - [j55]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) - [j54]Bernard Chazelle, Joel Friedman:
Point Location Among Hyperplanes and Unidirectional Ray-shooting. Comput. Geom. 4: 53-62 (1994) - [j53]Reuven Bar-Yehuda, Bernard Chazelle:
Triangulating disjoint Jordan chains. Int. J. Comput. Geom. Appl. 4(4): 475-481 (1994) - [j52]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) - [c55]Hervé Brönnimann, Bernard Chazelle:
Optimal Slope Selection Via Cuttings. CCCG 1994: 99-103 - [c54]Bernard Chazelle, Nadia Shouraboura:
Bounds on the Size of Tetrahedralizations. Symposium on Computational Geometry 1994: 231-239 - [c53]Bernard Chazelle:
A Spectral Approach to Lower Bounds. FOCS 1994: 674-682 - [c52]Bernard Chazelle:
Computational geometry: a retrospective. STOC 1994: 75-94 - 1993
- [j51]Bernard Chazelle:
Cutting Hyperplanes for Divide-and-Conquer. Discret. Comput. Geom. 9: 145-158 (1993) - [j50]Hervé Brönnimann, Bernard Chazelle, János Pach:
How Hard Is Half-Space Range Searching. Discret. Comput. Geom. 10: 143-155 (1993)