Eric Ruppert

74 papers A* 17A 10B 12Journal 26Unranked 3
YearRankTypeTitle / Venue / Authors
2026 B conf
Concurrent Balanced Augmented Trees.
PPoPP
Evan Wrench, Ajay Singh, Younghun Roh, Panagiota Fatourou, Siddhartha Jayanti, Eric Ruppert, Yuanhao Wei
2026 J jnl
Concurrent Balanced Augmented Trees.
CoRR
Evan Wrench, Ajay Singh, Younghun Roh, Panagiota Fatourou, Siddhartha Jayanti, Eric Ruppert, Yuanhao Wei
2025 B conf
Aggregating Funnels for Faster Fetch&Add and Queues.
PPoPP
Younghun Roh, Yuanhao Wei, Eric Ruppert, Panagiota Fatourou, Siddhartha Jayanti, Julian Shun
2025 A conf
Brief Announcement: Concurrent Double-Ended Priority Queues.
DISC
Panagiota Fatourou, Eric Ruppert, Ioannis Xiradakis
2025 J jnl
Concurrent Double-Ended Priority Queues.
CoRR
Panagiota Fatourou, Eric Ruppert, Ioannis Xiradakis
2025 — conf
Lock-Free Augmented Trees (Abstract).
HOPC@SPAA
Panagiota Fatourou, Eric Ruppert
2025 J jnl
When is recoverable consensus harder than consensus?
Distributed Comput.
Carole Delporte-Gallet, Panagiota Fatourou, Hugues Fauconnier, Eric Ruppert
2024 J jnl
A wait-free queue with polylogarithmic step complexity.
Distributed Comput.
Hossein Naderibeni, Eric Ruppert
2024 J jnl
Aggregating Funnels for Faster Fetch&Add and Queues.
CoRR
Younghun Roh, Yuanhao Wei, Eric Ruppert, Panagiota Fatourou, Siddhartha Jayanti, Julian Shun
2024 A conf
Lock-Free Augmented Trees.
DISC
Panagiota Fatourou, Eric Ruppert
2024 J jnl
Lock-Free Augmented Trees.
CoRR
Panagiota Fatourou, Eric Ruppert
2023 B conf
A Wait-Free Deque With Polylogarithmic Step Complexity.
OPODIS
Shalom M. Asbell, Eric Ruppert
2023 A* conf
A Wait-free Queue with Polylogarithmic Step Complexity.
PODC
Hossein Naderibeni, Eric Ruppert
2023 J jnl
A Wait-free Queue with Polylogarithmic Step Complexity.
CoRR
Hossein Naderibeni, Eric Ruppert
2023 B conf
Practically and Theoretically Efficient Garbage Collection for Multiversioning.
PPoPP
Yuanhao Wei, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert
2022 J jnl
Practically and Theoretically Efficient Garbage Collection for Multiversioning.
CoRR
Yuanhao Wei, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert
2022 J jnl
When Is Recoverable Consensus Harder Than Consensus?
CoRR
Carole Delporte-Gallet, Panagiota Fatourou, Hugues Fauconnier, Eric Ruppert
2022 A* conf
When is Recoverable Consensus Harder Than Consensus?
PODC
Carole Delporte-Gallet, Panagiota Fatourou, Hugues Fauconnier, Eric Ruppert
2021 B conf
Constant-time snapshots with applications to concurrent data structures.
PPoPP
Yuanhao Wei, Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun
2021 A conf
Space and Time Bounded Multiversion Garbage Collection.
DISC
Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun, Yuanhao Wei
2021 J jnl
Space and Time Bounded Multiversion Garbage Collection.
CoRR
Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun, Yuanhao Wei
2020 J jnl
Constant-Time Lazy Snapshots Supporting General Queries on Concurrent Data Structures.
CoRR
Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun, Yuanhao Wei
2019 B conf
Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries.
SPAA
Panagiota Fatourou, Elias Papavasileiou, Eric Ruppert
2018 J jnl
Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries.
CoRR
Panagiota Fatourou, Eric Ruppert
2017 J jnl
A General Technique for Non-blocking Trees.
CoRR
Trevor Brown, Faith Ellen, Eric Ruppert
2017 A* conf
Brief Announcement: Readers of Wait-Free Unbounded Registers Must Write.
PODC
Eric Ruppert
2017 J jnl
Pragmatic Primitives for Non-blocking Data Structures.
CoRR
Trevor Brown, Faith Ellen, Eric Ruppert
2016 A conf
Depth of a Random Binary Search Tree with Concurrent Insertions.
DISC
James Aspnes, Eric Ruppert
2016 — ch.
Implementing Shared Registers in Asynchronous Message-Passing Systems.
Encyclopedia of Algorithms
Eric Ruppert
2016 — ch.
Snapshots in Shared Memory.
Encyclopedia of Algorithms
Eric Ruppert
2015 A* conf
On the Space Complexity of Set Agreement.
PODC
Carole Delporte-Gallet, Hugues Fauconnier, Petr Kuznetsov, Eric Ruppert
2015 J jnl
On the Space Complexity of Set Agreement.
CoRR
Carole Delporte-Gallet, Hugues Fauconnier, Petr Kuznetsov, Eric Ruppert
2014 B conf
A general technique for non-blocking trees.
PPoPP
Trevor Brown, Faith Ellen, Eric Ruppert
2014 A* conf
A paradox of eventual linearizability in shared memory.
PODC
Rachid Guerraoui, Eric Ruppert
2014 — conf
Linearizability Is Not Always a Safety Property.
NETYS
Rachid Guerraoui, Eric Ruppert
2014 A* conf
The amortized complexity of non-blocking binary search trees.
PODC
Faith Ellen, Panagiota Fatourou, Joanna Helga, Eric Ruppert
2013 J jnl
Byzantine agreement with homonyms.
Distributed Comput.
Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Anne-Marie Kermarrec, Eric Ruppert, Hung Tran-The
2013 A* conf
Pragmatic primitives for non-blocking data structures.
PODC
Trevor Brown, Faith Ellen, Eric Ruppert
2011 A* conf
Byzantine agreement with homonyms.
PODC
Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Anne-Marie Kermarrec, Eric Ruppert, Hung Tran-The
2010 A* conf
Non-blocking binary search trees.
PODC
Faith Ellen, Panagiota Fatourou, Eric Ruppert, Franck van Breugel
2009 — ch.
An Introduction to Population Protocols.
Middleware for Network Eccentric and Mobile Applications
James Aspnes, Eric Ruppert
2009 — conf
Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures.
ICALP (2)
Rachid Guerraoui, Eric Ruppert
2008 — ch.
Implementing Shared Registers in Asynchronous Message-Passing Systems.
Encyclopedia of Algorithms
Eric Ruppert
2008 B conf
Partial snapshot objects.
SPAA
Hagit Attiya, Rachid Guerraoui, Eric Ruppert
2008 — ch.
Snapshots in Shared Memory.
Encyclopedia of Algorithms
Eric Ruppert
2008 J jnl
The space complexity of unbounded timestamps.
Distributed Comput.
Faith Ellen, Panagiota Fatourou, Eric Ruppert
2007 J jnl
An Introduction to Population Protocols.
Bull. EATCS
James Aspnes, Eric Ruppert
2007 J jnl
Anonymous and fault-tolerant shared-memory computing.
Distributed Comput.
Rachid Guerraoui, Eric Ruppert
2007 B conf
Secretive Birds: Privacy in Population Protocols.
OPODIS
Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Eric Ruppert
2007 B conf
The Anonymous Consensus Hierarchy and Naming Problems.
OPODIS
Eric Ruppert
2007 A conf
The Space Complexity of Unbounded Timestamps.
DISC
Faith Ellen, Panagiota Fatourou, Eric Ruppert
2007 J jnl
The computational power of population protocols.
Distributed Comput.
Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert
2007 J jnl
Time lower bounds for implementations of multi-writer snapshots.
J. ACM
Faith Ellen, Panagiota Fatourou, Eric Ruppert
2006 A* ed.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 2006, Denver, CO, USA, July 23-26, 2006
PODC
Eric Ruppert, Dahlia Malkhi
2006 J jnl
Relationships between broadcast and shared memory in reliable anonymous distributed systems.
Distributed Comput.
James Aspnes, Faith Ellen Fich, Eric Ruppert
2006 J jnl
The computational power of population protocols
CoRR
Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert
2006 A* conf
Time-space tradeoffs for implementations of snapshots.
STOC
Panagiota Fatourou, Faith Ellen Fich, Eric Ruppert
2006 B conf
When Birds Die: Making Population Protocols Fault-Tolerant.
DCOSS
Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Eric Ruppert
2005 B conf
On the Power of Anonymous One-Way Communication.
OPODIS
Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert
2005 A conf
What Can Be Implemented Anonymously?
DISC
Rachid Guerraoui, Eric Ruppert
2004 A* conf
Lock-free linked lists and skip lists.
PODC
Mikhail Fomitchev, Eric Ruppert
2004 A conf
Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems.
DISC
James Aspnes, Faith E. Fich, Eric Ruppert
2003 A* conf
A tight time lower bound for space-optimal implementations of multi-writer snapshots.
STOC
Panagiota Fatourou, Faith E. Fich, Eric Ruppert
2003 J jnl
Hundreds of impossibility results for distributed computing.
Distributed Comput.
Faith E. Fich, Eric Ruppert
2002 A* conf
Space-optimal multi-writer snapshot objects are slow.
PODC
Panagiota Fatourou, Faith E. Fich, Eric Ruppert
2000 J jnl
Determining Consensus Numbers.
SIAM J. Comput.
Eric Ruppert
2000 J jnl
Finding the k Shortest Paths in Parallel.
Algorithmica
Eric Ruppert
2000 A conf
Lower Bounds in Distributed Computing.
DISC
Faith E. Fich, Eric Ruppert
2000 A* conf
On the Existence of Booster Types.
FOCS
Maurice Herlihy, Eric Ruppert
2000 — —
The consensus power of shared-memory distributed systems.
Eric Ruppert
1999 A conf
Consensus Numbers of Transactional Objects.
DISC
Eric Ruppert
1998 A* conf
Consensus Numbers of Multi-Objects.
PODC
Eric Ruppert
1997 A* conf
Determining Consensus Numbers.
PODC
Eric Ruppert
1997 A conf
Finding the k Shortest Paths in Parallel.
STACS
Eric Ruppert