| Riemann's hypothesis and tests for primality GL Miller Journal of computer and system sciences 13 (3), 300-317, 1976 | 1050 | 1976 |
| Optimal route selection in a content delivery network CF Bornstein, TK Canfield, GL Miller, SB Rao, R Sundaram US Patent 7,274,658, 2007 | 667* | 2007 |
| Parallel Tree Contraction and Its Application. GL Miller, JH Reif HARVARD UNIV CAMBRIDGE MA AIKEN COMPUTATION LAB, 1985 | 509 | 1985 |
| The complexity of coloring circular arcs and chords MR Garey, DS Johnson, GL Miller, CH Papadimitriou SIAM Journal on Algebraic Discrete Methods 1 (2), 216-227, 1980 | 488 | 1980 |
| Doulion: counting triangles in massive graphs with a coin CE Tsourakakis, U Kang, GL Miller, C Faloutsos Proceedings of the 15th ACM SIGKDD international conference on Knowledge …, 2009 | 348 | 2009 |
| Finding small simple cycle separators for 2-connected planar graphs GL Miller Journal of Computer and system Sciences 32 (3), 265-279, 1986 | 324 | 1986 |
| Approaching optimality for solving SDD linear systems I Koutis, GL Miller, R Peng SIAM Journal on Computing 43 (1), 337-354, 2014 | 277 | 2014 |
| Coordinating pebble motion on graphs, the diameter of permutation groups, and applications DM Kornhauser, G Miller, P Spirakis M. I. T., Dept. of Electrical Engineering and Computer Science, 1984 | 271 | 1984 |
| Separators for sphere-packings and nearest neighbor graphs GL Miller, SH Teng, W Thurston, SA Vavasis Journal of the ACM (JACM) 44 (1), 1-29, 1997 | 269 | 1997 |
| Geometric mesh partitioning: Implementation and experiments JR Gilbert, GL Miller, SH Teng SIAM Journal on Scientific Computing 19 (6), 2091-2110, 1998 | 265 | 1998 |
| Unified geometric approach to graph separators SH Teng, S Points Proc. 31st Ann. Symp. Foundations of Computer Science, 538-547, 1991 | 262 | 1991 |
| Riemann's hypothesis and tests for primality GL Miller Proceedings of the seventh annual ACM symposium on Theory of computing, 234-239, 1975 | 245 | 1975 |
| A nearly-m log n time solver for sdd linear systems I Koutis, GL Miller, R Peng 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 590-598, 2011 | 236 | 2011 |
| Automatic mesh partitioning GL Miller, SH Teng, W Thurston, SA Vavasis Graph Theory and Sparse Matrix Computation, 57-84, 1993 | 219 | 1993 |
| On taking roots in finite fields L Adleman, K Manders, G Miller 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), 175-178, 1977 | 208 | 1977 |
| On the quality of spectral separators S Guattery, GL Miller SIAM Journal on Matrix Analysis and Applications 19 (3), 701-719, 1998 | 199 | 1998 |
| Regular groups of automorphisms of cubic graphs DŽ Djoković, GL Miller Journal of Combinatorial Theory, Series B 29 (2), 195-230, 1980 | 184 | 1980 |
| Isomorphism testing for graphs of bounded genus G Miller Proceedings of the twelfth annual ACM symposium on Theory of computing, 225-235, 1980 | 183 | 1980 |
| A Delaunay based numerical method for three dimensions: generation, formulation, and partition GL Miller, D Talmor, SH Teng, N Walkington Proceedings of the twenty-seventh annual ACM symposium on Theory of …, 1995 | 181 | 1995 |
| Deterministic parallel list ranking RJ Anderson, GL Miller Aegean Workshop on Computing, 81-90, 1988 | 174 | 1988 |
