| 2001 | SIGCOMM | Stability issues in OSPF routing. | Anindya Basu, Jon G. Riecke |
| 2000 | ESOP | A Calculus for Compiling and Linking Classes. | Kathleen Fisher, John H. Reppy, Jon G. Riecke |
| 1999 | ICALP | Typed Exeptions and Continuations Cannot Macro-Express Each Other. | Jon G. Riecke, Hayo Thielecke |
| 1999 | LICS | Region Analysis and the Polymorphic Lambda Calculus. | Anindya Banerjee, Nevin Heintze, Jon G. Riecke |
| 1999 | POPL | A Core Calculus of Dependency. | Martn Abadi, Anindya Banerjee, Nevin Heintze, Jon G. Riecke |
| 1998 | POPL | The SLam Calculus: Programming with Secrecy and Integrity. | Nevin Heintze, Jon G. Riecke |
| 1997 | LICS | A Relational Account of Call-by-Value Sequentiality. | Jon G. Riecke, Anders Sandholm |
| 1996 | PLDI | Simple Objects for Standard ML. | John H. Reppy, Jon G. Riecke |
| 1995 | POPL | Isolating Side Effects in Sequential Languages. | Jon G. Riecke, Ramesh Viswanathan |
| 1994 | ESOP | Fully Abstract Translations and Parametric Polymorphism. | Peter W. O'Hearn, Jon G. Riecke |
| 1993 | POPL | Algebraic Reasoning and Completeness in Typed Languages. | Jon G. Riecke, Ramesh Subrahmanyam |
| 1991 | POPL | Fully Abstract Translations between Functional Languages. | Jon G. Riecke |
| 1990 | ICALP | A Complete and Decidable Proof System for Call-by-Value Equalities (Preliminary Report). | Jon G. Riecke |
| 1990 | LICS | Completeness for typed lazy inequalities | Stavros S. Cosmadakis, Albert R. Meyer, Jon G. Riecke |
| 1987 | MFPS | The Semantics of Miranda's Algebraic Types. | Kim B. Bruce, Jon G. Riecke |