| 2010 | OPODIS | Failure Detectors Encapsulate Fairness. | Scott M. Pike, Srikanth Sastry, Jennifer L. Welch |
| 2010 | SPAA | Corrigendum: weakest failure detector for wait-free dining under eventual weak exclusion. | Srikanth Sastry, Scott M. Pike, Jennifer L. Welch |
| 2009 | OOPSLA | Traditional assignment considered harmful. | Scott M. Pike, Wayne D. Heym, Bruce M. Adcock, Derek Bronish, Jason Kirschenbaum, Bruce W. Weide |
| 2009 | SPAA | The weakest failure detector for wait-free dining under eventual weak exclusion. | Srikanth Sastry, Scott M. Pike, Jennifer L. Welch |
| 2008 | ICDCN | Wait-Free Dining Under Eventual Weak Exclusion. | Scott M. Pike, Yantao Song, Srikanth Sastry |
| 2007 | DSN | Eventually k-Bounded Wait-Free Distributed Daemons. | Yantao Song, Scott M. Pike |
| 2007 | ISPA | Eventually Perfect Failure Detectors Using ADD Channels. | Srikanth Sastry, Scott M. Pike |
| 2007 | SIGCSE | The suitability of kinesthetic learning activities for teaching distributed algorithms. | Paolo A. G. Sivilotti, Scott M. Pike |
| 2006 | SSS | Brief Announcement: Wait-Free Dining for Eventual Weak Exclusion. | Scott M. Pike, Yantao Song, Kaustav Ghoshal |
| 2004 | ICDCS | Dining Philosophers with Crash Locality 1. | Scott M. Pike, Paolo A. G. Sivilotti |
| 2003 | ICDCS | Dynamic Module Replacement in Distributed Protocols. | Nigamanth Sridhar, Scott M. Pike, Bruce W. Weide |
| 2002 | ICSR | Early-Reply Components: Concurrent Execution with Sequential Reasoning. | Scott M. Pike, Nigamanth Sridhar |
| 2002 | OOPSLA | Encapsulating concurrency with Early-Reply. | Scott M. Pike |
| 2000 | ICSR | Reasoning about Software-Component Behavior. | Murali Sitaraman, Steven Atkinson, Gregory Kulczycki, Bruce W. Weide, Timothy J. Long, Paolo Bucci, Wayne D. Heym, Scott M. Pike, Joseph E. Hollingsworth |
| 2000 | SIGCSE | Checkmate: cornering C++ dynamic memory errors with checked pointers. | Scott M. Pike, Bruce W. Weide, Joseph E. Hollingsworth |