| Finding effective compilation sequences L Almagor, KD Cooper, A Grosul, TJ Harvey, SW Reeves, D Subramanian, ... ACM SIGPLAN Notices 39 (7), 231-239, 2004 | 259 | 2004 |
| Practical improvements to the construction and destruction of static single assignment form P Briggs, KD Cooper, TJ Harvey, LT Simpson Software: Practice and Experience 28 (8), 859-881, 1998 | 233 | 1998 |
| A simple, fast dominance algorithm KD Cooper, TJ Harvey, K Kennedy Software Practice & Experience 4 (1-10), 1-8, 2001 | 201 | 2001 |
| ACME: adaptive compilation made efficient KD Cooper, A Grosul, TJ Harvey, S Reeves, D Subramanian, L Torczon, ... ACM SIGPLAN Notices 40 (7), 69-77, 2005 | 135 | 2005 |
| Compiler-controlled memory KD Cooper, TJ Harvey ACM SIGOPS Operating Systems Review 32 (5), 2-11, 1998 | 119 | 1998 |
| Fast copy coalescing and live-range identification Z Budimlic, KD Cooper, TJ Harvey, K Kennedy, TS Oberg, SW Reeves ACM SIGPLAN Notices 37 (5), 25-32, 2002 | 91 | 2002 |
| Experiences using the ParaScope Editor: an interactive parallel programming tool MW Hall, TJ Harvey, K Kennedy, N McIntosh, KS McKinley, JD Oldham, ... Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice …, 1993 | 79 | 1993 |
| Building a control-flow graph from scheduled assembly code KD Cooper, TJ Harvey, T Waterman Dept. of Computer Science, Rice University, 2002 | 57 | 2002 |
| Exploring the structure of the space of compilation sequences using randomized search algorithms KD Cooper, A Grosul, TJ Harvey, S Reeves, D Subramanian, L Torczon, ... The Journal of Supercomputing 36, 135-151, 2006 | 53 | 2006 |
| Iterative data-flow analysis KD Cooper, TJ Harvey, K Kennedy Revis ited, Department of Computer Science Rice University Houston, Texas, USA, 2004 | 33 | 2004 |
| A simple, fast dominance algorithm KD Cooper, TJ Harvey, K Kennedy | 27 | 2006 |
| Iterative data-flow analysis, revisited KD Cooper, TJ Harvey, K Kennedy Rice Univ., Houston, TX, Tech. Rep. TR04-100, 2004 | 25 | 2004 |
| How to build an interference graph KD Cooper, TJ Harvey, L Torczon Software: Practice and Experience 28 (4), 425-444, 1998 | 25 | 1998 |
| Multiplication by integer constants P Briggs, T Harvey This is a “web”, a literate programming document. See http://softlib. rice …, 1994 | 25 | 1994 |
| Static single assignment construction P Briggs, T Harvey, T Simpson Technical report, 1995 | 22 | 1995 |
| An adaptive strategy for inline substitution KD Cooper, TJ Harvey, T Waterman Compiler Construction: 17th International Conference, CC 2008, Held as Part …, 2008 | 17 | 2008 |
| An empirical study of iterative data-flow analysis KD Cooper, TJ Harvey, K Kennedy 2006 15th International Conference on Computing, 266-276, 2006 | 9 | 2006 |
| Compilation order matters K Cooper, TJ Harvey, D Subramanian, L Torczon Technical Report, 2002 | 8 | 2002 |
| Reducing the impact of spill code TJ Harvey Rice University, 1998 | 7 | 1998 |
| Linear-time algorithm to determine the maximum number of iterations of the iterative algorithm for data-flow analysis for reducible loops AL Davis, P Fuqua, TJ Harvey US Patent 10,025,569, 2018 | 5 | 2018 |
Keith CooperProfessor of Computer Science, Rice UniversityVerified email at rice.edu
