| Year |
Citation |
Score |
| 2019 |
Chazelle B. A Sharp Bound on the $s$-Energy and Its Applications to Averaging Systems Ieee Transactions On Automatic Control. 64: 4385-4390. DOI: 10.1109/Tac.2019.2899509 |
0.325 |
|
| 2017 |
Chazelle B. The challenges of natural algorithms Acm Sigevolution. 9: 11-11. DOI: 10.1145/3066157.3066163 |
0.316 |
|
| 2015 |
Chazelle B. Algorithmic renormalization for network dynamics Ieee Transactions On Network Science and Engineering. 2: 1-16. DOI: 10.1109/Tnse.2015.2419133 |
0.306 |
|
| 2015 |
Chazelle B, Mulzer W. Data Structures on Event Graphs Algorithmica. 71: 1007-1020. DOI: 10.1007/S00453-013-9838-4 |
0.7 |
|
| 2014 |
Chazelle B. Theory of Computing. 10: 421-451. DOI: 10.4086/Toc.2014.V010A016 |
0.376 |
|
| 2014 |
Chazelle B. The convergence of bird flocking Journal of the Acm. 61. DOI: 10.1145/2629613 |
0.373 |
|
| 2014 |
Chazelle B. An Algorithmic Approach to Collective Behavior Journal of Statistical Physics. 158: 514-548. DOI: 10.1007/S10955-014-1140-6 |
0.326 |
|
| 2013 |
Bhattacharyya A, Braverman M, Chazelle B, Nguyen HL. On the convergence of the Hegselmann-Krause system Itcs 2013 - Proceedings of the 2013 Acm Conference On Innovations in Theoretical Computer Science. 61-65. DOI: 10.1145/2422436.2422446 |
0.378 |
|
| 2011 |
Chazelle B, Seshadhri C. Online geometric reconstruction Journal of the Acm. 58. DOI: 10.1145/1989727.1989728 |
0.405 |
|
| 2011 |
Ailon N, Chazelle B, Clarkson KL, Liu D, Mulzer W, Seshadhri C. Self-improving algorithms Siam Journal On Computing. 40: 350-375. DOI: 10.1137/090766437 |
0.773 |
|
| 2011 |
Chazelle B, Mulzer W. Computing Hereditary Convex Structures Discrete and Computational Geometry. 45: 796-823. DOI: 10.1007/s00454-011-9346-8 |
0.35 |
|
| 2010 |
Ailon N, Chazelle B. Faster dimension reduction Communications of the Acm. 53: 97-104. DOI: 10.1145/1646353.1646379 |
0.686 |
|
| 2009 |
Ailon N, Chazelle B. The fast johnson-lindenstrauss transform and approximate nearest neighbors Siam Journal On Computing. 39: 302-322. DOI: 10.1137/060673096 |
0.712 |
|
| 2008 |
Chazelle B, Liu D, Magen A. Approximate range searching in higher dimension Computational Geometry: Theory and Applications. 39: 24-29. DOI: 10.1016/J.Comgeo.2007.05.008 |
0.607 |
|
| 2008 |
Ailon N, Chazelle B, Comandur S, Liu D. Property-preserving data reconstruction Algorithmica (New York). 51: 160-182. DOI: 10.1007/S00453-007-9075-9 |
0.721 |
|
| 2007 |
Ailon N, Chazelle B, Comandur S, Liu D. Estimating the distance to a monotone function Random Structures and Algorithms. 31: 371-383. DOI: 10.1002/Rsa.V31:3 |
0.733 |
|
| 2006 |
Ailon N, Chazelle B. Information theory in property testing and monotonicity testing in higher dimension Information and Computation. 204: 1704-1717. DOI: 10.1016/J.Ic.2006.06.001 |
0.694 |
|
| 2006 |
Ailon N, Chazelle B. Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform Proceedings of the Annual Acm Symposium On Theory of Computing. 2006: 557-563. |
0.618 |
|
| 2005 |
Ailon N, Chazelle B. Lower bounds for linear degeneracy testing Journal of the Acm. 52: 157-171. DOI: 10.1145/1059513.1059515 |
0.697 |
|
| 2005 |
Chazelle B, Liu D, Magen A. Sublinear geometric algorithms Siam Journal On Computing. 35: 627-646. DOI: 10.1137/S009753970444572X |
0.365 |
|
| 2005 |
Chazelle B, Rubinfeld R, Trevisan L. Approximating the minimum spanning tree weight in sublinear time Siam Journal On Computing. 34: 1370-1379. DOI: 10.1137/S0097539702403244 |
0.439 |
|
| 2004 |
Chazelle B, Liu D. Lower bounds for intersection searching and fractional cascading in higher dimension Journal of Computer and System Sciences. 68: 269-284. DOI: 10.1016/J.Jcss.2003.07.003 |
0.628 |
|
| 2004 |
Chazelle B. The Power of Nonmonotonicity in Geometric Searching Discrete and Computational Geometry. 31: 3-16. DOI: 10.1007/S00454-003-2946-1 |
0.453 |
|
| 2003 |
Kazhdan M, Chazelle B, Dobkin D, Funkhouser T, Rusinkiewicz S. A reflective symmetry descriptor for 3D models Algorithmica (New York). 38: 201-225. DOI: 10.1007/S00453-003-1050-5 |
0.522 |
|
| 2003 |
Chazelle B, Liu D, Magen A. Sublinear geometrie algorithms Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 531-540. |
0.362 |
|
| 2002 |
Osada R, Funkhouser T, Chazelle B, Dobkin D. Shape distributions Acm Transactions On Graphics. 21: 807-832. DOI: 10.1145/571647.571648 |
0.337 |
|
| 2002 |
Chazelle B, Devillers O, Hurtado F, Mora M, Sacristán V, Teillaud M. Splitting a delaunay triangulation in linear time Algorithmica (New York). 34: 39-46. DOI: 10.1007/S00453-002-0939-8 |
0.511 |
|
| 2001 |
Chazelle B, Lvov A. A trace bound for the hereditary discrepancy Discrete and Computational Geometry. 26: 221-231. DOI: 10.1007/S00454-001-0030-2 |
0.764 |
|
| 2001 |
Chazelle B, Lvov A. The discrepancy of boxes in higher dimension Discrete and Computational Geometry. 25: 519-524. DOI: 10.1007/S00454-001-0014-2 |
0.777 |
|
| 2000 |
Chazelle B. A minimum spanning tree algorithm with inverse-ackermann type complexity Journal of the Acm. 47: 1028-1047. DOI: 10.1145/355541.355562 |
0.451 |
|
| 2000 |
Chazelle B. The soft heap: An approximate priority queue with optimal error rate Journal of the Acm. 47: 1012-1027. DOI: 10.1145/355541.355554 |
0.356 |
|
| 2000 |
Chazelle B. Irregularities of distribution, derandomization, and complexity theory Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1974: 46-54. |
0.332 |
|
| 1999 |
Brönnimann H, Chazelle B, Matoušek J. Product range spaces, sensitive sampling, and derandomization Siam Journal On Computing. 28: 1552-1575. DOI: 10.1137/S0097539796260321 |
0.532 |
|
| 1999 |
Chazelle B. Geometric searching over the rationals Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1643: 354-365. DOI: 10.1007/3-540-48481-7_31 |
0.311 |
|
| 1999 |
Chakrabarti A, Chazelle B, Gum B, Lvov A. Lower bound on the complexity of approximate nearest-neighbor searching on the hamming cube Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 305-311. |
0.312 |
|
| 1998 |
Chazelle B. A spectral approach to lower bounds with applications to geometric searching Siam Journal On Computing. 27: 545-556. DOI: 10.1137/S0097539794275665 |
0.451 |
|
| 1998 |
Brönnimann H, Chazelle B. Optimal slope selection via cuttings Computational Geometry: Theory and Applications. 10: 23-29. DOI: 10.1016/S0925-7721(97)00025-4 |
0.46 |
|
| 1997 |
Chazelle B. Lower bounds for off-line range searching Discrete and Computational Geometry. 17: 53-65. DOI: 10.1007/Bf02770864 |
0.53 |
|
| 1997 |
Chazelle B, Palios L. Decomposing the Boundary of a Nonconvex Polyhedron Algorithmica (New York). 17: 245-265. DOI: 10.1007/Bf02523191 |
0.403 |
|
| 1996 |
Barequet G, Chazelle B, Guibas LJ, Mitchell JSB, Tal A. BOXTREE: A hierarchical representation for surfaces in 3D Computer Graphics Forum. 15: C387-C396. DOI: 10.1111/1467-8659.1530387 |
0.32 |
|
| 1996 |
Chazelle B, Rosenberg B. Simplex range reporting on a pointer machine Computational Geometry: Theory and Applications. 5: 237-247. DOI: 10.1016/0925-7721(95)00002-X |
0.432 |
|
| 1996 |
Chazelle B, Edelsbrunner H, Guibas LJ, Sharir M, Stolfi J. Lines in Space: Combinatorics and Algorithms Algorithmica (New York). 15: 428-447. DOI: 10.1007/Bf01955043 |
0.414 |
|
| 1996 |
Chazelle B, Matoušek J. On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension Journal of Algorithms. 21: 579-597. DOI: 10.1006/Jagm.1996.0060 |
0.475 |
|
| 1995 |
Chazelle B, Matoušek J. Derandomizing an output-sensitive convex hull algorithm in three dimensions Computational Geometry: Theory and Applications. 5: 27-32. DOI: 10.1016/0925-7721(94)00018-Q |
0.489 |
|
| 1995 |
Chazelle B, Matoušek J, Sharir M. An elementary approach to lower bounds in geometric discrepancy Discrete & Computational Geometry. 13: 363-381. DOI: 10.1007/Bf02574050 |
0.363 |
|
| 1995 |
Chazelle B, Edelsbrunner H, Grigni M, Guibas L, Sharir M, Welzl E. Improved bounds on weak ε-nets for convex sets Discrete & Computational Geometry. 13: 1-15. DOI: 10.1007/Bf02574025 |
0.437 |
|
| 1995 |
Chazelle B, Shourboura N. Bounds on the size of tetrahedralizations Discrete & Computational Geometry. 14: 429-444. DOI: 10.1007/Bf02570716 |
0.324 |
|
| 1994 |
BAR-YEHUDA R, CHAZELLE B. TRIANGULATING DISJOINT JORDAN CHAINS International Journal of Computational Geometry & Applications. 4: 475-481. DOI: 10.1142/S0218195994000252 |
0.471 |
|
| 1994 |
Chazelle B, Edelsbrunner H, Guibas LJ, Hershberger JE, Seidel R, Sharir M. Selecting heavily covered points Siam Journal On Computing. 23: 1138-1151. DOI: 10.1137/S0097539790179919 |
0.427 |
|
| 1994 |
Chazelle B, Friedman J. Point location among hyperplanes and unidirectional ray-shooting Computational Geometry: Theory and Applications. 4: 53-62. DOI: 10.1016/0925-7721(94)90009-4 |
0.405 |
|
| 1994 |
Chazelle B, Edelsbrunner H, Grigni M, Guibas L, Hershberger J, Sharir M, Snoeyink J. Ray shooting in polygons using geodesic triangulations Algorithmica. 12: 54-68. DOI: 10.1007/Bf01377183 |
0.443 |
|
| 1994 |
Chazelle B, Edelsbrunner H, Guibas LJ, Sharir M. Algorithms for bichromatic line-segment problems and polyhedral terrains Algorithmica. 11: 116-132. DOI: 10.1007/Bf01182771 |
0.361 |
|
| 1993 |
Chazelle B, Edelsbrunner H, Guibas L, Sharir M, Snoeyink J. Computing a Face in an Arrangement of Line Segments and Related Problems Siam Journal On Computing. 22: 1286-1302. DOI: 10.1137/0222077 |
0.464 |
|
| 1993 |
Chazelle B. An optimal convex hull algorithm in any fixed dimension Discrete & Computational Geometry. 10: 377-409. DOI: 10.1007/Bf02573985 |
0.554 |
|
| 1993 |
Chazelle B, Edelsbrunner H, Guibas L, Sharir M. Diameter, width, closest line pair, and parametric searching Discrete & Computational Geometry. 10: 183-196. DOI: 10.1007/Bf02573973 |
0.528 |
|
| 1993 |
Brönnimann H, Chazelle B, Pach J. How hard is half-space range searching? Discrete & Computational Geometry. 10: 143-155. DOI: 10.1007/Bf02573971 |
0.52 |
|
| 1993 |
Chazelle B. Cutting hyperplanes for divide-and-conquer Discrete & Computational Geometry. 9: 145-158. DOI: 10.1007/Bf02189314 |
0.477 |
|
| 1992 |
Chazelle B, Edelsbrunner H. An optimal algorithm for intersecting line segments in the plane Journal of the Acm. 39: 1-54. DOI: 10.1145/147508.147511 |
0.472 |
|
| 1992 |
Chazelle B. An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra Siam Journal On Computing. 21: 671-696. DOI: 10.1137/0221041 |
0.395 |
|
| 1992 |
Chazelle B, Sharir M, Welzl E. Quasi-optimal upper bounds for simplex range searching and new zone theorems Algorithmica. 8: 407-429. DOI: 10.1007/Bf01758854 |
0.458 |
|
| 1991 |
CHAZELLE B, ROSENBERG B. THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINE International Journal of Computational Geometry & Applications. 1: 33-45. DOI: 10.1142/S0218195991000049 |
0.456 |
|
| 1991 |
Chazelle B, Edelsbrunner H, Guibas LJ, Sharir M. A singly exponential stratification scheme for real semi-algebraic varieties and its applications Theoretical Computer Science. 84: 77-105. DOI: 10.1016/0304-3975(91)90261-Y |
0.322 |
|
| 1991 |
Chazelle B. Triangulating a simple polygon in linear time Discrete & Computational Geometry. 6: 485-524. DOI: 10.1007/Bf02574703 |
0.393 |
|
| 1991 |
Aronov B, Chazelle B, Edelsbrunner H, Guibas LJ, Sharir M, Wenger R. Points and triangles in the plane and halving planes in space Discrete & Computational Geometry. 6: 435-442. DOI: 10.1007/Bf02574700 |
0.459 |
|
| 1990 |
Chazelle B. Lower bounds for orthogonal range searching: part II. The arithmetic model Journal of the Acm. 37: 439-463. DOI: 10.1145/79147.79149 |
0.55 |
|
| 1990 |
Chazelle B. Lower bounds for orthogonal range searching: I. The reporting case Journal of the Acm (Jacm). 37: 200-212. DOI: 10.1145/77600.77614 |
0.496 |
|
| 1990 |
Chazelle B, Sharir M. An algorithm for generalized point location and its applications Journal of Symbolic Computation. 10: 281-309. DOI: 10.1016/S0747-7171(08)80065-X |
0.417 |
|
| 1990 |
Chazelle B, Palios L. Triangulating a nonconvex polytope Discrete & Computational Geometry. 5: 505-526. DOI: 10.1007/BF02187807 |
0.368 |
|
| 1990 |
Chazelle B, Friedman J. A deterministic view of random sampling and its use in geometry Combinatorica. 10: 229-249. DOI: 10.1007/Bf02122778 |
0.511 |
|
| 1989 |
Chazelle B. Lower bounds on the complexity of polytope range searching Journal of the American Mathematical Society. 2: 637-637. DOI: 10.1090/S0894-0347-1989-1001852-0 |
0.477 |
|
| 1989 |
Chazelle B, Guibas LJ. Visibility and intersection problems in plane geometry Discrete & Computational Geometry. 4: 551-581. DOI: 10.1007/Bf02187747 |
0.544 |
|
| 1989 |
Chazelle B, Welzl E. Quasi-optimal range searching in spaces of finite VC-dimension Discrete & Computational Geometry. 4: 467-489. DOI: 10.1007/BF02187743 |
0.481 |
|
| 1989 |
Chazelle B, Edelsbrunner H, Guibas LJ. The complexity of cutting complexes Discrete & Computational Geometry. 4: 139-181. DOI: 10.1007/Bf02187720 |
0.376 |
|
| 1988 |
Chazelle B. A Functional Approach to Data Structures and Its Use in Multidimensional Searching Siam Journal On Computing. 17: 427-462. DOI: 10.1137/0217026 |
0.376 |
|
| 1988 |
Aggarwal A, Chazelle B, Guibas L, Ó'Dúnlaing C, Yap C. Parallel computational geometry Algorithmica. 3: 293-327. DOI: 10.1007/Bf01762120 |
0.382 |
|
| 1988 |
Chazelle B. An algorithm for segment-dragging and its implementation Algorithmica. 3: 205-221. DOI: 10.1007/Bf01762115 |
0.499 |
|
| 1987 |
Chazelle B, Dobkin DP. Intersection of convex objects in two and three dimensions Journal of the Acm (Jacm). 34: 1-27. DOI: 10.1145/7531.24036 |
0.359 |
|
| 1987 |
Chazelle B, Edelsbrunner H. An Improved Algorithm for Constructing kth-Order Voronoi Diagrams Ieee Transactions On Computers. 36: 1349-1354. DOI: 10.1109/Tc.1987.5009474 |
0.473 |
|
| 1987 |
Chazelle B, Edelsbrunner H. Linear space data structures for two types of range search Discrete & Computational Geometry. 2: 113-126. DOI: 10.1007/Bf02187875 |
0.436 |
|
| 1987 |
Chazelle B. Computing on a free tree via complexity-preserving mappings Algorithmica. 2: 337-361. DOI: 10.1007/Bf01840366 |
0.362 |
|
| 1987 |
Chazelle B. Some techniques for geometric searching with implicit set representations Acta Informatica. 24: 565-582. DOI: 10.1007/Bf00263295 |
0.35 |
|
| 1986 |
Chazelle B. Filtering search: a new approach to query answering Siam Journal On Computing. 15: 703-724. DOI: 10.1137/0215051 |
0.384 |
|
| 1986 |
Chazelle B, Drysdale RL, Lee DT. COMPUTING THE LARGEST EMPTY RECTANGLE Siam Journal On Computing. 15: 300-315. DOI: 10.1137/0215022 |
0.55 |
|
| 1986 |
Chazelle B, Cole R, Preparata FP, Yap C. New upper bounds for neighbor searching Information and Control. 68: 105-124. DOI: 10.1016/S0019-9958(86)80030-4 |
0.505 |
|
| 1986 |
Chazelle B. Reporting and counting segment intersections Journal of Computer and System Sciences. 32: 156-182. DOI: 10.1016/0022-0000(86)90025-5 |
0.519 |
|
| 1986 |
Chazelle BM, Lee DT. On a circle placement problem Computing. 36: 1-16. DOI: 10.1007/BF02238188 |
0.415 |
|
| 1986 |
Chazelle B, Preparata FP. Halfspace range search: An algorithmic application of k-sets Discrete & Computational Geometry. 1: 83-93. DOI: 10.1007/Bf02187685 |
0.483 |
|
| 1986 |
Chazelle B, Guibas LJ. Fractional cascading: II. Applications Algorithmica. 1: 163-191. DOI: 10.1007/Bf01840441 |
0.33 |
|
| 1986 |
Chazelle B, Guibas LJ. Fractional cascading: I. A data structuring technique Algorithmica. 1: 133-162. DOI: 10.1007/Bf01840440 |
0.366 |
|
| 1985 |
Chazelle B, Monier L. A model of computation for VLSI with related complexity results Journal of the Acm (Jacm). 32: 573-588. DOI: 10.1145/3828.3834 |
0.334 |
|
| 1985 |
Chazelle B. On the Convex Layers of a Planar Set Ieee Transactions On Information Theory. 31: 509-517. DOI: 10.1109/Tit.1985.1057060 |
0.45 |
|
| 1985 |
Chazelle B, Edelsbrunner H. OPTIMAL SOLUTIONS FOR A CLASS OF POINT RETRIEVAL PROBLEMS Journal of Symbolic Computation. 1: 47-56. DOI: 10.1016/S0747-7171(85)80028-6 |
0.46 |
|
| 1985 |
Chazelle B. How to search in history Information and Control. 64: 77-99. DOI: 10.1016/S0019-9958(85)80045-0 |
0.548 |
|
| 1985 |
Chazelle B, Dobkin DP. Optimal Convex Decompositions Machine Intelligence and Pattern Recognition. 2: 63-133. DOI: 10.1016/B978-0-444-87806-9.50009-8 |
0.391 |
|
| 1985 |
Chazelle B, Guibas LJ, Lee DT. The power of geometric duality Bit. 25: 76-90. DOI: 10.1007/Bf01934990 |
0.555 |
|
| 1984 |
Chazelle B, Incerpi J. Triangulation and shapecomplexity Acm Transactions On Graphics. 3: 135-152. DOI: 10.1145/357337.357340 |
0.519 |
|
| 1984 |
Chazelle B. Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm Siam Journal On Computing. 13: 488-507. DOI: 10.1137/0213031 |
0.394 |
|
| 1983 |
Chazelle B. The Bottom-Left Bin-Packing Heuristic: An Efficient Implementation Ieee Transactions On Computers. 697-707. DOI: 10.1109/TC.1983.1676307 |
0.332 |
|
| 1983 |
Chazelle B. An improved algorithm for the fixed-radius neighbor problem Information Processing Letters. 16: 193-198. DOI: 10.1016/0020-0190(83)90123-0 |
0.463 |
|
| Show low-probability matches. |