| 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.61 |
|
| 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.63 |
|
| 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.778 |
|
| 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.418 |
|
| 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.36 |
|
| 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.52 |
|
| 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.333 |
|
| 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 |
|
| Low-probability matches (unlikely to be authored by this person) |
| 1983 |
Chazelle B, Monier L. Unbounded hardware is equivalent to deterministic turing machines Theoretical Computer Science. 24: 123-130. DOI: 10.1016/0304-3975(83)90044-0 |
0.297 |
|
| 1983 |
Chazelle B. A decision procedure for optimal polyhedron partitioning Information Processing Letters. 16: 75-78. DOI: 10.1016/0020-0190(83)90028-5 |
0.293 |
|
| 2012 |
Chazelle B. Natural algorithms and influence systems Communications of the Acm. 55: 101-110. DOI: 10.1145/2380656.2380679 |
0.291 |
|
| 2008 |
Chazelle B. Finding a good neighbor, near and fast Communications of the Acm. 51: 115. DOI: 10.1145/1327452.1327493 |
0.291 |
|
| 1997 |
Chazelle B, Dobkin DP, Shouraboura N, Tal A. Strategies for polyhedral surface decomposition: An experimental study Computational Geometry: Theory and Applications. 7: 327-342. DOI: 10.1016/S0925-7721(96)00024-7 |
0.29 |
|
| 1997 |
Chazelle B. Faster deterministic algorithm for minimum spanning trees Annual Symposium On Foundations of Computer Science - Proceedings. 22-31. |
0.288 |
|
| 2006 |
Chazelle B. Mathematics: proof at a roll of the dice. Nature. 444: 1018-9. PMID 17183306 DOI: 10.1038/4441018A |
0.279 |
|
| 2005 |
Kingsford CL, Chazelle B, Singh M. Solving and analyzing side-chain positioning problems using linear and integer programming. Bioinformatics (Oxford, England). 21: 1028-36. PMID 15546935 DOI: 10.1093/Bioinformatics/Bti144 |
0.279 |
|
| 2004 |
Chazelle B, Kingsford C, Singh M. A semidefinite programming approach to side chain positioning with new rounding strategies Informs Journal On Computing. 16: 380-392. DOI: 10.1287/Ijoc.1040.0096 |
0.266 |
|
| 2000 |
Ar S, Chazelle B, Tal A. Self-customized BSP trees for collision detection Computational Geometry: Theory and Applications. 15: 91-102. DOI: 10.1016/S0925-7721(99)00049-8 |
0.265 |
|
| 2017 |
Wang C, Li Q, E W, Chazelle B. Noisy Hegselmann-Krause Systems: Phase Transition and the 2R-Conjecture Journal of Statistical Physics. 166: 1209-1225. DOI: 10.1007/S10955-017-1718-X |
0.259 |
|
| 1984 |
Chazelle B. Computational Geometry on a Systolic Chip Ieee Transactions On Computers. 774-785. DOI: 10.1109/TC.1984.1676494 |
0.253 |
|
| 2005 |
Nabieva E, Jim K, Agarwal A, Chazelle B, Singh M. Whole-proteome prediction of protein function via graph-theoretic analysis of interaction maps. Bioinformatics (Oxford, England). 21: i302-10. PMID 15961472 DOI: 10.1093/Bioinformatics/Bti1054 |
0.248 |
|
| 1980 |
Chazelle B, Dobkin DP. Detection is easier than computation Proceedings of the Annual Acm Symposium On Theory of Computing. 1980: 146-153. DOI: 10.1145/800141.804662 |
0.248 |
|
| 2007 |
Chazelle B. Ushering in a new era of algorithm design Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4596: 1. |
0.246 |
|
| 2005 |
Arora S, Chazelle B. Is the thrill gone? Communications of the Acm. 48: 31-33. DOI: 10.1145/1076211.1076233 |
0.245 |
|
| 2008 |
Banks E, Nabieva E, Chazelle B, Singh M. Organization of physical interactomes as uncovered by network schemas. Plos Computational Biology. 4: e1000203. PMID 18949022 DOI: 10.1371/Journal.Pcbi.1000203 |
0.244 |
|
| 2017 |
Chazelle B, Wang C. Inertial Hegselmann-Krause Systems Ieee Transactions On Automatic Control. 62: 3905-3913. DOI: 10.1109/Tac.2016.2644266 |
0.242 |
|
| 1992 |
Chazelle B, Edelsbrunner H, Guibas LJ, Pollack R, Seidel R, Sharir M, Snoeyink J. Counting and cutting cycles of lines and rods in space Computational Geometry: Theory and Applications. 1: 305-323. DOI: 10.1016/0925-7721(92)90009-H |
0.241 |
|
| 2011 |
Chazelle B. The total s-energy of a multiagent system Siam Journal On Control and Optimization. 49: 1680-1706. DOI: 10.1137/100791671 |
0.24 |
|
| 2007 |
Chazelle B. Computing: the security of knowing nothing. Nature. 446: 992-3. PMID 17460653 DOI: 10.1038/446992A |
0.227 |
|
| 2007 |
Chazelle B. Computer science. Coding and computing join forces. Science (New York, N.Y.). 317: 1691-2. PMID 17885118 DOI: 10.1126/Science.1148064 |
0.227 |
|
| 2020 |
Hristov BH, Chazelle B, Singh M. uKIN Combines New and Prior Information with Guided Network Propagation to Accurately Identify Disease Genes. Cell Systems. 10: 470-479.e3. PMID 32684276 DOI: 10.1016/J.Cels.2020.05.008 |
0.224 |
|
| 2007 |
Chazelle B. Erratum: Computing: The security of knowing nothing (Nature (2007) 446, (992-993)) Nature. 447. DOI: 10.1038/447051A |
0.222 |
|
| 2015 |
Chazelle B. Diffusive influence systems Siam Journal On Computing. 44: 1403-1442. DOI: 10.1137/120882640 |
0.219 |
|
| 2020 |
Kobren SN, Chazelle B, Singh M. PertInInt: An Integrative, Analytical Approach to Rapidly Uncover Cancer Driver Genes with Perturbed Interactions and Functionalities. Cell Systems. 11: 63-74.e7. PMID 32711844 DOI: 10.1016/J.Cels.2020.06.005 |
0.217 |
|
| 2000 |
Chazelle B, Lvov A. Trace bound for the hereditary discrepancy Proceedings of the Annual Symposium On Computational Geometry. 64-69. |
0.215 |
|
| 2006 |
Chazelle B. Could Your iPod Be Holding the Greatest Mystery in Modern Science Math Horizons. 13: 14-31. DOI: 10.1080/10724117.2006.11974645 |
0.214 |
|
| 2001 |
Osada R, Funkhouser T, Chazelle B, Dobkin D. Matching 3D models with shape distributions Proceedings - International Conference On Shape Modeling and Applications, Smi 2001. 154-166. DOI: 10.1109/SMA.2001.923386 |
0.214 |
|
| 2017 |
Chazelle B, Jiu Q, Li Q, Wang C. Well-posedness of the limiting equation of a noisy consensus model in opinion dynamics Journal of Differential Equations. 263: 365-397. DOI: 10.1016/J.Jde.2017.02.036 |
0.212 |
|
| 2005 |
Azar Y, Buchsbaum A, Chazelle B, Cole R, Fleischer L, Golin M, Goodrich M, Grossi R, Guha S, Halldorsson MM, Indyk P, Italiano GF, Kaplan H, Myrvold W, Pruhs K, et al. Proceeding of the Annual ACM-SIAM Symposium on Discrete Algorithms: Preface Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. xiii. |
0.203 |
|
| 2020 |
Chazelle B. On the Periodicity of Random Walks in Dynamic Networks Ieee Transactions On Network Science and Engineering. 7: 1337-1343. DOI: 10.1109/Tnse.2019.2924921 |
0.198 |
|
| 2010 |
Chazelle B. The geometry of flocking Proceedings of the Annual Symposium On Computational Geometry. 19-28. DOI: 10.1145/1810959.1810963 |
0.189 |
|
| 1996 |
Chazelle B, Edelsbrunner H, Guibas LJ, Sharir M, Stolfi J. Lines in space: Combinatorics and algorithms Algorithmica. 15: 428-447. DOI: 10.1007/BF01955043 |
0.189 |
|
| 2003 |
Chazelle B. The PCP theorem [after Arora, Lund, Motwani, Safra, Sudan, Szegedy] Asterisque. 19-36. |
0.168 |
|
| 2004 |
Chazelle B, Kilian J, Rubinfeld R, Tal A. The Bloomier Filter: An Efficient Data Structure for Static Support Lookup Tables Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 15: 30-39. |
0.167 |
|
| 1983 |
Chazelle B, Incerpi J. TRIANGULATING A POLYGON BY DIVIDE-AND-CONQUER Proceedings - Annual Allerton Conference On Communication, Control, and Computing. 447-456. |
0.158 |
|
| 2015 |
Chazelle B. Communication and dynamic networks Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9214: 641. |
0.146 |
|
| 1997 |
Chazelle B. Discrepancy theory and computational geometry Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1272: 1-2. |
0.143 |
|
| 1994 |
Chazelle B. Computational geometry: A retrospective Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 75-94. |
0.14 |
|
| 2003 |
Chazelle B, Kingsford C, Singh M. The Side-Chain Positioning Problem: A Semidefinite Programming Formulation with New Rounding Schemes Principles of Computing and Knowledge: Paris C. Kanellakis Memorial Workshop. 86-94. |
0.135 |
|
| 2015 |
Chazelle B. Communication, dynamics, and renormalization Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9079: 1-32. DOI: 10.1007/978-3-319-18173-8_1 |
0.134 |
|
| 1996 |
Chazelle B. The computational geometry impact task force report: An executive summary Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1148: 59-65. |
0.131 |
|
| 1996 |
Barequet G, Chazelle B, Guibas LJ, Mitchell JS, Tal A. BOXTREE: A Hierarchical Representation for Surfaces in 3D Computer Graphics Forum. 15: 387-396. DOI: 10.1111/1467-8659.1530387 |
0.129 |
|
| 2010 |
Chazelle B. A geometric approach to collective motion Proceedings of the Annual Symposium On Computational Geometry. 117-126. DOI: 10.1145/1810959.1810983 |
0.102 |
|
| 2023 |
Dabke DV, Karntikoon K, Aluru C, Singh M, Chazelle B. Network-augmented compartmental models to track asymptomatic disease spread. Bioinformatics Advances. 3: vbad082. PMID 37476534 DOI: 10.1093/bioadv/vbad082 |
0.093 |
|
| 2003 |
Chazelle B. Sublinear Computing Lecture Notes in Computer Science. 1. |
0.091 |
|
| 2009 |
Chazelle B, Mulzer W. Markov incremental constructions Discrete and Computational Geometry. 42: 399-420. DOI: 10.1007/s00454-009-9170-6 |
0.086 |
|
| 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.086 |
|
| 2012 |
Chazelle B. The dynamics of influence systems Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 311-320. DOI: 10.1109/FOCS.2012.70 |
0.073 |
|
| 2014 |
Chazelle B, Dehotin J, Lambert L. An innovative runoff hazard mapping for risk diagnosis and management on railway infrastructure Civil-Comp Proceedings. 104. |
0.061 |
|
| 1998 |
Chazelle B. Car-pooling as a data structuring device: The soft heap Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1461: 35-42. |
0.043 |
|
| 1987 |
Chazelle B. Editor's foreword Algorithmica. 2: 135-136. DOI: 10.1007/BF01840355 |
0.029 |
|
| 2009 |
Banks E, Nabieva E, Chazelle B, Peterson R, Singh M. Analyzing and interrogating biological networks (abstract) Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5462: 14-15. DOI: 10.1007/978-3-642-00727-9_2 |
0.017 |
|
| 2015 |
Dehotin J, Chazelle B, Laverne G, Hasnaoui A, Lambert L, Breil P, Braud I. Applying runoff mapping method IRIP for flooding risk analysis on railway infrastructure | Mise en œuvre de la méthode de cartographie du ruissellement IRIP pour l'analyse des risques lies aux écoulements sur l'infrastructure ferroviaire Houille Blanche. 56-64. DOI: 10.1051/lhb/20150069 |
0.014 |
|
| 2014 |
Chazelle B, Lambert L, Pams Capoccioni C. Railway vulnerability in case of extremes floods. Knowledge and risk management | La vulnérabilité des infrastructures ferroviaires face aux évènements hydrologiques extrêmes. État des connaissances et gestion du risque Houille Blanche. 48-54. DOI: 10.1051/lhb/2014016 |
0.012 |
|
| 1998 |
Chazelle B. The discrepancy method Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1533: 1-3. |
0.01 |
|
| Hide low-probability matches. |