Corentin Travers

80 papers A* 8A 10B 20C 5Misc 5Journal 27Unranked 4

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