default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCorentin Travers
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c50]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: 310-320- [c49]Carole Delporte-Gallet, Hugues Fauconnier, Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers:
Non-negotiating Distributed Computing. SIROCCO 2024: 208-225 - 2023
- [j21]Mirza Ahad Baig, Danny Hendler, Alessia Milani, Corentin Travers:
Long-lived counters with polylogarithmic amortized step complexity. Distributed Comput. 36(1): 29-43 (2023) - [j20]Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers:
Synchronous t-resilient consensus in arbitrary graphs. Inf. Comput. 292: 105035 (2023) - [i3]Carole Delporte, Hugues Fauconnier, Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers:
The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers. CoRR abs/2309.13977 (2023) - 2022
- [j19]Borzoo Bonakdarpour, Pierre Fraigniaud, Sergio Rajsbaum, David A. Rosenblueth, Corentin Travers:
Decentralized Asynchronous Crash-resilient Runtime Verification. J. ACM 69(5): 34:1-34:31 (2022) - [j18]Zohir Bouzid, Pierre Sutra, Corentin Travers:
Agreeing within a few writes. Theor. Comput. Sci. 922: 283-299 (2022) - 2021
- [j17]Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers:
A topological perspective on distributed network algorithms. Theor. Comput. Sci. 849: 121-137 (2021) - [c48]Danny Hendler, Adnane Khattabi, Alessia Milani, Corentin Travers:
Upper and Lower Bounds for Deterministic Approximate Objects. ICDCS 2021: 438-448 - [i2]Danny Hendler, Adnane Khattabi, Alessia Milani, Corentin Travers:
Upper and Lower Bounds for Deterministic Approximate Objects. CoRR abs/2104.09902 (2021) - 2020
- [j16]Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers, Petr Kuznetsov, Thibault Rieutord:
Perfect failure detection with very few bits. Inf. Comput. 275: 104604 (2020) - [j15]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): 141-179 (2020) - [c47]Olivier Beaumont, Tobias Castanet, Nicolas Hanusse, Corentin Travers:
Approximation Algorithm for Estimating Distances in Distributed Virtual Environments. Euro-Par 2020: 359-375 - [c46]Mirza Ahad Baig, Danny Hendler, Alessia Milani, Corentin Travers:
Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity. PODC 2020: 31-40
2010 – 2019
- 2019
- [c45]Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers:
A Topological Perspective on Distributed Network Algorithms. SIROCCO 2019: 3-18 - [c44]Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers:
Synchronous t-Resilient Consensus in Arbitrary Graphs. SSS 2019: 53-68 - [c43]Mirza Ahad Baig, Danny Hendler, Alessia Milani, Corentin Travers:
Long-Lived Counters with Polylogarithmic Amortized Step Complexity. DISC 2019: 3:1-3:16 - [i1]Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers:
A Topological Perspective on Distributed Network Algorithms. CoRR abs/1907.03565 (2019) - 2016
- [j14]Faith Ellen, Panagiota Fatourou, Eleftherios Kosmas, Alessia Milani, Corentin Travers:
Universal constructions that ensure disjoint-access parallelism and wait-freedom. Distributed Comput. 29(4): 251-277 (2016) - [c42]Borzoo Bonakdarpour, Pierre Fraigniaud, Sergio Rajsbaum, David A. Rosenblueth, Corentin Travers:
Decentralized Asynchronous Crash-Resilient Runtime Verification. CONCUR 2016: 16:1-16:15 - [c41]Borzoo Bonakdarpour, Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers:
Challenges in Fault-Tolerant Distributed Runtime Verification. ISoLA (2) 2016: 363-370 - [c40]Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers:
Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings. LATIN 2016: 497-508 - [c39]Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers, Petr Kuznetsov, Thibault Rieutord:
Perfect Failure Detection with Very Few Bits. SSS 2016: 154-169 - [c38]Zohir Bouzid, Corentin Travers:
Anonymity-Preserving Failure Detectors. DISC 2016: 173-186 - 2015
- [c37]David Bonnin, Corentin Travers:
Splitting and Renaming with a Majority of Faulty Processes. ICDCN 2015: 26:1-26:10 - 2014
- [c36]Pierre Fraigniaud, Sergio Rajsbaum, Matthieu Roy, Corentin Travers:
The Opinion Number of Set-Agreement. OPODIS 2014: 155-170 - [c35]Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers:
On the Number of Opinions Needed for Fault-Tolerant Run-Time Monitoring in Distributed Systems. RV 2014: 92-107 - 2013
- [j13]Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers:
Locality and checkability in wait-free computing. Distributed Comput. 26(4): 223-242 (2013) - [c34]Zohir Bouzid, Corentin Travers:
Parallel Consensus is Harder than Set Agreement in Message Passing. ICDCS 2013: 611-620 - [c33]David Bonnin, Corentin Travers:
α-Register. OPODIS 2013: 53-67 - 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 Comput. 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
2000 – 2009
- 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 Comput. 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
- [b1]Corentin Travers:
Derrière le consensus : coordination faiblement contrainte dans les systèmes distribués asynchrones. (Beyond consensus : weak coordination in asynchronous distributed systems). University of Rennes 1, France, 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 Distributed 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 Process. Lett. 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 Distributed 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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-19 20:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
