| Shape distributions R Osada, T Funkhouser, B Chazelle, D Dobkin ACM Transactions on Graphics (TOG) 21 (4), 807-832, 2002 | 2322 | 2002 |
| Triangulating a simple polygon in linear time B Chazelle Discrete & Computational Geometry 6 (3), 485-524, 1991 | 985 | 1991 |
| Matching 3D models with shape distributions R Osada, T Funkhouser, B Chazelle, D Dobkin Proceedings international conference on shape modeling and applications, 154-166, 2001 | 899 | 2001 |
| The discrepancy method: randomness and complexity B Chazelle Cambridge University Press, 2000 | 694 | 2000 |
| Fractional cascading B Chazelle, LJ Guibas Digital Systems Research Center, 1986 | 644 | 1986 |
| An optimal algorithm for intersecting line segments in the plane B Chazelle, H Edelsbrunner Journal of the ACM (JACM) 39 (1), 1-54, 1992 | 617 | 1992 |
| Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform N Ailon, B Chazelle Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006 | 562 | 2006 |
| Whole-proteome prediction of protein function via graph-theoretic analysis of interaction maps E Nabieva, K Jim, A Agarwal, B Chazelle, M Singh Bioinformatics 21 (suppl_1), i302-i310, 2005 | 560 | 2005 |
| The fast Johnson–Lindenstrauss transform and approximate nearest neighbors N Ailon, B Chazelle SIAM Journal on computing 39 (1), 302-322, 2009 | 526 | 2009 |
| The bloomier filter: an efficient data structure for static support lookup tables B Chazelle, J Kilian, R Rubinfeld, A Tal Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete …, 2004 | 510 | 2004 |
| An optimal convex hull algorithm in any fixed dimension B Chazelle Discrete & Computational Geometry 10 (4), 377-409, 1993 | 510 | 1993 |
| Filtering search: A new approach to query-answering B Chazelle SIAM Journal on Computing 15 (3), 703-724, 1986 | 491 | 1986 |
| A minimum spanning tree algorithm with inverse-Ackermann type complexity B Chazelle Journal of the ACM (JACM) 47 (6), 1028-1047, 2000 | 468 | 2000 |
| The power of geometric duality B Chazelle, LJ Guibas, DT Lee BIT Numerical Mathematics 25 (1), 76-90, 1985 | 450 | 1985 |
| Parallel computational geometry A Aggarwal, B Chazelle, L Guibas, C Ó'Dúnlaing, C Yap Algorithmica 3, 293-327, 1988 | 448 | 1988 |
| The bottomn-left bin-packing heuristic: An efficient implementation Chazelle IEEE Transactions on Computers 100 (8), 697-707, 1983 | 433 | 1983 |
| A functional approach to data structures and its use in multidimensional searching B Chazelle SIAM Journal on Computing 17 (3), 427-462, 1988 | 421 | 1988 |
| Visibility and intersectin problems in plane geometry B Chazelle, LJ Guibas Proceedings of the first annual symposium on Computational geometry, 135-146, 1985 | 384 | 1985 |
| A theorem on polygon cutting with applications B Chazelle 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982), 339-349, 1982 | 383 | 1982 |
| Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm B Chazelle SIAM Journal on Computing 13 (3), 488-507, 1984 | 354 | 1984 |
Sergey KitaevProfessor, Department of Mathematics and Statistics, University of StrathclydeVerified email at strath.ac.uk
