Publications

• Decentralized Asynchronous Crash-resilient Runtime Verification
  Borzoo Bonakdarpour, Pierre Fraigniaud, Sergio Rajsbaum, David A. Rosenblueth, Corentin Travers
  Journal of the ACM 69(5): 34:1-34:31, 2022.
• Agreeing Within a Few Writes
  Zohir Bouzid, Pierre Sutra, Corentin Travers.
  Theor. Comput. Sci. 922: 283-299 (2022)
• Upper and Lower Bounds for Deterministic Approximate Objects
  Danny Hendler, Adnane Khattabi, Alessia Milani, Corentin Travers.
  In 41st IEEE International Conference on Distributed Computing Systems, (ICDCS), 2021.
• Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity.
  Mirza Ahad Baig, Danny Hendler, Alessia Milani, Corentin Travers.
  In Symposium on Principles of Distributed Computing (PODC) 2020.
• Approximation Algorithm for Estimating Distances in Distributed Virtual Environments
  Olivier Beaumont, Tobias Castanet, Nicolas Hanusse, Corentin Travers.
  In Euro-Par, 2020.
• A Topological Perspective on Distributed Network Algorithms.
  A. Castañeda, P. Fraigniaud, A. Paz, S. Rajsbaum, M. Roy, C. Travers.
  In 26th International Colloquium on Structural Information and Communication Complexity (Sirocco), 2019.
• Long-Lived Counters with Polylogarithmic Amortized Step Complexity.
  Mirza Ahad Baig, Danny Hendler, Alessia Milani, Corentin Travers.
  In 33rd International Symposium on Distributed Computing (DISC), 2019. long version
• Synchronous t-Resilient Consensus in Arbitrary Graphs.
  Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy and Corentin Travers.
  In 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2019.
  Best paper award journal version
• Challenges in Fault-tolerant Distributed Runtime Verification
  B. Bonakdarpour, P. Fraigniaud, S. Rajsbaum, and Corentin Travers
  In International Symposium On Leveraging Applications of Formal Methods, Verification and Validation (ISoLA), 2016.
• Decentralized Asynchronous Crash-Resilient Runtime Verification.
  B. Bonakdarpour, P. Fraigniaud, S. Rajsbaum, D. Rosenblueth, and C. Travers
  In 27th International Conference on Concurrency Theory (CONCUR), 2016.
• Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings.
  P. Fraigniaud, S. Rajsbaum, and C. Travers
  In 12th Latin American Symposium on Theoretical Informatics (LATIN), 2016.
• Perfect Failure Detection with Very Few Bits
  P. Fraigniaud, S. Rajsbaum, C. Travers, P. Kuznetsov and F. Rieutord
  In 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2016. long version.
  
• Splitting and Renaming with a Majority of Faulty Processes
  D. Bonnin and C. Travers.
  In 18th International Conference On Principles Of Distributed Systems (ICDCN), 2015.
  
• The Opinion Number of Set-Agreement
  P. Fraigniaud, S. Rajsbaum , M. Roy , and C. Travers.
  In 18th International Conference On Principles Of Distributed Systems (OPODIS), 2014.
  
• On the Number of Opinions Needed for Fault-Tolerant Run-Time Monitoring in Distributed Systems.
  P. Fraigniaud, S. Rajsbaum , and C. Travers.
  14th International Conference on Runtime Verification (RV), 2014. long version.
  
• α-register
  D. Bonnin, and C. Travers.
  In 17th International Conference On Principles Of Distributed Systems (OPODIS), 2013. long version.
  
• Parallel Consensus is Harder than Set Agreement in Message Passing
  Z. Bouzid, and C. Travers.
  33rd International Conference on Distributed Computing Systems (ICDCS), 2013. long version.
  
• Universal Constructions that Ensure Disjoint-Access Parallelism and Wait-Freedom.
  F. Ellen, P. Fatourou, E. Kosmas, A. Milani and C. Travers.
  31st Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2012. long version.
  
• Early Deciding Synchronous Renaming in O(log f ) Rounds or Less.
  D. Alistarh, H. Attiya, R. Guerraoui, and C. Travers.
  19th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2012. long version.
  
• Anonymous Agreement: the Janus Algorithm.
  Z. Bouzid, P. Sutra , and C. Travers.
  In 15th International Conference On Principles Of Distributed Systems (OPODIS), 2011. long version.
  
• Locality and Checkability in Wait-free Computing.
  P. Fraigniaud, S. Rajsbaum , and C. Travers.
  25th International Symposium on DIStributed Computing (DISC), 2011.
  Best paper award
• Generating Fast Indulgent Algorithms.
  D. Alistarh, S. Gilbert, R. Guerraoui, and C. Travers.
  In 12th International Conference on Distributed Computing and Networkingin (ICDCN), 2011.
  Best paper award
• (Ω^x * Σ_z)_based k-set Agreement Algorithms.
  Z. Bouzid and C. Travers.
  In 14th International Conference On Principles Of Distributed Systems (OPODIS), 2010. long version.
• The k-Simultaneous Consensus Problem.
  Y. Afek, E. Gafni , S. Rajsbaum , M. Raynal and C. Travers.
  Distributed Computing.
• Narrowing Power vs. Efficiency in Synchronous Set Agreement: Relationships, Algorithms and Lower Bounds.
  A. Mostefaoui, M. Raynal and C. Travers.
  Theoretical Computer Science, volume 411(1): 58-69, 2010.
• Of Choices, Failures and Asynchrony: The Many Faces of Set-agreement.
  D. Alistarh, S. Gilbert, R. Guerraoui, and C. Travers.
  In 20th International Symposium on Algorithms and Computation (ISAAC), 2009.
• Brief Announcement: Weakest Failure Detectors via an Egg-laying Simulation.
  A. Fernandez Anta , S. Rajsbaum , and C. Travers.
  In 28th Symposium on Principles of Distributed Computing, (PODC), 2009. Technical Report.
• From Adaptive Renaming to Set-Agreement.
  E. Gafni , A. Mostefaoui, M. Raynal and C. Travers.
  Theoretical Computer Science, volume 410(14): 1328-1335, 2009.
• Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures.
  P. Raipin Parvédy, M. Raynal and C. Travers.
  Theory of Computing Systems. 2009.
• How to Solve Consensus in the Smallest Window of Synchrony.
  D. Alistarh, S. Gilbert, R. Guerraoui and C. Travers.
  In 22nd International Symposium on Distributed Computing (DISC), 2008.
• The Iterated Restricted Immediate Snapshot Model.
  S. Rajsbaum , M. Raynal and C. Travers.
  In 14th Annual International Conference on Computing and Combinatorics (COCOON), 2008.
• Narrowing Power vs. Efficiency in Synchronous Set Agreement.
  A. Mostefaoui, M. Raynal and C. Travers.
  In 9th International Conference Distributed Computing and Networking (ICDCN), 2008.
• The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement.
  A. Mostefaoui, S. Rajsbaum , M. Raynal and C. Travers.
  SIAM Journal of Computing 38(4): 1574-1601, 2008.
• On the Computability Power and the Robustness of Set Agreement-oriented Failure Detector Classes.
  A. Mostefaoui, S. Rajsbaum , M. Raynal and C. Travers.
  Distributed Computing 21(3): 201-222, 2008.
• An Impossibility about Failure Detectors in the Iterated Immediate Snapshot Model.
  S. Rajsbaum , M. Raynal and C. Travers.
  Information Processing Letters, 108(3): 160-164, 2008.
• The Eventual Leadership in Dynamic Mobile Networking Environments.
  Jiannong Cao , M. Raynal, C. Travers and W. Wu.
  In 13th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC), 2007.
• Test & Set, Adaptive Renaming and Set Agreement: a Guided Visit to Asynchronous Computability.
  E. Gafni , M. Raynal and C. Travers.
  In 26th IEEE Symposium on Reliable Distributed Systems (SRDS), 2007.
• From Renaming to Set Agreement.
  A. Mostefaoui, M. Raynal and C. Travers.
  In 14th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2007.
• From <>W to Omega: A Simple Bounded Quiescent Reliable Broadcast-based Transformation.
  A. Mostefaoui, S. Rajsbaum , M. Raynal and C. Travers.
  Journal Parallel and Distributed Computing, 67(1): 125-129, 2007.
• The Committee Decision Problem.
  E. Gafni , S. Rajsbaum , M. Raynal and C. Travers.
  In 7th Latin American Symposium on Theoretical Informatics (LATIN), 2006.
• Irreducibility and Additivity of Set Agreement-oriented Failure Detector Classes.
  A. Mostefaoui, S. Rajsbaum , M. Raynal and C. Travers.
  In 25th ACM Symposium on Principles of Distributed Computing (PODC), 2006.
• Exploring Gafni's Reduction Land: From Omega(k) to Wait-Free Adaptive (2p-[p/k])-Renaming Via k-Set Agreement.
  A. Mostefaoui, M. Raynal and C. Travers.
  In 20th International Symposium on Distributed Computing (DISC), 2006.
• Strongly Terminating Early-Stopping k-Set Agreement in Synchronous Systems with General Omission Failures.
  Philippe Raipin Parvédy, M. Raynal and C. Travers.
  In 13th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2006.
• In Search of the Holy Grail: Looking for the Weakest Failure Detector for Wait-Free Set Agreement.
  M. Raynal and C. Travers.
  Invited paper in 10th International Conference on Principles of Distributed Systems (OPODIS), 2006.
• Synchronous Set Agreement: a Concise Guided Tour (including a new algorithm and a list of open problems).
  M. Raynal and C. Travers.
  In 12th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC), 2006.
• Simultaneous Consensus Tasks: A Tighter Characterization of Set-Consensus.
  Y. Afek, E. Gafni , S. Rajsbaum , M. Raynal and C. Travers.
  In 8th International Conference on Distributed Computing and Networking (ICDCN), 2006.
• A Time-free Assumption to Implement Eventual Leadership.
  A. Mostefaoui, E. Mourgaya, M. Raynal and C. Travers.
  Parallel Processing Letters, 16(2): 189-208, 2006.
• Time-Free and Timer-Based Assumptions Can Be Combined to Obtain Eventual Leadership.
  A. Mostefaoui, M. Raynal and C. Travers.
  IEEE Transactions on Parallel and Distributed Systems, 17(7): 656-666, 2006.
• Two Abstractions for Implementing Atomic Objects in Dynamic Systems.
  Roy Friedman, M. Raynal and C. Travers.
  In 9th International Conference on Principles of Distributed Systems (OPODIS), 2005.
• From Static Distributed Systems to Dynamic Systems.
  A. Mostefaoui, M. Raynal, C. Travers, S. Patterson, D. Agrawal and A. El Abbadi.
  In 24th IEEE Symposium on Reliable Distributed Systems (SRDS), 2005.
• Decision Optimal Early-Stopping k-set Agreement in Synchronous Systems Prone to Send Omission Failures.
  P. Raipin Parvédy, M. Raynal and C. Travers.
  In 11th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC), 2005.
• Crash-Resilient Time-Free Eventual Leadership.
  A. Mostefaoui, M. Raynal and C. Travers.
  In 23rd International Symposium on Reliable Distributed Systems (SRDS), 2004.