Corentin Travers

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Synchronous $t$-resilient consensus in arbitrary graphs	2024-04-19	Paper
Synchronous $t$-resilient consensus in arbitrary graphs Information and Computation	2023-05-19	Paper
Decentralized Asynchronous Crash-resilient Runtime Verification Journal of the ACM	2023-04-27	Paper
Long-lived counters with polylogarithmic amortized step complexity Distributed Computing	2023-03-14	Paper
Long-lived counters with polylogarithmic amortized step complexity	2023-02-03	Paper
Agreeing within a few writes Theoretical Computer Science	2022-06-13	Paper
Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity Proceedings of the 39th Symposium on Principles of Distributed Computing	2021-03-15	Paper
A topological perspective on distributed network algorithms Theoretical Computer Science	2020-12-15	Paper
Perfect failure detection with very few bits Information and Computation	2020-12-15	Paper
A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring Journal of Applied and Computational Topology	2020-03-06	Paper
A topological perspective on distributed network algorithms Structural Information and Communication Complexity	2020-03-03	Paper
Perfect failure detection with very few bits Lecture Notes in Computer Science	2019-11-22	Paper
Anonymity-preserving failure detectors	2018-08-16	Paper
Decentralized asynchronous crash-resilient runtime verification	2018-03-21	Paper
Universal constructions that ensure disjoint-access parallelism and wait-freedom Distributed Computing	2016-10-17	Paper
Minimizing the number of opinions for fault-tolerant distributed decision using well-quasi orderings LATIN 2016: Theoretical Informatics	2016-05-03	Paper
Irreducibility and additivity of set agreement-oriented failure detector classes Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing	2015-03-10	Paper
Universal constructions that ensure disjoint-access parallelism and wait-freedom Proceedings of the 2012 ACM symposium on Principles of distributed computing	2014-12-05	Paper
Locality and checkability in wait-free computing Distributed Computing	2014-03-25	Paper
Failure detectors are schedulers Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing	2014-03-13	Paper
The $k$-simultaneous consensus problem Distributed Computing	2013-06-28	Paper
On the computability power and the robustness of set agreement-oriented failure detector classes Distributed Computing	2013-06-28	Paper
Generating fast indulgent algorithms Theory of Computing Systems	2012-12-07	Paper
Of choices, failures and asynchrony: the many faces of set agreement Algorithmica	2012-04-26	Paper
Locality and checkability in wait-free computing Lecture Notes in Computer Science	2011-10-28	Paper
Strongly terminating early-stopping $k$-set agreement in synchronous systems with general omission failures Theory of Computing Systems	2010-08-13	Paper
An impossibility about failure detectors in the iterated immediate snapshot model Information Processing Letters	2010-06-09	Paper
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement Algorithms and Computation	2009-12-17	Paper
Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound Theoretical Computer Science	2009-12-01	Paper
The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement SIAM Journal on Computing	2009-08-20	Paper
From adaptive renaming to set agreement Theoretical Computer Science	2009-03-30	Paper
Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures Structural Information and Communication Complexity	2009-03-12	Paper
How to Solve Consensus in the Smallest Window of Synchrony Lecture Notes in Computer Science	2008-11-20	Paper
The Committee Decision Problem LATIN 2006: Theoretical Informatics	2008-09-18	Paper
Exploring Gafni’s Reduction Land: From Ω k to Wait-Free Adaptive $(2p-\lceil\frac{p}{k}\rceil)$ -Renaming Via k-Set Agreement Lecture Notes in Computer Science	2008-09-09	Paper
The Iterated Restricted Immediate Snapshot Model Lecture Notes in Computer Science	2008-07-10	Paper
Narrowing Power vs. Efficiency in Synchronous Set Agreement Distributed Computing and Networking	2008-03-06	Paper
From Renaming to Set Agreement Structural Information and Communication Complexity	2007-11-15	Paper
From $\diamond \mathcal W$ to $\omega$ : A simple bounded quiescent reliable broadcast-based transformation Journal of Parallel and Distributed Computing	2007-02-19	Paper

Research outcomes over time

This page was built for person: Corentin Travers

Publication	Date of Publication	Type
Synchronous \(t\)-resilient consensus in arbitrary graphs	2024-04-19	Paper
Synchronous \(t\)-resilient consensus in arbitrary graphs Information and Computation	2023-05-19	Paper
Decentralized Asynchronous Crash-resilient Runtime Verification Journal of the ACM	2023-04-27	Paper
Long-lived counters with polylogarithmic amortized step complexity Distributed Computing	2023-03-14	Paper
Long-lived counters with polylogarithmic amortized step complexity	2023-02-03	Paper
Agreeing within a few writes Theoretical Computer Science	2022-06-13	Paper
Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity Proceedings of the 39th Symposium on Principles of Distributed Computing	2021-03-15	Paper
A topological perspective on distributed network algorithms Theoretical Computer Science	2020-12-15	Paper
Perfect failure detection with very few bits Information and Computation	2020-12-15	Paper
A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring Journal of Applied and Computational Topology	2020-03-06	Paper
A topological perspective on distributed network algorithms Structural Information and Communication Complexity	2020-03-03	Paper
Perfect failure detection with very few bits Lecture Notes in Computer Science	2019-11-22	Paper
Anonymity-preserving failure detectors	2018-08-16	Paper
Decentralized asynchronous crash-resilient runtime verification	2018-03-21	Paper
Universal constructions that ensure disjoint-access parallelism and wait-freedom Distributed Computing	2016-10-17	Paper
Minimizing the number of opinions for fault-tolerant distributed decision using well-quasi orderings LATIN 2016: Theoretical Informatics	2016-05-03	Paper
Irreducibility and additivity of set agreement-oriented failure detector classes Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing	2015-03-10	Paper
Universal constructions that ensure disjoint-access parallelism and wait-freedom Proceedings of the 2012 ACM symposium on Principles of distributed computing	2014-12-05	Paper
Locality and checkability in wait-free computing Distributed Computing	2014-03-25	Paper
Failure detectors are schedulers Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing	2014-03-13	Paper
The \(k\)-simultaneous consensus problem Distributed Computing	2013-06-28	Paper
On the computability power and the robustness of set agreement-oriented failure detector classes Distributed Computing	2013-06-28	Paper
Generating fast indulgent algorithms Theory of Computing Systems	2012-12-07	Paper
Of choices, failures and asynchrony: the many faces of set agreement Algorithmica	2012-04-26	Paper
Locality and checkability in wait-free computing Lecture Notes in Computer Science	2011-10-28	Paper
Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures Theory of Computing Systems	2010-08-13	Paper
An impossibility about failure detectors in the iterated immediate snapshot model Information Processing Letters	2010-06-09	Paper
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement Algorithms and Computation	2009-12-17	Paper
Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound Theoretical Computer Science	2009-12-01	Paper
The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement SIAM Journal on Computing	2009-08-20	Paper
From adaptive renaming to set agreement Theoretical Computer Science	2009-03-30	Paper
Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures Structural Information and Communication Complexity	2009-03-12	Paper
How to Solve Consensus in the Smallest Window of Synchrony Lecture Notes in Computer Science	2008-11-20	Paper
The Committee Decision Problem LATIN 2006: Theoretical Informatics	2008-09-18	Paper
Exploring Gafni’s Reduction Land: From Ω k to Wait-Free Adaptive $(2p-\lceil\frac{p}{k}\rceil)$ -Renaming Via k-Set Agreement Lecture Notes in Computer Science	2008-09-09	Paper
The Iterated Restricted Immediate Snapshot Model Lecture Notes in Computer Science	2008-07-10	Paper
Narrowing Power vs. Efficiency in Synchronous Set Agreement Distributed Computing and Networking	2008-03-06	Paper
From Renaming to Set Agreement Structural Information and Communication Complexity	2007-11-15	Paper
From \(\diamond \mathcal W\) to \(\omega\) : A simple bounded quiescent reliable broadcast-based transformation Journal of Parallel and Distributed Computing	2007-02-19	Paper