- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j12 |      | Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers: Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement. Algorithmica 62(1-2): 595-629 (2012) |
| j11 | | Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers: Generating Fast Indulgent Algorithms. Theory Comput. Syst. 51(4): 404-424 (2012) |
| c32 | | Faith Ellen, Panagiota Fatourou, Eleftherios Kosmas, Alessia Milani, Corentin Travers: Universal constructions that ensure disjoint-access parallelism and wait-freedom. PODC 2012: 115-124 |
| c31 | | Dan Alistarh, Hagit Attiya, Rachid Guerraoui, Corentin Travers: Early Deciding Synchronous Renaming in O( logf ) Rounds or Less. SIROCCO 2012: 195-206 |
| c30 | | Zohir Bouzid, Corentin Travers: Brief Announcement: Anonymity, Failures, Detectors and Consensus. DISC 2012: 427-428 |
| 2011 | ||
| c29 | | Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers: Generating Fast Indulgent Algorithms. ICDCN 2011: 41-52 |
| c28 | | Zohir Bouzid, Pierre Sutra, Corentin Travers: Anonymous Agreement: The Janus Algorithm. OPODIS 2011: 175-190 |
| c27 | | Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers: Locality and Checkability in Wait-Free Computing. DISC 2011: 333-347 |
| 2010 | ||
| j10 | | Yehuda Afek, Eli Gafni, Sergio Rajsbaum, Michel Raynal, Corentin Travers: The k-simultaneous consensus problem. Distributed Computing 22(3): 185-195 (2010) |
| j9 | | Philippe Raipin Parvédy, Michel Raynal, Corentin Travers: Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures. Theory Comput. Syst. 47(1): 259-287 (2010) |
| j8 | | Achour Mostéfaoui, Michel Raynal, Corentin Travers: Narrowing power vs efficiency in synchronous set agreement: Relationship, algorithms and lower bound. Theor. Comput. Sci. 411(1): 58-69 (2010) |
| c26 | | Zohir Bouzid, Corentin Travers: (anti-Omegax ×Sigmaz)-Based k-Set Agreement Algorithms. OPODIS 2010: 189-204 |
| c25 | | Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers: Brief Announcement: New Bounds for Partially Synchronous Set Agreement. DISC 2010: 404-405 |
| 2009 | ||
| j7 | | Eli Gafni, Achour Mostéfaoui, Michel Raynal, Corentin Travers: From adaptive renaming to set agreement. Theor. Comput. Sci. 410(14): 1328-1335 (2009) |
| c24 | | Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers: Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement. ISAAC 2009: 943-953 |
| c23 | | Antonio Fernández Anta, Sergio Rajsbaum, Corentin Travers: Brief announcement: weakest failure detectors via an egg-laying simulation. PODC 2009: 290-291 |
| 2008 | ||
| j6 | | Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Corentin Travers: On the computability power and the robustness of set agreement-oriented failure detector classes. Distributed Computing 21(3): 201-222 (2008) |
| j5 | | Sergio Rajsbaum, Michel Raynal, Corentin Travers: An impossibility about failure detectors in the iterated immediate snapshot model. Inf. Process. Lett. 108(3): 160-164 (2008) |
| j4 | | Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Corentin Travers: The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement. SIAM J. Comput. 38(4): 1574-1601 (2008) |
| c22 | | Sergio Rajsbaum, Michel Raynal, Corentin Travers: The Iterated Restricted Immediate Snapshot Model. COCOON 2008: 487-497 |
| c21 | | Achour Mostéfaoui, Michel Raynal, Corentin Travers: Narrowing Power vs. Efficiency in Synchronous Set Agreement. ICDCN 2008: 99-111 |
| c20 | | Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers: How to Solve Consensus in the Smallest Window of Synchrony. DISC 2008: 32-46 |
| 2007 | ||
| j3 | | Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Corentin Travers: From omega to Omega: A simple bounded quiescent reliable broadcast-based transformation. J. Parallel Distrib. Comput. 67(1): 125-129 (2007) |
| c19 | | Alejandro Cornejo, Sergio Rajsbaum, Michel Raynal, Corentin Travers: Failure detectors are schedulers. PODC 2007: 308-309 |
| c18 | | Jiannong Cao, Michel Raynal, Corentin Travers, Weigang Wu: The Eventual Leadership in Dynamic Mobile Networking Environments. PRDC 2007: 123-130 |
| c17 | | Achour Mostéfaoui, Michel Raynal, Corentin Travers: From Renaming to Set Agreement. SIROCCO 2007: 66-80 |
| c16 | | Eli Gafni, Michel Raynal, Corentin Travers: Test & Set, Adaptive Renaming and Set Agreement: a Guided Visit to Asynchronous Computability. SRDS 2007: 93-102 |
| 2006 | ||
| j2 | | Achour Mostéfaoui, Eric Mourgaya, Michel Raynal, Corentin Travers: A Time-free Assumption to Implement Eventual Leadership. Parallel Processing Letters 16(2): 189-208 (2006) |
| j1 | | Achour Mostéfaoui, Michel Raynal, Corentin Travers: Time-Free and Timer-Based Assumptions Can Be Combined to Obtain Eventual Leadership. IEEE Trans. Parallel Distrib. Syst. 17(7): 656-666 (2006) |
| c15 | | Achour Mostéfaoui, Michel Raynal, Corentin Travers, Sergio Rajsbaum: From Failure Detectors with Limited Scope Accuracy to System-wide Leadership. AINA (1) 2006: 81-86 |
| c14 | | Yehuda Afek, Eli Gafni, Sergio Rajsbaum, Michel Raynal, Corentin Travers: Simultaneous Consensus Tasks: A Tighter Characterization of Set-Consensus. ICDCN 2006: 331-341 |
| c13 | | Jin Yang, Jiannong Cao, Weigang Wu, Corentin Travers: The notification based approach to implementing failure detectors in distributed systems. Infoscale 2006: 14 |
| c12 | | Eli Gafni, Sergio Rajsbaum, Michel Raynal, Corentin Travers: The Committee Decision Problem. LATIN 2006: 502-514 |
| c11 | | Michel Raynal, Corentin Travers: In Search of the Holy Grail: Looking for the Weakest Failure Detector for Wait-Free Set Agreement. OPODIS 2006: 3-19 |
| c10 | | Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Corentin Travers: Irreducibility and additivity of set agreement-oriented failure detector classes. PODC 2006: 153-162 |
| c9 | | Michel Raynal, Corentin Travers: Synchronous Set Agreement: a Concise Guided Tour (including a new algorithm and a list of open problems). PRDC 2006: 267-274 |
| c8 | | Philippe Raipin Parvédy, Michel Raynal, Corentin Travers: Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures. SIROCCO 2006: 182-196 |
| c7 | | Achour Mostéfaoui, Michel Raynal, Corentin Travers: Exploring Gafni's Reduction Land: From Omegak to Wait-Free Adaptive (2p-[p/k])-Renaming Via k-Set Agreement. DISC 2006: 1-15 |
| 2005 | ||
| c6 | | Roy Friedman, Michel Raynal, Corentin Travers: Two Abstractions for Implementing Atomic Objects in Dynamic Systems. OPODIS 2005: 73-87 |
| c5 | | Philippe Raipin Parvédy, Michel Raynal, Corentin Travers: Early-Stopping k-Set Agreement in Synchronous Systems Prone to Any Number of Process Crashes. PaCT 2005: 49-58 |
| c4 | | Roy Friedman, Michel Raynal, Corentin Travers: Brief announcement: abstractions for implementing atomic objects in dynamic systems. PODC 2005: 354 |
| c3 | | Philippe Raipin Parvédy, Michel Raynal, Corentin Travers: Decision Optimal Early-Stopping k-set Agreement in Synchronous Systems Prone to Send Omission Failures. PRDC 2005: 23-30 |
| c2 | | Achour Mostéfaoui, Michel Raynal, Corentin Travers, Stacy Patterson, Divyakant Agrawal, Amr El Abbadi: From Static Distributed Systems to Dynamic Systems. SRDS 2005: 109-118 |
| 2004 | ||
| c1 | | Achour Mostéfaoui, Michel Raynal, Corentin Travers: Crash-Resilient Time-Free Eventual Leadership. SRDS 2004: 208-217 |
Data released under the ODC-BY 1.0 license — See also our legal information page