Consensus Numbers of Multi-Objects. - Eric Ruppert (PODC, 1998)

Consensus Numbers of Transactional Objects. - Eric Ruppert (DISC, 1999)

On the Existence of Booster Types. - Maurice Herlihy; Eric Ruppert (FOCS, 2000)

Lower Bounds in Distributed Computing. - Faith E. Fich; Eric Ruppert (DISC, 2000)

Finding the k Shortest Paths in Parallel. - Eric Ruppert (Algorithmica, 2000)

Determining Consensus Numbers. - Eric Ruppert (SIAM J. Comput., 2000)

The consensus power of shared-memory distributed systems. - Eric Ruppert (2000)

Space-optimal multi-writer snapshot objects are slow. - Panagiota Fatourou; Faith E. Fich; Eric Ruppert (PODC, 2002)

A tight time lower bound for space-optimal implementations of multi-writer snapshots. - Panagiota Fatourou; Faith E. Fich; Eric Ruppert (STOC, 2003)

Hundreds of impossibility results for distributed computing. - Faith E. Fich; Eric Ruppert (Distributed Comput., 2003)

Lock-free linked lists and skip lists. - Mikhail Fomitchev; Eric Ruppert (PODC, 2004)

On the Power of Anonymous One-Way Communication. - Dana Angluin; James Aspnes; David Eisenstat; Eric Ruppert (OPODIS, 2005)

What Can Be Implemented Anonymously? - Rachid Guerraoui; Eric Ruppert (DISC, 2005)

When Birds Die: Making Population Protocols Fault-Tolerant. - Carole Delporte-Gallet; Hugues Fauconnier; Rachid Guerraoui; Eric Ruppert (DCOSS, 2006)

Time-space tradeoffs for implementations of snapshots. - Panagiota Fatourou; Faith Ellen Fich; Eric Ruppert (STOC, 2006)

Relationships between broadcast and shared memory in reliable anonymous distributed systems. - James Aspnes; Faith Ellen Fich; Eric Ruppert (Distributed Comput., 2006)

Secretive Birds: Privacy in Population Protocols. - Carole Delporte-Gallet; Hugues Fauconnier; Rachid Guerraoui; Eric Ruppert (OPODIS, 2007)

The Anonymous Consensus Hierarchy and Naming Problems. - Eric Ruppert (OPODIS, 2007)

The computational power of population protocols. - Dana Angluin; James Aspnes; David Eisenstat; Eric Ruppert (Distributed Comput., 2007)

Anonymous and fault-tolerant shared-memory computing. - Rachid Guerraoui; Eric Ruppert (Distributed Comput., 2007)

An Introduction to Population Protocols. - James Aspnes; Eric Ruppert (Bull. EATCS, 2007)

Time lower bounds for implementations of multi-writer snapshots. - Faith Ellen; Panagiota Fatourou; Eric Ruppert (J. ACM, 2007)

Partial snapshot objects. - Hagit Attiya; Rachid Guerraoui; Eric Ruppert (SPAA, 2008)

The space complexity of unbounded timestamps. - Faith Ellen; Panagiota Fatourou; Eric Ruppert (Distributed Comput., 2008)

Implementing Shared Registers in Asynchronous Message-Passing Systems. - Eric Ruppert (Encyclopedia of Algorithms, 2008)

Snapshots in Shared Memory. - Eric Ruppert (Encyclopedia of Algorithms, 2008)

An Introduction to Population Protocols. - James Aspnes; Eric Ruppert (Middleware for Network Eccentric and Mobile Applications, 2009)

Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures. - Rachid Guerraoui; Eric Ruppert (ICALP (2), 2009)

Non-blocking binary search trees. - Faith Ellen; Panagiota Fatourou; Eric Ruppert; Franck van Breugel (PODC, 2010)

Pragmatic primitives for non-blocking data structures. - Trevor Brown 001; Faith Ellen; Eric Ruppert (PODC, 2013)

Byzantine agreement with homonyms. - Carole Delporte-Gallet; Hugues Fauconnier; Rachid Guerraoui; Anne-Marie Kermarrec; Eric Ruppert; Hung Tran-The (Distributed Comput., 2013)

Linearizability Is Not Always a Safety Property. - Rachid Guerraoui; Eric Ruppert (NETYS, 2014)

The amortized complexity of non-blocking binary search trees. - Faith Ellen; Panagiota Fatourou; Joanna Helga; Eric Ruppert (PODC, 2014)

A paradox of eventual linearizability in shared memory. - Rachid Guerraoui; Eric Ruppert (PODC, 2014)

A general technique for non-blocking trees. - Trevor Brown 001; Faith Ellen; Eric Ruppert (PPoPP, 2014)

On the Space Complexity of Set Agreement. - Carole Delporte-Gallet; Hugues Fauconnier; Petr Kuznetsov; Eric Ruppert (PODC, 2015)

Depth of a Random Binary Search Tree with Concurrent Insertions. - James Aspnes; Eric Ruppert (DISC, 2016)

Implementing Shared Registers in Asynchronous Message-Passing Systems. - Eric Ruppert (Encyclopedia of Algorithms, 2016)

Snapshots in Shared Memory. - Eric Ruppert (Encyclopedia of Algorithms, 2016)

Brief Announcement: Readers of Wait-Free Unbounded Registers Must Write. - Eric Ruppert (PODC, 2017)

Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries. - Panagiota Fatourou; Eric Ruppert (CoRR, 2018)

Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries. - Panagiota Fatourou; Elias Papavasileiou; Eric Ruppert (SPAA, 2019)

Constant-Time Lazy Snapshots Supporting General Queries on Concurrent Data Structures. - Naama Ben-David; Guy E. Blelloch; Panagiota Fatourou; Eric Ruppert; Yihan Sun 001; Yuanhao Wei (CoRR, 2020)

Constant-time snapshots with applications to concurrent data structures. - Yuanhao Wei; Naama Ben-David; Guy E. Blelloch; Panagiota Fatourou; Eric Ruppert; Yihan Sun 001 (PPoPP, 2021)

Space and Time Bounded Multiversion Garbage Collection. - Naama Ben-David; Guy E. Blelloch; Panagiota Fatourou; Eric Ruppert; Yihan Sun 001; Yuanhao Wei (DISC, 2021)

Practically and Theoretically Efficient Garbage Collection for Multiversioning (Artifact). - Yuanhao Wei; Guy E. Blelloch; Panagiota Fatourou; Eric Ruppert (Zenodo, 2022)

A Wait-Free Deque With Polylogarithmic Step Complexity. - Shalom M. Asbell; Eric Ruppert (OPODIS, 2023)

Practically and Theoretically Efficient Garbage Collection for Multiversioning. - Yuanhao Wei; Guy E. Blelloch; Panagiota Fatourou; Eric Ruppert (PPoPP, 2023)

Lock-Free Augmented Trees. - Panagiota Fatourou; Eric Ruppert (DISC, 2024)

A wait-free queue with polylogarithmic step complexity. - Hossein Naderibeni; Eric Ruppert (Distributed Comput., 2024)

Lock-Free Augmented Trees (Abstract). - Panagiota Fatourou; Eric Ruppert (HOPC@SPAA, 2025)

Aggregating Funnels for Faster Fetch&Add and Queues. - Younghun Roh; Yuanhao Wei; Eric Ruppert; Panagiota Fatourou; Siddhartha Jayanti; Julian Shun (PPoPP, 2025)

When is recoverable consensus harder than consensus? - Carole Delporte-Gallet; Panagiota Fatourou; Hugues Fauconnier; Eric Ruppert (Distributed Comput., 2025)

Concurrent Double-Ended Priority Queues. - Panagiota Fatourou; Eric Ruppert; Ioannis Xiradakis (CoRR, 2025)