| 2020 | PLDI | Compiler and runtime support for continuation marks. | Matthew Flatt, R. Kent Dybvig |
| 2015 | PLDI | Profile-guided meta-programming. | William J. Bowman, Swaha Miller, Vincent St-Amour, R. Kent Dybvig |
| 2013 | ICFP | A nanopass framework for commercial compiler development. | Andrew W. Keep, R. Kent Dybvig |
| 2012 | ICFP | A sufficiently smart compiler for procedural records. | Andrew W. Keep, R. Kent Dybvig |
| 2012 | ICFP | Optimizing closures in O(0) time. | Andrew W. Keep, Alex Hearn, R. Kent Dybvig |
| 2011 | OOPSLA | Flow-sensitive type recovery in linear-log time. | Michael D. Adams, Andrew W. Keep, Jan Midtgaard, Matthew Might, Arun Chauhan, R. Kent Dybvig |
| 2008 | ICFP | Efficient nondestructive equality checking for trees and graphs. | Michael D. Adams, R. Kent Dybvig |
| 2007 | ICFP | Implicit phasing for R6RS libraries. | Abdulaziz Ghuloum, R. Kent Dybvig |
| 2006 | ICFP | The development of Chez Scheme. | R. Kent Dybvig |
| 2004 | ICFP | A nanopass infrastructure for compiler education. | Dipanwita Sarkar, Oscar Waddell, R. Kent Dybvig |
| 1999 | POPL | Extending the Scope of Syntactic Abstraction. | Oscar Waddell, R. Kent Dybvig |
| 1997 | SAS | Fast and Effective Procedure Inlining. | Oscar Waddell, R. Kent Dybvig |
| 1996 | PLDI | Representing Control in the Presence of One-Shot Continuations. | Carl Bruggeman, Oscar Waddell, R. Kent Dybvig |
| 1996 | PLDI | Printing Floating-Point Numbers Quickly and Accurately. | Robert G. Burger, R. Kent Dybvig |
| 1995 | PLDI | Register Allocation Using Lazy Saves, Eager Restores, and Greedy Shuffling. | Robert G. Burger, Oscar Waddell, R. Kent Dybvig |
| 1993 | PLDI | Guardians in a Generation-Based Garbage Collector. | R. Kent Dybvig, Carl Bruggeman, David Eby |
| 1992 | PSC | A New Architecture Design Paradigm for Parallel Computing in Scheme. | Carl Bruggeman, R. Kent Dybvig |
| 1990 | PLDI | Representing Control in the Presence of First-Class Continuations. | Robert Hieb, R. Kent Dybvig, Carl Bruggeman |
| 1990 | PPoPP | Continuations and Concurrency. | Robert Hieb, R. Kent Dybvig |