Eric Ruppert

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 18

Top Topics

Top Venues

Publications

Panagiota Fatourou, Eric Ruppert
Lock-Free Augmented Trees. CoRR (2024)
Hossein Naderibeni, Eric Ruppert
A Wait-free Queue with Polylogarithmic Step Complexity. CoRR (2023)
Yuanhao Wei, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert
Practically and Theoretically Efficient Garbage Collection for Multiversioning. PPoPP (2023)
Shalom M. Asbell, Eric Ruppert
A Wait-Free Deque With Polylogarithmic Step Complexity. OPODIS (2023)
Hossein Naderibeni, Eric Ruppert
A Wait-free Queue with Polylogarithmic Step Complexity. PODC (2023)
Carole Delporte-Gallet, Panagiota Fatourou, Hugues Fauconnier, Eric Ruppert
When is Recoverable Consensus Harder Than Consensus? PODC (2022)
Carole Delporte-Gallet, Panagiota Fatourou, Hugues Fauconnier, Eric Ruppert
When Is Recoverable Consensus Harder Than Consensus? CoRR (2022)
Yuanhao Wei, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert
Practically and Theoretically Efficient Garbage Collection for Multiversioning. CoRR (2022)
Yuanhao Wei, Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun
Constant-time snapshots with applications to concurrent data structures. PPoPP (2021)
Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun, Yuanhao Wei
Space and Time Bounded Multiversion Garbage Collection. CoRR (2021)
Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun, Yuanhao Wei
Space and Time Bounded Multiversion Garbage Collection. DISC (2021)
Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun, Yuanhao Wei
Constant-Time Lazy Snapshots Supporting General Queries on Concurrent Data Structures. CoRR (2020)
Panagiota Fatourou, Elias Papavasileiou, Eric Ruppert
Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries. SPAA (2019)
Panagiota Fatourou, Eric Ruppert
Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries. CoRR (2018)
Trevor Brown, Faith Ellen, Eric Ruppert
A General Technique for Non-blocking Trees. CoRR (2017)
Trevor Brown, Faith Ellen, Eric Ruppert
Pragmatic Primitives for Non-blocking Data Structures. CoRR (2017)
Eric Ruppert
Brief Announcement: Readers of Wait-Free Unbounded Registers Must Write. PODC (2017)
James Aspnes, Eric Ruppert
Depth of a Random Binary Search Tree with Concurrent Insertions. DISC (2016)
Carole Delporte-Gallet, Hugues Fauconnier, Petr Kuznetsov, Eric Ruppert
On the Space Complexity of Set Agreement? PODC (2015)
Carole Delporte-Gallet, Hugues Fauconnier, Petr Kuznetsov, Eric Ruppert
On the Space Complexity of Set Agreement. CoRR (2015)
Trevor Brown, Faith Ellen, Eric Ruppert
A general technique for non-blocking trees. PPOPP (2014)
Faith Ellen, Panagiota Fatourou, Joanna Helga, Eric Ruppert
The amortized complexity of non-blocking binary search trees. PODC (2014)
Rachid Guerraoui, Eric Ruppert
Linearizability Is Not Always a Safety Property. NETYS (2014)
Rachid Guerraoui, Eric Ruppert
A paradox of eventual linearizability in shared memory. PODC (2014)
Trevor Brown, Faith Ellen, Eric Ruppert
Pragmatic primitives for non-blocking data structures. PODC (2013)
Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Anne-Marie Kermarrec, Eric Ruppert, Hung Tran-The
Byzantine agreement with homonyms. Distributed Comput. 26 (5-6) (2013)
Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Anne-Marie Kermarrec, Eric Ruppert, Hung Tran-The
Byzantine agreement with homonyms. PODC (2011)
Faith Ellen, Panagiota Fatourou, Eric Ruppert, Franck van Breugel
Non-blocking binary search trees. PODC (2010)
Rachid Guerraoui, Eric Ruppert
Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures. ICALP (2) (2009)
Hagit Attiya, Rachid Guerraoui, Eric Ruppert
Partial snapshot objects. SPAA (2008)
Faith Ellen, Panagiota Fatourou, Eric Ruppert
The space complexity of unbounded timestamps. Distributed Comput. 21 (2) (2008)
Faith Ellen, Panagiota Fatourou, Eric Ruppert
Time lower bounds for implementations of multi-writer snapshots. J. ACM 54 (6) (2007)
Faith Ellen, Panagiota Fatourou, Eric Ruppert
The Space Complexity of Unbounded Timestamps. DISC (2007)
Eric Ruppert
The Anonymous Consensus Hierarchy and Naming Problems. OPODIS (2007)
Rachid Guerraoui, Eric Ruppert
Anonymous and fault-tolerant shared-memory computing. Distributed Comput. 20 (3) (2007)
Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert
The computational power of population protocols. Distributed Comput. 20 (4) (2007)
Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Eric Ruppert
Secretive Birds: Privacy in Population Protocols. OPODIS (2007)
James Aspnes, Eric Ruppert
An Introduction to Population Protocols. Bull. EATCS 93 (2007)
Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert
The computational power of population protocols CoRR (2006)
James Aspnes, Faith Ellen Fich, Eric Ruppert
Relationships between broadcast and shared memory in reliable anonymous distributed systems. Distributed Comput. 18 (3) (2006)
Panagiota Fatourou, Faith Ellen Fich, Eric Ruppert
Time-space tradeoffs for implementations of snapshots. STOC (2006)
Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Eric Ruppert
When Birds Die: Making Population Protocols Fault-Tolerant. DCOSS (2006)
Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert
On the Power of Anonymous One-Way Communication. OPODIS (2005)
Rachid Guerraoui, Eric Ruppert
What Can Be Implemented Anonymously? DISC (2005)
Mikhail Fomitchev, Eric Ruppert
Lock-free linked lists and skip lists. PODC (2004)
James Aspnes, Faith E. Fich, Eric Ruppert
Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems. DISC (2004)
Panagiota Fatourou, Faith E. Fich, Eric Ruppert
A tight time lower bound for space-optimal implementations of multi-writer snapshots. STOC (2003)
Faith E. Fich, Eric Ruppert
Hundreds of impossibility results for distributed computing. Distributed Comput. 16 (2-3) (2003)
Panagiota Fatourou, Faith E. Fich, Eric Ruppert
Space-optimal multi-writer snapshot objects are slow. PODC (2002)
Maurice Herlihy, Eric Ruppert
On the Existence of Booster Types. FOCS (2000)
Eric Ruppert
Finding the k Shortest Paths in Parallel. Algorithmica 28 (2) (2000)
Faith E. Fich, Eric Ruppert
Lower Bounds in Distributed Computing. DISC (2000)
Eric Ruppert
Determining Consensus Numbers. SIAM J. Comput. 30 (4) (2000)
Eric Ruppert
Consensus Numbers of Transactional Objects. DISC (1999)
Eric Ruppert
Consensus Numbers of Multi-Objects. PODC (1998)
Eric Ruppert
Determining Consensus Numbers. PODC (1997)
Eric Ruppert
Finding the k Shortest Paths in Parallel. STACS (1997)