default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEric Ruppert
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Hossein Naderibeni, Eric Ruppert:
A wait-free queue with polylogarithmic step complexity. Distributed Comput. 37(4): 309-334 (2024)- [c37]Panagiota Fatourou, Eric Ruppert:
Lock-Free Augmented Trees. DISC 2024: 23:1-23:24 - [i11]Panagiota Fatourou, Eric Ruppert:
Lock-Free Augmented Trees. CoRR abs/2405.10506 (2024) - 2023
- [c36]Shalom M. Asbell, Eric Ruppert:
A Wait-Free Deque With Polylogarithmic Step Complexity. OPODIS 2023: 17:1-17:22 - [c35]Hossein Naderibeni
, Eric Ruppert:
A Wait-free Queue with Polylogarithmic Step Complexity. PODC 2023: 124-134 - [c34]Yuanhao Wei, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert:
Practically and Theoretically Efficient Garbage Collection for Multiversioning. PPoPP 2023: 66-78 - [i10]Hossein Naderibeni, Eric Ruppert:
A Wait-free Queue with Polylogarithmic Step Complexity. CoRR abs/2305.07229 (2023) - 2022
- [c33]Carole Delporte-Gallet, Panagiota Fatourou, Hugues Fauconnier, Eric Ruppert:
When is Recoverable Consensus Harder Than Consensus? PODC 2022: 198-208 - [d1]Yuanhao Wei, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert:
Practically and Theoretically Efficient Garbage Collection for Multiversioning (Artifact). Zenodo, 2022
- [i9]Carole Delporte-Gallet, Panagiota Fatourou, Hugues Fauconnier, Eric Ruppert:
When Is Recoverable Consensus Harder Than Consensus? CoRR abs/2205.14213 (2022) - [i8]Yuanhao Wei, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert:
Practically and Theoretically Efficient Garbage Collection for Multiversioning. CoRR abs/2212.13557 (2022) - 2021
- [c32]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: 31-46 - [c31]Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun, Yuanhao Wei:
Space and Time Bounded Multiversion Garbage Collection. DISC 2021: 12:1-12:20 - [i7]Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun, Yuanhao Wei:
Space and Time Bounded Multiversion Garbage Collection. CoRR abs/2108.02775 (2021) - 2020
- [i6]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 abs/2007.02372 (2020)
2010 – 2019
- 2019
- [c30]Panagiota Fatourou, Elias Papavasileiou, Eric Ruppert:
Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries. SPAA 2019: 275-286 - 2018
- [i5]Panagiota Fatourou, Eric Ruppert:
Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries. CoRR abs/1805.04779 (2018) - 2017
- [c29]Eric Ruppert:
Brief Announcement: Readers of Wait-Free Unbounded Registers Must Write. PODC 2017: 93-94 - [i4]Trevor Brown, Faith Ellen, Eric Ruppert:
A General Technique for Non-blocking Trees. CoRR abs/1712.06687 (2017) - [i3]Trevor Brown, Faith Ellen, Eric Ruppert:
Pragmatic Primitives for Non-blocking Data Structures. CoRR abs/1712.06688 (2017) - 2016
- [c28]James Aspnes, Eric Ruppert:
Depth of a Random Binary Search Tree with Concurrent Insertions. DISC 2016: 371-384 - [r4]Eric Ruppert:
Implementing Shared Registers in Asynchronous Message-Passing Systems. Encyclopedia of Algorithms 2016: 954-958 - [r3]Eric Ruppert:
Snapshots in Shared Memory. Encyclopedia of Algorithms 2016: 2017-2022 - 2015
- [c27]Carole Delporte-Gallet, Hugues Fauconnier, Petr Kuznetsov, Eric Ruppert:
On the Space Complexity of Set Agreement. PODC 2015: 271-280 - [i2]Carole Delporte-Gallet, Hugues Fauconnier, Petr Kuznetsov, Eric Ruppert:
On the Space Complexity of Set Agreement. CoRR abs/1505.02690 (2015) - 2014
- [c26]Rachid Guerraoui, Eric Ruppert:
Linearizability Is Not Always a Safety Property. NETYS 2014: 57-69 - [c25]Rachid Guerraoui, Eric Ruppert:
A paradox of eventual linearizability in shared memory. PODC 2014: 40-49 - [c24]Faith Ellen, Panagiota Fatourou, Joanna Helga, Eric Ruppert:
The amortized complexity of non-blocking binary search trees. PODC 2014: 332-340 - [c23]Trevor Brown, Faith Ellen, Eric Ruppert:
A general technique for non-blocking trees. PPoPP 2014: 329-342 - 2013
- [j10]Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Anne-Marie Kermarrec, Eric Ruppert, Hung Tran-The:
Byzantine agreement with homonyms. Distributed Comput. 26(5-6): 321-340 (2013) - [c22]Trevor Brown, Faith Ellen, Eric Ruppert:
Pragmatic primitives for non-blocking data structures. PODC 2013: 13-22 - 2011
- [c21]Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Anne-Marie Kermarrec, Eric Ruppert, Hung Tran-The:
Byzantine agreement with homonyms. PODC 2011: 21-30 - 2010
- [c20]Faith Ellen, Panagiota Fatourou, Eric Ruppert, Franck van Breugel:
Non-blocking binary search trees. PODC 2010: 131-140
2000 – 2009
- 2009
- [c19]Rachid Guerraoui, Eric Ruppert:
Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures. ICALP (2) 2009: 484-495 - [p1]James Aspnes, Eric Ruppert:
An Introduction to Population Protocols. Middleware for Network Eccentric and Mobile Applications 2009: 97-120 - 2008
- [j9]Faith Ellen, Panagiota Fatourou, Eric Ruppert:
The space complexity of unbounded timestamps. Distributed Comput. 21(2): 103-115 (2008) - [c18]Hagit Attiya, Rachid Guerraoui, Eric Ruppert:
Partial snapshot objects. SPAA 2008: 336-343 - [r2]Eric Ruppert:
Implementing Shared Registers in Asynchronous Message-Passing Systems. Encyclopedia of Algorithms 2008 - [r1]Eric Ruppert:
Snapshots in Shared Memory. Encyclopedia of Algorithms 2008 - 2007
- [j8]Rachid Guerraoui, Eric Ruppert:
Anonymous and fault-tolerant shared-memory computing. Distributed Comput. 20(3): 165-177 (2007) - [j7]Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert:
The computational power of population protocols. Distributed Comput. 20(4): 279-304 (2007) - [j6]James Aspnes, Eric Ruppert:
An Introduction to Population Protocols. Bull. EATCS 93: 98-117 (2007) - [j5]Faith Ellen, Panagiota Fatourou, Eric Ruppert:
Time lower bounds for implementations of multi-writer snapshots. J. ACM 54(6): 30 (2007) - [c17]Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Eric Ruppert:
Secretive Birds: Privacy in Population Protocols. OPODIS 2007: 329-342 - [c16]Eric Ruppert:
The Anonymous Consensus Hierarchy and Naming Problems. OPODIS 2007: 386-400 - [c15]Faith Ellen, Panagiota Fatourou, Eric Ruppert:
The Space Complexity of Unbounded Timestamps. DISC 2007: 223-237 - 2006
- [j4]James Aspnes, Faith Ellen Fich, Eric Ruppert:
Relationships between broadcast and shared memory in reliable anonymous distributed systems. Distributed Comput. 18(3): 209-219 (2006) - [c14]Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Eric Ruppert:
When Birds Die: Making Population Protocols Fault-Tolerant. DCOSS 2006: 51-66 - [c13]Panagiota Fatourou, Faith Ellen Fich, Eric Ruppert:
Time-space tradeoffs for implementations of snapshots. STOC 2006: 169-178 - [e1]Eric Ruppert, Dahlia Malkhi:
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 2006, Denver, CO, USA, July 23-26, 2006. ACM 2006, ISBN 1-59593-384-0 [contents] - [i1]Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert:
The computational power of population protocols. CoRR abs/cs/0608084 (2006) - 2005
- [c12]Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert:
On the Power of Anonymous One-Way Communication. OPODIS 2005: 396-411 - [c11]Rachid Guerraoui, Eric Ruppert:
What Can Be Implemented Anonymously? DISC 2005: 244-259 - 2004
- [c10]Mikhail Fomitchev, Eric Ruppert:
Lock-free linked lists and skip lists. PODC 2004: 50-59 - [c9]James Aspnes, Faith E. Fich, Eric Ruppert:
Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems. DISC 2004: 260-274 - 2003
- [j3]Faith E. Fich, Eric Ruppert:
Hundreds of impossibility results for distributed computing. Distributed Comput. 16(2-3): 121-163 (2003) - [c8]Panagiota Fatourou, Faith E. Fich, Eric Ruppert:
A tight time lower bound for space-optimal implementations of multi-writer snapshots. STOC 2003: 259-268 - 2002
- [c7]Panagiota Fatourou, Faith E. Fich, Eric Ruppert:
Space-optimal multi-writer snapshot objects are slow. PODC 2002: 13-20 - 2000
- [b1]Eric Ruppert:
The consensus power of shared-memory distributed systems. University of Toronto, Canada, 2000 - [j2]Eric Ruppert:
Finding the k Shortest Paths in Parallel. Algorithmica 28(2): 242-254 (2000) - [j1]Eric Ruppert:
Determining Consensus Numbers. SIAM J. Comput. 30(4): 1156-1168 (2000) - [c6]Maurice Herlihy, Eric Ruppert:
On the Existence of Booster Types. FOCS 2000: 653-663 - [c5]Faith E. Fich, Eric Ruppert:
Lower Bounds in Distributed Computing. DISC 2000: 1-28
1990 – 1999
- 1999
- [c4]Eric Ruppert:
Consensus Numbers of Transactional Objects. DISC 1999: 312-326 - 1998
- [c3]Eric Ruppert:
Consensus Numbers of Multi-Objects. PODC 1998: 211-217 - 1997
- [c2]Eric Ruppert:
Determining Consensus Numbers. PODC 1997: 93-99 - [c1]Eric Ruppert:
Finding the k Shortest Paths in Parallel. STACS 1997: 475-486
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-25 23:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
