default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBastian Pochon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j7]Eli Gafni, Rachid Guerraoui
, Bastian Pochon:
The Complexity of Early Deciding Set Agreement. SIAM J. Comput. 40(1): 63-78 (2011)- 2010
- [j6]Rachid Guerraoui, Ron R. Levy, Bastian Pochon, Vivien Quéma:
Throughput optimal total order broadcast for cluster environments. ACM Trans. Comput. Syst. 28(2): 5:1-5:32 (2010)
2000 – 2009
- 2009
- [j5]Rachid Guerraoui, Maurice Herlihy, Bastian Pochon:
A topological treatment of early-deciding set-agreement. Theor. Comput. Sci. 410(6-7): 570-580 (2009) - 2008
- [j4]Rachid Guerraoui, Ron R. Levy, Bastian Pochon, Jim Pugh:
The collective memory of amnesic processes. ACM Trans. Algorithms 4(1): 12:1-12:31 (2008) - 2007
- [j3]Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Bastian Pochon:
The perfectly synchronized round-based model of distributed computing. Inf. Comput. 205(5): 783-815 (2007) - [j2]Partha Dutta, Rachid Guerraoui, Bastian Pochon:
The Time-Complexity of Local Decision in Distributed Agreement. SIAM J. Comput. 37(3): 722-756 (2007) - 2006
- [c12]Rachid Guerraoui, Ron R. Levy, Bastian Pochon, Vivien Quéma:
High Throughput Total Order Broadcast for Cluster Environments. DSN 2006: 549-557 - [c11]Rachid Guerraoui, Maurice Herlihy, Bastian Pochon:
A Topological Treatment of Early-Deciding Set-Agreement. OPODIS 2006: 20-35 - [c10]Rachid Guerraoui, Maurice Herlihy, Bastian Pochon:
Towards a theory of transactional contention managers. PODC 2006: 316-317 - 2005
- [c9]Rachid Guerraoui, Maurice Herlihy, Bastian Pochon:
Toward a theory of transactional contention managers. PODC 2005: 258-264 - [c8]Eli Gafni, Rachid Guerraoui, Bastian Pochon:
From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement. STOC 2005: 714-722 - [c7]Rachid Guerraoui, Maurice Herlihy, Bastian Pochon:
Polymorphic Contention Management. DISC 2005: 303-323 - 2004
- [j1]Partha Dutta, Rachid Guerraoui, Bastian Pochon:
Fast non-blocking atomic commit: an inherent trade-off. Inf. Process. Lett. 91(4): 195-200 (2004) - [c6]Sébastien Baehni, Roberto Baldoni, Rachid Guerraoui, Bastian Pochon:
The Driving Philosophers. IFIP TCS 2004: 181-194 - [c5]Rachid Guerraoui, Bastian Pochon:
The Complexity of Early Deciding Set Agreement: How can Topology help? GETCO@DISC 2004: 71-78 - 2003
- [c4]Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Bastian Pochon:
Distributed Programming for Dummies: A Shifting Transformation Technique. SRDS 2003: 349- - [c3]Partha Dutta, Rachid Guerraoui, Bastian Pochon:
Tight Bounds on Early Local Decisions in Uniform Consensus. DISC 2003: 264-278 - 2002
- [c2]Partha Dutta, Svend Frølund, Rachid Guerraoui, Bastian Pochon:
An Efficient Universal Construction for Message-Passing Systems. DISC 2002: 133-147 - [c1]Rachid Guerraoui, Petr Kouznetsov, Bastian Pochon:
A Note on Set Agreement with Omission Failures. GETCO 2002: 48-58
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-04-24 22:56 CEST 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:
