Corentin Travers

Orcid: 0000-0002-6797-4542

According to our database1, Corentin Travers authored at least 62 papers between 2004 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Synchronous <i>t</i>-resilient consensus in arbitrary graphs.
Inf. Comput., June, 2023

Long-lived counters with polylogarithmic amortized step complexity.
Distributed Comput., March, 2023

The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers.
CoRR, 2023

2022
Agreeing within a few writes.
Theor. Comput. Sci., 2022

Decentralized Asynchronous Crash-resilient Runtime Verification.
J. ACM, 2022

2021
A topological perspective on distributed network algorithms.
Theor. Comput. Sci., 2021

Upper and Lower Bounds for Deterministic Approximate Objects.
Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 2021

2020
A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring.
J. Appl. Comput. Topol., 2020

Perfect failure detection with very few bits.
Inf. Comput., 2020

Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Approximation Algorithm for Estimating Distances in Distributed Virtual Environments.
Proceedings of the Euro-Par 2020: Parallel Processing, 2020

2019
Synchronous t-Resilient Consensus in Arbitrary Graphs.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2019

2016
Universal constructions that ensure disjoint-access parallelism and wait-freedom.
Distributed Comput., 2016

Anonymity-Preserving Failure Detectors.
Proceedings of the Distributed Computing - 30th International Symposium, 2016

Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Challenges in Fault-Tolerant Distributed Runtime Verification.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation: Discussion, Dissemination, Applications, 2016

2015
Splitting and Renaming with a Majority of Faulty Processes.
Proceedings of the 2015 International Conference on Distributed Computing and Networking, 2015

2014
On the Number of Opinions Needed for Fault-Tolerant Run-Time Monitoring in Distributed Systems.
Proceedings of the Runtime Verification - 5th International Conference, 2014

The Opinion Number of Set-Agreement.
Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

2013
Locality and checkability in wait-free computing.
Distributed Comput., 2013

α-Register.
Proceedings of the Principles of Distributed Systems - 17th International Conference, 2013

Parallel Consensus is Harder than Set Agreement in Message Passing.
Proceedings of the IEEE 33rd International Conference on Distributed Computing Systems, 2013

2012
Generating Fast Indulgent Algorithms.
Theory Comput. Syst., 2012

Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement.
Algorithmica, 2012

Brief Announcement: Anonymity, Failures, Detectors and Consensus.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

Early Deciding Synchronous Renaming in O( logf ) Rounds or Less.
Proceedings of the Structural Information and Communication Complexity, 2012

2011
Anonymous Agreement: The Janus Algorithm.
Proceedings of the Principles of Distributed Systems - 15th International Conference, 2011

2010
Narrowing power vs efficiency in synchronous set agreement: Relationship, algorithms and lower bound.
Theor. Comput. Sci., 2010

Strongly Terminating Early-Stopping <i>k</i>-Set Agreement in Synchronous Systems with General Omission Failures.
Theory Comput. Syst., 2010

The <i>k</i>-simultaneous consensus problem.
Distributed Comput., 2010

Brief Announcement: New Bounds for Partially Synchronous Set Agreement.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

(anti-Omega<sup><i>x</i></sup> ×Sigma<sub><i>z</i></sub>)-Based <i>k</i>-Set Agreement Algorithms.
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

2009
From adaptive renaming to set agreement.
Theor. Comput. Sci., 2009

Brief announcement: weakest failure detectors via an egg-laying simulation.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

2008
The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement.
SIAM J. Comput., 2008

An impossibility about failure detectors in the iterated immediate snapshot model.
Inf. Process. Lett., 2008

On the computability power and the robustness of set agreement-oriented failure detector classes.
Distributed Comput., 2008

How to Solve Consensus in the Smallest Window of Synchrony.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

Narrowing Power vs. Efficiency in Synchronous Set Agreement.
Proceedings of the Distributed Computing and Networking, 9th International Conference, 2008

The Iterated Restricted Immediate Snapshot Model.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

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

From omega to Omega: A simple bounded quiescent reliable broadcast-based transformation.
J. Parallel Distributed Comput., 2007

Test & Set, Adaptive Renaming and Set Agreement: a Guided Visit to Asynchronous Computability.
Proceedings of the 26th IEEE Symposium on Reliable Distributed Systems (SRDS 2007), 2007

From Renaming to Set Agreement.
Proceedings of the Structural Information and Communication Complexity, 2007

The Eventual Leadership in Dynamic Mobile Networking Environments.
Proceedings of the 13th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2007), 2007

Failure detectors are schedulers.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

2006
Time-Free and Timer-Based Assumptions Can Be Combined to Obtain Eventual Leadership.
IEEE Trans. Parallel Distributed Syst., 2006

A Time-free Assumption to Implement Eventual Leadership.
Parallel Process. Lett., 2006

Exploring Gafni's Reduction Land: From <i>Omega</i><sup><i>k</i></sup> to Wait-Free Adaptive (2p-[p/k])-Renaming Via k-Set Agreement.
Proceedings of the Distributed Computing, 20th International Symposium, 2006

Synchronous Set Agreement: a Concise Guided Tour (including a new algorithm and a list of open problems).
Proceedings of the 12th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2006), 2006

Irreducibility and additivity of set agreement-oriented failure detector classes.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

In Search of the Holy Grail: Looking for the Weakest Failure Detector for Wait-Free Set Agreement.
Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

The Committee Decision Problem.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

The notification based approach to implementing failure detectors in distributed systems.
Proceedings of the 1st International Conference on Scalable Information Systems, 2006

Simultaneous Consensus Tasks: A Tighter Characterization of Set-Consensus.
Proceedings of the Distributed Computing and Networking, 8th International Conference, 2006

From Failure Detectors with Limited Scope Accuracy to System-wide Leadership.
Proceedings of the 20th International Conference on Advanced Information Networking and Applications (AINA 2006), 2006

2005
From Static Distributed Systems to Dynamic Systems.
Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems (SRDS 2005), 2005

Decision Optimal Early-Stopping k-set Agreement in Synchronous Systems Prone to Send Omission Failures.
Proceedings of the 11th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2005), 2005

Brief announcement: abstractions for implementing atomic objects in dynamic systems.
Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

Early-Stopping <i>k</i>-Set Agreement in Synchronous Systems Prone to Any Number of Process Crashes.
Proceedings of the Parallel Computing Technologies, 2005

Two Abstractions for Implementing Atomic Objects in Dynamic Systems.
Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005

2004
Crash-Resilient Time-Free Eventual Leadership.
Proceedings of the 23rd International Symposium on Reliable Distributed Systems (SRDS 2004), 2004


  Loading...