| 2011 | COCOON | Strong I/O Lower Bounds for Binomial and FFT Computation Graphs. | Desh Ranjan, John E. Savage, Mohammad Zubair |
| 2010 | IWOCA | Upper and Lower I/O Bounds for Pebbling | Desh Ranjan, John E. Savage, Mohammad Zubair |
| 2008 | ISIT | A framework for coded computation. | Eric Rachlin, John E. Savage |
| 2006 | ICCAD | Nanowire addressing with randomized-contact decoders. | Eric Rachlin, John E. Savage |
| 2003 | CIAC | Computing with Electronic Nanotechnologies. | John E. Savage |
| 1999 | HPDC | PARED: A Framework for the Adaptive Solution of PDEs. | Jos G. Castaos, John E. Savage |
| 1995 | COCOON | Extending the Hong-Kung Model to Memory Hierarchies. | John E. Savage |
| 1995 | STACS | Generalized Scans and Tri-Diagonal Systems. | Paul F. Fischer, Franco P. Preparata, John E. Savage |
| 1994 | SPAA | A Model for Multi-Grained Parallelism (Extended Abstract). | John E. Savage |
| 1990 | ICALP | On Parallelizing Graph-Partitioning Heuristics. | John E. Savage, Markus G. Wloka |
| 1988 | WG | A Parallel Algorithm for Channel Routing. | John E. Savage, Markus G. Wloka |
| 1983 | WG | Heuristics for Level Graph Embeddings. | John E. Savage |
| 1980 | STOC | Graph Pebbling with Many Free Pebbles can be Difficult | David A. Carlson, John E. Savage |
| 1979 | ICALP | Space-Time Tradeoffs for Oblivious Interger Multiplications. | John E. Savage, Sowmitri Swamy |
| 1979 | POPL | Space-Time Tradeoffs for Linear Recursion. | Sowmitri Swamy, John E. Savage |
| 1974 | FOCS | Combinational Complexity of Some Monotone Functions | Edmund A. Lamagna, John E. Savage |