Corentin Travers

发表

Weakest failure detectors via an egg-laying simulation ( Preliminary Version )

Antonio Fernandez Anta, S. Rajsbaum, Corentin Travers, 2009 .

Reductions and Simulations in Distributed Computing

Nancy A. Lynch, Sergio Rajsbaum, Corentin Travers, 2016 .

As Scalable As Possible:Foundations of large-scale dynamic systems

Anne-Marie Kermarrec, Michel Raynal, Roberto Baldoni, 2007 .

Agreeing within a few writes

Corentin Travers, P. Sutra, Z. Bouzid, 2022, Theor. Comput. Sci..

(anti-Omega x Σ z) based k-set agreement algorithms

Corentin Travers, Z. Bouzid, 2015 .

Synchronous t -Resilient Consensus in Arbitrary Graphs (cid:63)

S. Rajsbaum, Corentin Travers, P. Fraigniaud, 2019 .

Challenges in Fault-Tolerant Distributed Runtime Verification

Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers, 2016, ISoLA.

On the Number of Opinions Needed for Fault-Tolerant Run-Time Monitoring in Distributed Systems

Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers, 2014, RV.

The Iterated Restricted Immediate Snapshot Model

Michel Raynal, Sergio Rajsbaum, Corentin Travers, 2008, COCOON.

How to Solve Consensus in the Smallest Window of Synchrony

Dan Alistarh, Rachid Guerraoui, Seth Gilbert, 2008, DISC.

Perfect Failure Detection with Very Few Bits

Petr Kuznetsov, Pierre Fraigniaud, Sergio Rajsbaum, 2016, SSS.

Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings

Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers, 2016, LATIN.

A Topological Perspective on Distributed Network Algorithms

Pierre Fraigniaud, Matthieu Roy, Sergio Rajsbaum, 2019, SIROCCO.

Splitting and Renaming with a Majority of Faulty Processes

Corentin Travers, David Bonnin, Corentin Travers, 2015, ICDCN.

Early Deciding Synchronous Renaming in O( logf ) Rounds or Less

Dan Alistarh, Rachid Guerraoui, Hagit Attiya, 2012, SIROCCO.

Generating Fast Indulgent Algorithms

Dan Alistarh, Rachid Guerraoui, Seth Gilbert, 2011, Theory of Computing Systems.

An impossibility about failure detectors in the iterated immediate snapshot model

Michel Raynal, Sergio Rajsbaum, Corentin Travers, 2008, Inf. Process. Lett..

The Eventual Leadership in Dynamic Mobile Networking Environments

Jiannong Cao, Michel Raynal, Corentin Travers, 2007, 13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007).

Synchronous t-Resilient Consensus in Arbitrary Graphs

Pierre Fraigniaud, Matthieu Roy, Sergio Rajsbaum, 2019, SSS.

The k-simultaneous consensus problem

Michel Raynal, Yehuda Afek, Eli Gafni, 2010, Distributed Computing.

Anonymous Agreement: The Janus Algorithm

Corentin Travers, Pierre Sutra, Zohir Bouzid, 2011, OPODIS.

Time-free and timer-based assumptions can be combined to obtain eventual leadership

Achour Mostéfaoui, Michel Raynal, Corentin Travers, 2006, IEEE Transactions on Parallel and Distributed Systems.

A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring

S. Rajsbaum, Corentin Travers, P. Fraigniaud, 2020, Journal of Applied and Computational Topology.

A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring

Pierre Fraigniaud, Corentin Travers, Sergio Rajsbaum, 2020, J. Appl. Comput. Topol..

The Opinion Number of Set-Agreement

Pierre Fraigniaud, Matthieu Roy, Sergio Rajsbaum, 2014, OPODIS.

From static distributed systems to dynamic systems

Achour Mostéfaoui, Michel Raynal, Divyakant Agrawal, 2005, 24th IEEE Symposium on Reliable Distributed Systems (SRDS'05).

Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings

S. Rajsbaum, Corentin Travers, P. Fraigniaud, 2016, LATIN.

Simultaneous Consensus Tasks: A Tighter Characterization of Set-Consensus

Michel Raynal, Yehuda Afek, Eli Gafni, 2006, ICDCN.