The following pages link to Corentin Travers (Q324627):
Displaying 39 items.
- Generating fast indulgent algorithms (Q693079) (← links)
- From \(\diamond \mathcal W\) to \(\omega\) : A simple bounded quiescent reliable broadcast-based transformation (Q868046) (← links)
- An impossibility about failure detectors in the iterated immediate snapshot model (Q975436) (← links)
- Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures (Q987393) (← links)
- From adaptive renaming to set agreement (Q1008730) (← links)
- Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound (Q1041222) (← links)
- Anonymity-preserving failure detectors (Q1660933) (← links)
- A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring (Q2304020) (← links)
- The \(k\)-simultaneous consensus problem (Q2377137) (← links)
- On the computability power and the robustness of set agreement-oriented failure detector classes (Q2377255) (← links)
- Of choices, failures and asynchrony: the many faces of set agreement (Q2428676) (← links)
- Locality and checkability in wait-free computing (Q2441537) (← links)
- Agreeing within a few writes (Q2672593) (← links)
- Long-lived counters with polylogarithmic amortized step complexity (Q2689836) (← links)
- Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings (Q2802963) (← links)
- Locality and Checkability in Wait-Free Computing (Q3095336) (← links)
- The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement (Q3395045) (← links)
- The Iterated Restricted Immediate Snapshot Model (Q3511360) (← links)
- Exploring Gafni’s Reduction Land: From Ω k to Wait-Free Adaptive $(2p-\lceil\frac{p}{k}\rceil)$ -Renaming Via k-Set Agreement (Q3524290) (← links)
- The Committee Decision Problem (Q3525785) (← links)
- How to Solve Consensus in the Smallest Window of Synchrony (Q3540219) (← links)
- Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures (Q3613651) (← links)
- Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement (Q3652281) (← links)
- (Q4608668) (← links)
- Irreducibility and additivity of set agreement-oriented failure detector classes (Q5177276) (← links)
- Failure detectors are schedulers (Q5401427) (← links)
- From Renaming to Set Agreement (Q5425961) (← links)
- Narrowing Power vs. Efficiency in Synchronous Set Agreement (Q5445741) (← links)
- Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity (Q5855203) (← links)
- Decentralized Asynchronous Crash-resilient Runtime Verification (Q5889779) (← links)
- Universal constructions that ensure disjoint-access parallelism and wait-freedom (Q5890930) (← links)
- Universal constructions that ensure disjoint-access parallelism and wait-freedom (Q5891977) (← links)
- Perfect failure detection with very few bits (Q5918191) (← links)
- A topological perspective on distributed network algorithms (Q5919043) (← links)
- Perfect failure detection with very few bits (Q5919048) (← links)
- A topological perspective on distributed network algorithms (Q5919482) (← links)
- Synchronous \(t\)-resilient consensus in arbitrary graphs (Q6044459) (← links)
- Long-lived counters with polylogarithmic amortized step complexity (Q6487520) (← links)
- Synchronous \(t\)-resilient consensus in arbitrary graphs (Q6536327) (← links)
