Measure of Parallelism of Distributed Computations. - Bernadette Charron-Bost (STACS, 1989)

Combinatorics and Geometry of Consistent Cuts: Application to Concurrency Theory. - Bernadette Charron-Bost (WDAG, 1989)

Concerning the Size of Clocks. - Bernadette Charron-Bost (Semantics of Systems of Concurrent Processes, 1990)

Concerning the Size of Logical Clocks in Distributed Systems. - Bernadette Charron-Bost (Inf. Process. Lett., 1991)

Coupling Coefficients of a Distributed Execution. - Bernadette Charron-Bost (Theor. Comput. Sci., 1993)

Local and Temporal Predicates In Distributed Systems. - Bernadette Charron-Bost; Carole Delporte-Gallet; Hugues Fauconnier (ACM Trans. Program. Lang. Syst., 1995)

Crash Failures vs. Crash + Link Failures (Abstract). - Anindya Basu; Bernadette Charron-Bost; Sam Toueg (PODC, 1996)

On the Impossibility of Group Membership. - Tushar Deepak Chandra; Vassos Hadzilacos; Sam Toueg; Bernadette Charron-Bost (PODC, 1996)

Simulating Reliable Links with Unreliable Links in the Presence of Process Crashes. - Anindya Basu; Bernadette Charron-Bost; Sam Toueg (WDAG, 1996)

Synchronous, Asynchronous, and Causally Ordered Communication. - Bernadette Charron-Bost; Friedemann Mattern; Gerard Tel (Distributed Comput., 1996)

Introduction à l'algorithmique des objets partagés. - Bernadette Charron-Bost; Robert Cori; Antoine Petit 001 (RAIRO Theor. Informatics Appl., 1997)

Calculs approchés de la borne inférieure de valeurs réparties. - Bernadette Charron-Bost; Gerard Tel (RAIRO Theor. Informatics Appl., 1997)

Revisiting Safety and Liveness in the Context of Failures. - Bernadette Charron-Bost; Sam Toueg; Anindya Basu (CONCUR, 2000)

Synchronous System and Perfect Failure Detector: Solvability and Efficiency Issue. - Bernadette Charron-Bost; Rachid Guerraoui; André Schiper (DSN, 2000)

Agreement Problems in Fault-Tolerant Distributed Systems. - Bernadette Charron-Bost (SOFSEM, 2001)

Time vs. Space in Fault-Tolerant Distributed Systems. - Bernadette Charron-Bost; Xavier Défago; André Schiper (WORDS, 2001)

Broadcasting Messages in Fault-Tolerant Distributed Systems: The Benefit of Handling Input-Triggered and Output-Triggered Suspicions Differently. - Bernadette Charron-Bost; Xavier Défago; André Schiper (SRDS, 2002)

Comparing the Atomic Commitment and Consensus Problems. - Bernadette Charron-Bost (Future Directions in Distributed Computing, 2003)

A Note on Linearizability and the Global Time Axiom. - Bernadette Charron-Bost; Robert Cori (Parallel Process. Lett., 2003)

Validity Conditions in Agreement Problems and Time Complexity. - Bernadette Charron-Bost; Fabrice Le Fessant (SOFSEM, 2004)

Reductions in Distributed Computing Part I: Consensus and Atomic Commitment Tasks - Bernadette Charron-Bost (CoRR, 2004)

Reductions in Distributed Computing Part II: k-Threshold Agreement Tasks - Bernadette Charron-Bost (CoRR, 2004)

Uniform consensus is harder than consensus. - Bernadette Charron-Bost; André Schiper (J. Algorithms, 2004)

Improving Fast Paxos: being optimistic with no overhead. - Bernadette Charron-Bost; André Schiper (PRDC, 2006)

Tolerating corrupted communication. - Martin Biely; Josef Widder; Bernadette Charron-Bost; Antoine Gaillard; Martin Hutle; André Schiper (PODC, 2007)

Harmful dogmas in fault tolerant distributed computing. - Bernadette Charron-Bost; André Schiper (SIGACT News, 2007)

08371 Abstracts Collection - Fault-Tolerant Distributed Algorithms on VLSI Chips. - Bernadette Charron-Bost; Shlomi Dolev; Jo C. Ebergen; Ulrich Schmid 001 (Fault-Tolerant Distributed Algorithms on VLSI Chips, 2008)

08371 Summary - Fault-Tolerant Distributed Algorithms on VLSI Chips. - Bernadette Charron-Bost; Shlomi Dolev; Jo C. Ebergen; Ulrich Schmid 001 (Fault-Tolerant Distributed Algorithms on VLSI Chips, 2008)

Consensus with Partial Synchrony. - Bernadette Charron-Bost; André Schiper (Encyclopedia of Algorithms, 2008)

Link Reversal: How to Play Better to Work Less. - Bernadette Charron-Bost; Jennifer L. Welch; Josef Widder (ALGOSENSORS, 2009)

A Reduction Theorem for the Verification of Round-Based Distributed Algorithms. - Mouna Chaouch-Saad; Bernadette Charron-Bost; Stephan Merz (RP, 2009)

Routing without ordering. - Bernadette Charron-Bost; Antoine Gaillard; Jennifer L. Welch; Josef Widder (SPAA, 2009)

The Heard-Of model: computing in distributed systems with benign faults. - Bernadette Charron-Bost; André Schiper (Distributed Comput., 2009)

Formal Verification of a Consensus Algorithm in the Heard-Of Model. - Bernadette Charron-Bost; Stephan Merz (Int. J. Softw. Informatics, 2009)

In search of lost time. - Bernadette Charron-Bost; Martin Hutle; Josef Widder (Inf. Process. Lett., 2010)

Full Reversal Routing as a Linear Dynamical System. - Bernadette Charron-Bost; Matthias Függer; Jennifer L. Welch; Josef Widder (SIROCCO, 2011)

Partial is Full. - Bernadette Charron-Bost; Matthias Függer; Jennifer L. Welch; Josef Widder (SIROCCO, 2011)

Brief announcement: full reversal routing as a linear dynamical system. - Bernadette Charron-Bost; Matthias Függer; Jennifer L. Welch; Josef Widder (SPAA, 2011)

Formal Verification of Consensus Algorithms Tolerating Malicious Faults. - Bernadette Charron-Bost; Henri Debrat; Stephan Merz (SSS, 2011)

On the Transience of Linear Max-Plus Dynamical Systems - Bernadette Charron-Bost; Matthias Függer; Thomas Nowak (CoRR, 2011)

New Transience Bounds for Long Walks - Bernadette Charron-Bost; Matthias Függer; Thomas Nowak (CoRR, 2012)

Transience Bounds for Distributed Algorithms. - Bernadette Charron-Bost; Matthias Függer; Thomas Nowak (FORMATS, 2013)

Orientation and Connectivity Based Criteria for Asymptotic Consensus - Bernadette Charron-Bost (CoRR, 2013)

Formal Verification of Distributed Algorithms (Dagstuhl Seminar 13141). - Bernadette Charron-Bost; Stephan Merz; Andrey Rybalchenko; Josef Widder (Dagstuhl Reports, 2013)

Link Reversal Routing with Binary Link Labels: Work Complexity. - Bernadette Charron-Bost; Antoine Gaillard; Jennifer L. Welch; Josef Widder (SIAM J. Comput., 2013)

Approximate Consensus in Highly Dynamic Networks. - Bernadette Charron-Bost; Matthias Függer; Thomas Nowak (CoRR, 2014)

An Overview of Transience Bounds in Max-Plus Algebra. - Thomas Nowak; Bernadette Charron-Bost (CoRR, 2014)

Diffusive clock synchronization in highly dynamic networks. - Matthias Függer; Thomas Nowak; Bernadette Charron-Bost (CISS, 2015)

Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms. - Bernadette Charron-Bost; Matthias Függer; Thomas Nowak (ICALP (2), 2015)

A Proof of the Convergence of the Hegselmann-Krause Dynamics on the Circle. - Bernadette Charron-Bost; Matthias Függer; Thomas Nowak (CoRR, 2015)

Amortized Averaging Algorithms for Approximate Consensus. - Bernadette Charron-Bost; Matthias Függer; Thomas Nowak (CoRR, 2015)

Time Complexity of Link Reversal Routing. - Bernadette Charron-Bost; Matthias Függer; Jennifer L. Welch; Josef Widder (ACM Trans. Algorithms, 2015)

Fast, Robust, Quantizable Approximate Consensus. - Bernadette Charron-Bost; Matthias Függer; Thomas Nowak (ICALP, 2016)

Multidimensional Asymptotic Consensus in Dynamic Networks. - Bernadette Charron-Bost; Matthias Függer; Thomas Nowak (CoRR, 2016)

Consensus with Partial Synchrony. - Bernadette Charron-Bost; André Schiper (Encyclopedia of Algorithms, 2016)

Synchronization in Dynamic Networks. - Bernadette Charron-Bost; Shlomo Moran (CoRR, 2017)

New transience bounds for max-plus linear systems. - Bernadette Charron-Bost; Matthias Függer; Thomas Nowak (Discret. Appl. Math., 2017)

Randomization and Quantization for Average Consensus. - Bernadette Charron-Bost; Patrick Lambein-Monette (CDC, 2018)

The firing squad problem revisited. - Bernadette Charron-Bost; Shlomo Moran (Theor. Comput. Sci., 2019)

Average Consensus: A Little Learning Goes A Long Way. - Bernadette Charron-Bost; Patrick Lambein-Monette (CoRR, 2020)

Synchronization Modulo k in Dynamic Networks. - Louis Penet de Monterno; Bernadette Charron-Bost; Stephan Merz (SSS, 2021)

MinMax algorithms for stabilizing consensus. - Bernadette Charron-Bost; Shlomo Moran (Distributed Comput., 2021)

Self-Stabilizing Clock Synchronization in Dynamic Networks. - Bernadette Charron-Bost; Louis Penet de Monterno (OPODIS, 2022)

Computing Outside the Box: Average Consensus over Dynamic Networks. - Bernadette Charron-Bost; Patrick Lambein-Monette (SAND, 2022)

Geometric bounds for convergence rates of averaging algorithms. - Bernadette Charron-Bost (Inf. Comput., 2022)

Self-Stabilizing Clock Synchronization in Probabilistic Networks. - Bernadette Charron-Bost; Louis Penet de Monterno (DISC, 2023)

Know your audience. - Bernadette Charron-Bost; Patrick Lambein-Monette (CoRR, 2023)

Synchronization modulo P in dynamic networks. - Louis Penet de Monterno; Bernadette Charron-Bost; Stephan Merz (Theor. Comput. Sci., 2023)

Brief Announcement: Know Your Audience: Communication model and computability in anonymous networks. - Bernadette Charron-Bost; Patrick Lambein-Monette (PODC, 2024)

Clock Synchronization Is Almost Impossible with Bounded Memory. - Bernadette Charron-Bost; Louis Penet de Monterno (CoRR, 2024)