| 2026 | PPoPP | Concurrent Balanced Augmented Trees. | Evan Wrench, Ajay Singh, Younghun Roh, Panagiota Fatourou, Siddhartha Jayanti, Eric Ruppert, Yuanhao Wei |
| 2025 | PPoPP | Aggregating Funnels for Faster Fetch&Add and Queues. | Younghun Roh, Yuanhao Wei, Eric Ruppert, Panagiota Fatourou, Siddhartha Jayanti, Julian Shun |
| 2023 | OPODIS | A Wait-Free Deque With Polylogarithmic Step Complexity. | Shalom M. Asbell, Eric Ruppert |
| 2023 | PODC | A Wait-free Queue with Polylogarithmic Step Complexity. | Hossein Naderibeni, Eric Ruppert |
| 2023 | PPoPP | Practically and Theoretically Efficient Garbage Collection for Multiversioning. | Yuanhao Wei, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert |
| 2022 | PODC | When is Recoverable Consensus Harder Than Consensus? | Carole Delporte-Gallet, Panagiota Fatourou, Hugues Fauconnier, Eric Ruppert |
| 2021 | PPoPP | Constant-time snapshots with applications to concurrent data structures. | Yuanhao Wei, Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun |
| 2019 | SPAA | Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries. | Panagiota Fatourou, Elias Papavasileiou, Eric Ruppert |
| 2017 | PODC | Brief Announcement: Readers of Wait-Free Unbounded Registers Must Write. | Eric Ruppert |
| 2015 | PODC | On the Space Complexity of Set Agreement. | Carole Delporte-Gallet, Hugues Fauconnier, Petr Kuznetsov, Eric Ruppert |
| 2014 | PODC | The amortized complexity of non-blocking binary search trees. | Faith Ellen, Panagiota Fatourou, Joanna Helga, Eric Ruppert |
| 2014 | PODC | A paradox of eventual linearizability in shared memory. | Rachid Guerraoui, Eric Ruppert |
| 2014 | PPoPP | A general technique for non-blocking trees. | Trevor Brown, Faith Ellen, Eric Ruppert |
| 2013 | PODC | Pragmatic primitives for non-blocking data structures. | Trevor Brown, Faith Ellen, Eric Ruppert |
| 2011 | PODC | Byzantine agreement with homonyms. | Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Anne-Marie Kermarrec, Eric Ruppert, Hung Tran-The |
| 2010 | PODC | Non-blocking binary search trees. | Faith Ellen, Panagiota Fatourou, Eric Ruppert, Franck van Breugel |
| 2009 | ICALP | Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures. | Rachid Guerraoui, Eric Ruppert |
| 2008 | SPAA | Partial snapshot objects. | Hagit Attiya, Rachid Guerraoui, Eric Ruppert |
| 2007 | OPODIS | Secretive Birds: Privacy in Population Protocols. | Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Eric Ruppert |
| 2007 | OPODIS | The Anonymous Consensus Hierarchy and Naming Problems. | Eric Ruppert |
| 2006 | DCOSS | When Birds Die: Making Population Protocols Fault-Tolerant. | Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Eric Ruppert |
| 2006 | STOC | Time-space tradeoffs for implementations of snapshots. | Panagiota Fatourou, Faith Ellen Fich, Eric Ruppert |
| 2005 | OPODIS | On the Power of Anonymous One-Way Communication. | Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert |
| 2004 | PODC | Lock-free linked lists and skip lists. | Mikhail Fomitchev, Eric Ruppert |
| 2003 | STOC | A tight time lower bound for space-optimal implementations of multi-writer snapshots. | Panagiota Fatourou, Faith E. Fich, Eric Ruppert |
| 2002 | PODC | Space-optimal multi-writer snapshot objects are slow. | Panagiota Fatourou, Faith E. Fich, Eric Ruppert |
| 2000 | FOCS | On the Existence of Booster Types. | Maurice Herlihy, Eric Ruppert |
| 1998 | PODC | Consensus Numbers of Multi-Objects. | Eric Ruppert |
| 1997 | PODC | Determining Consensus Numbers. | Eric Ruppert |
| 1997 | STACS | Finding the k Shortest Paths in Parallel. | Eric Ruppert |