Corentin Travers

ORCID

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 24

Top Venues

University of Rennes 1, France (PHD)

Education History

University of Rennes 1, France

PHD

Publications

Carole Delporte-Gallet, Hugues Fauconnier, Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers
Non-negotiating Distributed Computing. SIROCCO (2024)
Carole Delporte-Gallet, Hugues Fauconnier, Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers
The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers. PODC (2024)
Mirza Ahad Baig, Danny Hendler, Alessia Milani, Corentin Travers
Long-lived counters with polylogarithmic amortized step complexity. Distributed Comput. 36 (1) (2023)
Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers
-resilient consensus in arbitrary graphs. Inf. Comput. 292 (2023)
Carole Delporte, Hugues Fauconnier, Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers
The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers. CoRR (2023)
Borzoo Bonakdarpour, Pierre Fraigniaud, Sergio Rajsbaum, David A. Rosenblueth, Corentin Travers
Decentralized Asynchronous Crash-resilient Runtime Verification. J. ACM 69 (5) (2022)
Zohir Bouzid, Pierre Sutra, Corentin Travers
Agreeing within a few writes. Theor. Comput. Sci. 922 (2022)
Danny Hendler, Adnane Khattabi, Alessia Milani, Corentin Travers
Upper and Lower Bounds for Deterministic Approximate Objects. CoRR (2021)
Danny Hendler, Adnane Khattabi, Alessia Milani, Corentin Travers
Upper and Lower Bounds for Deterministic Approximate Objects. ICDCS (2021)
Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers
A topological perspective on distributed network algorithms. Theor. Comput. Sci. 849 (2021)
Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers
A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring. J. Appl. Comput. Topol. 4 (1) (2020)
Mirza Ahad Baig, Danny Hendler, Alessia Milani, Corentin Travers
Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity. PODC (2020)
Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers, Petr Kuznetsov, Thibault Rieutord
Perfect failure detection with very few bits. Inf. Comput. 275 (2020)
Olivier Beaumont, Tobias Castanet, Nicolas Hanusse, Corentin Travers
Approximation Algorithm for Estimating Distances in Distributed Virtual Environments. Euro-Par (2020)
Mirza Ahad Baig, Danny Hendler, Alessia Milani, Corentin Travers
Long-Lived Counters with Polylogarithmic Amortized Step Complexity. DISC (2019)
Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers
Synchronous t-Resilient Consensus in Arbitrary Graphs. SSS (2019)
Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers
A Topological Perspective on Distributed Network Algorithms. SIROCCO (2019)
Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers
A Topological Perspective on Distributed Network Algorithms. CoRR (2019)
Zohir Bouzid, Corentin Travers
Anonymity-Preserving Failure Detectors. DISC (2016)
Borzoo Bonakdarpour, Pierre Fraigniaud, Sergio Rajsbaum, David A. Rosenblueth, Corentin Travers
Decentralized Asynchronous Crash-Resilient Runtime Verification. CONCUR (2016)
Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers
Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings. LATIN (2016)
Faith Ellen, Panagiota Fatourou, Eleftherios Kosmas, Alessia Milani, Corentin Travers
Universal constructions that ensure disjoint-access parallelism and wait-freedom. Distributed Comput. 29 (4) (2016)
Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers, Petr Kuznetsov, Thibault Rieutord
Perfect Failure Detection with Very Few Bits. SSS (2016)
Borzoo Bonakdarpour, Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers
Challenges in Fault-Tolerant Distributed Runtime Verification. ISoLA (2) (2016)
David Bonnin, Corentin Travers
Splitting and Renaming with a Majority of Faulty Processes. ICDCN (2015)
Pierre Fraigniaud, Sergio Rajsbaum, Matthieu Roy, Corentin Travers
The Opinion Number of Set-Agreement. OPODIS (2014)
Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers
On the Number of Opinions Needed for Fault-Tolerant Run-Time Monitoring in Distributed Systems. RV (2014)
Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers
Locality and checkability in wait-free computing. Distributed Comput. 26 (4) (2013)
David Bonnin, Corentin Travers
α-Register. OPODIS (2013)
Zohir Bouzid, Corentin Travers
Parallel Consensus is Harder than Set Agreement in Message Passing. ICDCS (2013)
Dan Alistarh, Hagit Attiya, Rachid Guerraoui, Corentin Travers
Early Deciding Synchronous Renaming in O( logf ) Rounds or Less. SIROCCO (2012)
Faith Ellen, Panagiota Fatourou, Eleftherios Kosmas, Alessia Milani, Corentin Travers
Universal constructions that ensure disjoint-access parallelism and wait-freedom. PODC (2012)
Zohir Bouzid, Corentin Travers
Brief Announcement: Anonymity, Failures, Detectors and Consensus. DISC (2012)
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers
Generating Fast Indulgent Algorithms. Theory Comput. Syst. 51 (4) (2012)
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement. Algorithmica 62 (1-2) (2012)
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers
Generating Fast Indulgent Algorithms. ICDCN (2011)
Zohir Bouzid, Pierre Sutra, Corentin Travers
Anonymous Agreement: The Janus Algorithm. OPODIS (2011)
Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers
Locality and Checkability in Wait-Free Computing. DISC (2011)
Yehuda Afek, Eli Gafni, Sergio Rajsbaum, Michel Raynal, Corentin Travers
-simultaneous consensus problem. Distributed Comput. 22 (3) (2010)
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers
Brief Announcement: New Bounds for Partially Synchronous Set Agreement. DISC (2010)
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) (2010)
Philippe Raipin Parvédy, Michel Raynal, Corentin Travers
-Set Agreement in Synchronous Systems with General Omission Failures. Theory Comput. Syst. 47 (1) (2010)
Zohir Bouzid, Corentin Travers
-Set Agreement Algorithms. OPODIS (2010)
Antonio Fernández Anta, Sergio Rajsbaum, Corentin Travers
Brief announcement: weakest failure detectors via an egg-laying simulation. PODC (2009)
Eli Gafni, Achour Mostéfaoui, Michel Raynal, Corentin Travers
From adaptive renaming to set agreement. Theor. Comput. Sci. 410 (14) (2009)
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement. ISAAC (2009)
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) (2008)
Achour Mostéfaoui, Michel Raynal, Corentin Travers
Narrowing Power vs. Efficiency in Synchronous Set Agreement. ICDCN (2008)
Sergio Rajsbaum, Michel Raynal, Corentin Travers
The Iterated Restricted Immediate Snapshot Model. COCOON (2008)
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Corentin Travers
How to Solve Consensus in the Smallest Window of Synchrony. DISC (2008)
Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Corentin Travers
On the computability power and the robustness of set agreement-oriented failure detector classes. Distributed Comput. 21 (3) (2008)
Sergio Rajsbaum, Michel Raynal, Corentin Travers
An impossibility about failure detectors in the iterated immediate snapshot model. Inf. Process. Lett. 108 (3) (2008)
Achour Mostéfaoui, Michel Raynal, Corentin Travers
From Renaming to Set Agreement. SIROCCO (2007)
Jiannong Cao, Michel Raynal, Corentin Travers, Weigang Wu
The Eventual Leadership in Dynamic Mobile Networking Environments. PRDC (2007)
Eli Gafni, Michel Raynal, Corentin Travers
Test & Set, Adaptive Renaming and Set Agreement: a Guided Visit to Asynchronous Computability. SRDS (2007)
Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Corentin Travers
From omega to Omega: A simple bounded quiescent reliable broadcast-based transformation. J. Parallel Distributed Comput. 67 (1) (2007)
Alejandro Cornejo, Sergio Rajsbaum, Michel Raynal, Corentin Travers
Failure detectors are schedulers. PODC (2007)
Philippe Raipin Parvédy, Michel Raynal, Corentin Travers
-Set Agreement in Synchronous Systems with General Omission Failures. SIROCCO (2006)
Jin Yang, Jiannong Cao, Weigang Wu, Corentin Travers
The notification based approach to implementing failure detectors in distributed systems. Infoscale (2006)
Achour Mostéfaoui, Eric Mourgaya, Michel Raynal, Corentin Travers
A Time-free Assumption to Implement Eventual Leadership. Parallel Process. Lett. 16 (2) (2006)
Achour Mostéfaoui, Michel Raynal, Corentin Travers, Sergio Rajsbaum
From Failure Detectors with Limited Scope Accuracy to System-wide Leadership. AINA (1) (2006)
Michel Raynal, Corentin Travers
In Search of the Holy Grail: Looking for the Weakest Failure Detector for Wait-Free Set Agreement. OPODIS (2006)
Achour Mostéfaoui, Michel Raynal, Corentin Travers
Time-Free and Timer-Based Assumptions Can Be Combined to Obtain Eventual Leadership. IEEE Trans. Parallel Distributed Syst. 17 (7) (2006)
Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Corentin Travers
Irreducibility and additivity of set agreement-oriented failure detector classes. PODC (2006)
Achour Mostéfaoui, Michel Raynal, Corentin Travers
to Wait-Free Adaptive (2p-[p/k])-Renaming Via k-Set Agreement. DISC (2006)
Michel Raynal, Corentin Travers
Synchronous Set Agreement: a Concise Guided Tour (including a new algorithm and a list of open problems). PRDC (2006)
Yehuda Afek, Eli Gafni, Sergio Rajsbaum, Michel Raynal, Corentin Travers
Simultaneous Consensus Tasks: A Tighter Characterization of Set-Consensus. ICDCN (2006)
Eli Gafni, Sergio Rajsbaum, Michel Raynal, Corentin Travers
The Committee Decision Problem. LATIN (2006)
Roy Friedman, Michel Raynal, Corentin Travers
Two Abstractions for Implementing Atomic Objects in Dynamic Systems. OPODIS (2005)
Achour Mostéfaoui, Michel Raynal, Corentin Travers, Stacy Patterson, Divyakant Agrawal, Amr El Abbadi
From Static Distributed Systems to Dynamic Systems. SRDS (2005)
Roy Friedman, Michel Raynal, Corentin Travers
Brief announcement: abstractions for implementing atomic objects in dynamic systems. PODC (2005)
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)
Philippe Raipin Parvédy, Michel Raynal, Corentin Travers
-Set Agreement in Synchronous Systems Prone to Any Number of Process Crashes. PaCT (2005)
Achour Mostéfaoui, Michel Raynal, Corentin Travers
Crash-Resilient Time-Free Eventual Leadership. SRDS (2004)

Corentin Travers.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Corentin Travers