Crash-Resilient Time-Free Eventual Leadership. - Achour Mostéfaoui; Michel Raynal; Corentin Travers (SRDS, 2004)

Two Abstractions for Implementing Atomic Objects in Dynamic Systems. - Roy Friedman; Michel Raynal; Corentin Travers (OPODIS, 2005)

Early-Stopping k-Set Agreement in Synchronous Systems Prone to Any Number of Process Crashes. - Philippe Raipin Parvédy; Michel Raynal; Corentin Travers (PaCT, 2005)

Brief announcement: abstractions for implementing atomic objects in dynamic systems. - Roy Friedman; Michel Raynal; Corentin Travers (PODC, 2005)

Decision Optimal Early-Stopping k-set Agreement in Synchronous Systems Prone to Send Omission Failures. - Philippe Raipin Parvédy; Michel Raynal; Corentin Travers (PRDC, 2005)

From Static Distributed Systems to Dynamic Systems. - Achour Mostéfaoui; Michel Raynal; Corentin Travers; Stacy Patterson; Divyakant Agrawal; Amr El Abbadi (SRDS, 2005)

From Failure Detectors with Limited Scope Accuracy to System-wide Leadership. - Achour Mostéfaoui; Michel Raynal; Corentin Travers; Sergio Rajsbaum (AINA (1), 2006)

Simultaneous Consensus Tasks: A Tighter Characterization of Set-Consensus. - Yehuda Afek; Eli Gafni; Sergio Rajsbaum; Michel Raynal; Corentin Travers (ICDCN, 2006)

The notification based approach to implementing failure detectors in distributed systems. - Jin Yang 005; Jiannong Cao 001; Weigang Wu; Corentin Travers (Infoscale, 2006)

The Committee Decision Problem. - Eli Gafni; Sergio Rajsbaum; Michel Raynal; Corentin Travers (LATIN, 2006)

In Search of the Holy Grail: Looking for the Weakest Failure Detector for Wait-Free Set Agreement. - Michel Raynal; Corentin Travers (OPODIS, 2006)

Irreducibility and additivity of set agreement-oriented failure detector classes. - Achour Mostéfaoui; Sergio Rajsbaum; Michel Raynal; Corentin Travers (PODC, 2006)

Synchronous Set Agreement: a Concise Guided Tour (including a new algorithm and a list of open problems). - Michel Raynal; Corentin Travers (PRDC, 2006)

Exploring Gafni's Reduction Land: From Omegak to Wait-Free Adaptive (2p-[p/k])-Renaming Via k-Set Agreement. - Achour Mostéfaoui; Michel Raynal; Corentin Travers (DISC, 2006)

A Time-free Assumption to Implement Eventual Leadership. - Achour Mostéfaoui; Eric Mourgaya; Michel Raynal; Corentin Travers (Parallel Process. Lett., 2006)

Time-Free and Timer-Based Assumptions Can Be Combined to Obtain Eventual Leadership. - Achour Mostéfaoui; Michel Raynal; Corentin Travers (IEEE Trans. Parallel Distributed Syst., 2006)

Failure detectors are schedulers. - Alejandro Cornejo; Sergio Rajsbaum; Michel Raynal; Corentin Travers (PODC, 2007)

The Eventual Leadership in Dynamic Mobile Networking Environments. - Jiannong Cao 001; Michel Raynal; Corentin Travers; Weigang Wu (PRDC, 2007)

From Renaming to Set Agreement. - Achour Mostéfaoui; Michel Raynal; Corentin Travers (SIROCCO, 2007)

Test & Set, Adaptive Renaming and Set Agreement: a Guided Visit to Asynchronous Computability. - Eli Gafni; Michel Raynal; Corentin Travers (SRDS, 2007)

From omega to Omega: A simple bounded quiescent reliable broadcast-based transformation. - Achour Mostéfaoui; Sergio Rajsbaum; Michel Raynal; Corentin Travers (J. Parallel Distributed Comput., 2007)

Derrière le consensus : coordination faiblement contrainte dans les systèmes distribués asynchrones. (Beyond consensus : weak coordination in asynchronous distributed systems). - Corentin Travers (2007)

The Iterated Restricted Immediate Snapshot Model. - Sergio Rajsbaum; Michel Raynal; Corentin Travers (COCOON, 2008)

Narrowing Power vs. Efficiency in Synchronous Set Agreement. - Achour Mostéfaoui; Michel Raynal; Corentin Travers (ICDCN, 2008)

How to Solve Consensus in the Smallest Window of Synchrony. - Dan Alistarh; Seth Gilbert; Rachid Guerraoui; Corentin Travers (DISC, 2008)

On the computability power and the robustness of set agreement-oriented failure detector classes. - Achour Mostéfaoui; Sergio Rajsbaum; Michel Raynal; Corentin Travers (Distributed Comput., 2008)

An impossibility about failure detectors in the iterated immediate snapshot model. - Sergio Rajsbaum; Michel Raynal; Corentin Travers (Inf. Process. Lett., 2008)

The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement. - Achour Mostéfaoui; Sergio Rajsbaum; Michel Raynal; Corentin Travers (SIAM J. Comput., 2008)

Brief announcement: weakest failure detectors via an egg-laying simulation. - Antonio Fernández Anta; Sergio Rajsbaum; Corentin Travers (PODC, 2009)

From adaptive renaming to set agreement. - Eli Gafni; Achour Mostéfaoui; Michel Raynal; Corentin Travers (Theor. Comput. Sci., 2009)

(anti-Omegax ×Sigmaz)-Based k-Set Agreement Algorithms. - Zohir Bouzid; Corentin Travers (OPODIS, 2010)

Brief Announcement: New Bounds for Partially Synchronous Set Agreement. - Dan Alistarh; Seth Gilbert; Rachid Guerraoui; Corentin Travers (DISC, 2010)

The k-simultaneous consensus problem. - Yehuda Afek; Eli Gafni; Sergio Rajsbaum; Michel Raynal; Corentin Travers (Distributed Comput., 2010)

Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures. - Philippe Raipin Parvédy; Michel Raynal; Corentin Travers (Theory Comput. Syst., 2010)

Narrowing power vs efficiency in synchronous set agreement: Relationship, algorithms and lower bound. - Achour Mostéfaoui; Michel Raynal; Corentin Travers (Theor. Comput. Sci., 2010)

Anonymous Agreement: The Janus Algorithm. - Zohir Bouzid; Pierre Sutra; Corentin Travers (OPODIS, 2011)

Early Deciding Synchronous Renaming in O( logf ) Rounds or Less. - Dan Alistarh; Hagit Attiya; Rachid Guerraoui; Corentin Travers (SIROCCO, 2012)

Brief Announcement: Anonymity, Failures, Detectors and Consensus. - Zohir Bouzid; Corentin Travers (DISC, 2012)

Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement. - Dan Alistarh; Seth Gilbert; Rachid Guerraoui; Corentin Travers (Algorithmica, 2012)

Generating Fast Indulgent Algorithms. - Dan Alistarh; Seth Gilbert; Rachid Guerraoui; Corentin Travers (Theory Comput. Syst., 2012)

Parallel Consensus is Harder than Set Agreement in Message Passing. - Zohir Bouzid; Corentin Travers (ICDCS, 2013)

α-Register. - David Bonnin; Corentin Travers (OPODIS, 2013)

Locality and checkability in wait-free computing. - Pierre Fraigniaud; Sergio Rajsbaum; Corentin Travers (Distributed Comput., 2013)

The Opinion Number of Set-Agreement. - Pierre Fraigniaud; Sergio Rajsbaum; Matthieu Roy; Corentin Travers (OPODIS, 2014)

On the Number of Opinions Needed for Fault-Tolerant Run-Time Monitoring in Distributed Systems. - Pierre Fraigniaud; Sergio Rajsbaum; Corentin Travers (RV, 2014)

Splitting and Renaming with a Majority of Faulty Processes. - David Bonnin; Corentin Travers (ICDCN, 2015)

Challenges in Fault-Tolerant Distributed Runtime Verification. - Borzoo Bonakdarpour; Pierre Fraigniaud; Sergio Rajsbaum; Corentin Travers (ISoLA (2), 2016)

Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings. - Pierre Fraigniaud; Sergio Rajsbaum; Corentin Travers (LATIN, 2016)

Anonymity-Preserving Failure Detectors. - Zohir Bouzid; Corentin Travers (DISC, 2016)

Universal constructions that ensure disjoint-access parallelism and wait-freedom. - Faith Ellen; Panagiota Fatourou; Eleftherios Kosmas; Alessia Milani; Corentin Travers (Distributed Comput., 2016)

Synchronous t-Resilient Consensus in Arbitrary Graphs. - Armando Castañeda; Pierre Fraigniaud; Ami Paz; Sergio Rajsbaum; Matthieu Roy; Corentin Travers (SSS, 2019)

Approximation Algorithm for Estimating Distances in Distributed Virtual Environments. - Olivier Beaumont; Tobias Castanet; Nicolas Hanusse; Corentin Travers (Euro-Par, 2020)

Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity. - Mirza Ahad Baig; Danny Hendler; Alessia Milani; Corentin Travers (PODC, 2020)

Perfect failure detection with very few bits. - Pierre Fraigniaud; Sergio Rajsbaum; Corentin Travers; Petr Kuznetsov; Thibault Rieutord (Inf. Comput., 2020)

A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring. - Pierre Fraigniaud; Sergio Rajsbaum; Corentin Travers (J. Appl. Comput. Topol., 2020)

Upper and Lower Bounds for Deterministic Approximate Objects. - Danny Hendler; Adnane Khattabi; Alessia Milani; Corentin Travers (ICDCS, 2021)

A topological perspective on distributed network algorithms. - Armando Castañeda; Pierre Fraigniaud; Ami Paz; Sergio Rajsbaum; Matthieu Roy; Corentin Travers (Theor. Comput. Sci., 2021)

Decentralized Asynchronous Crash-resilient Runtime Verification. - Borzoo Bonakdarpour; Pierre Fraigniaud; Sergio Rajsbaum; David A. Rosenblueth; Corentin Travers (J. ACM, 2022)

Agreeing within a few writes. - Zohir Bouzid; Pierre Sutra; Corentin Travers (Theor. Comput. Sci., 2022)

Long-lived counters with polylogarithmic amortized step complexity. - Mirza Ahad Baig; Danny Hendler; Alessia Milani; Corentin Travers (Distributed Comput., 2023)

Synchronous t-resilient consensus in arbitrary graphs. - Armando Castañeda; Pierre Fraigniaud; Ami Paz; Sergio Rajsbaum; Matthieu Roy; Corentin Travers (Inf. Comput., 2023)

The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers. - Carole Delporte-Gallet; Hugues Fauconnier; Pierre Fraigniaud; Sergio Rajsbaum; Corentin Travers (PODC, 2024)

Non-negotiating Distributed Computing. - Carole Delporte-Gallet; Hugues Fauconnier; Pierre Fraigniaud; Sergio Rajsbaum; Corentin Travers (SIROCCO, 2024)

Auditing without Leaks Despite Curiosity. - Hagit Attiya; Antonio Fernández Anta; Alessia Milani; Alexandre Rapetti; Corentin Travers (PODC, 2025)

Auditable Shared Objects: From Registers to Synchronization Primitives. - Hagit Attiya; Antonio Fernández Anta; Alessia Milani; Alexandre Rapetti; Corentin Travers (CoRR, 2025)