default search action
Bernadette Charron-Bost
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c33]Bernadette Charron-Bost
, Patrick Lambein-Monette
Brief Announcement: Know Your Audience: Communication model and computability in anonymous networks. PODC 2024: 243-246 - 2023
- [j19]Louis Penet de Monterno, Bernadette Charron-Bost, Stephan Merz:
Synchronization modulo P in dynamic networks. Theor. Comput. Sci. 942: 200-212 (2023) - [c32]Bernadette Charron-Bost, Louis Penet de Monterno:
Self-Stabilizing Clock Synchronization in Probabilistic Networks. DISC 2023: 12:1-12:18 - [i20]Bernadette Charron-Bost, Patrick Lambein-Monette:
Know your audience. CoRR abs/2311.17728 (2023) - 2022
- [j18]Bernadette Charron-Bost:
Geometric bounds for convergence rates of averaging algorithms. Inf. Comput. 285(Part): 104909 (2022) - [c31]Bernadette Charron-Bost, Louis Penet de Monterno:
Self-Stabilizing Clock Synchronization in Dynamic Networks. OPODIS 2022: 28:1-28:17 - [c30]Bernadette Charron-Bost, Patrick Lambein-Monette:
Computing Outside the Box: Average Consensus over Dynamic Networks. SAND 2022: 10:1-10:16 - [i19]Bernadette Charron-Bost, Louis Penet de Monterno:
Self-Stabilizing Clock Synchronization in Dynamic Networks. CoRR abs/2207.06243 (2022) - 2021
- [j17]Bernadette Charron-Bost, Shlomo Moran
MinMax algorithms for stabilizing consensus. Distributed Comput. 34(3): 195-206 (2021) - [c29]Louis Penet de Monterno, Bernadette Charron-Bost, Stephan Merz:
Synchronization Modulo k in Dynamic Networks. SSS 2021: 425-439 - 2020
- [i18]Bernadette Charron-Bost:
Geometric Bounds for Convergence Rates of Averaging Algorithms. CoRR abs/2007.04837 (2020) - [i17]Bernadette Charron-Bost, Patrick Lambein-Monette:
Average Consensus: A Little Learning Goes A Long Way. CoRR abs/2010.05675 (2020)
2010 – 2019
- 2019
- [j16]Bernadette Charron-Bost, Shlomo Moran:
The firing squad problem revisited. Theor. Comput. Sci. 793: 100-112 (2019) - [i16]Bernadette Charron-Bost, Shlomo Moran:
MinMax Algorithms for Stabilizing Consensus. CoRR abs/1906.09073 (2019) - 2018
- [c28]Bernadette Charron-Bost, Patrick Lambein-Monette
Randomization and Quantization for Average Consensus. CDC 2018: 3716-3721 - [c27]Bernadette Charron-Bost, Shlomo Moran:
The Firing Squad Problem Revisited. STACS 2018: 20:1-20:14 - [i15]Bernadette Charron-Bost, Patrick Lambein-Monette:
Randomization and quantization for average consensus. CoRR abs/1804.10919 (2018) - 2017
- [j15]Bernadette Charron-Bost, Matthias Függer, Thomas Nowak
New transience bounds for max-plus linear systems. Discret. Appl. Math. 219: 83-99 (2017) - [i14]Bernadette Charron-Bost, Shlomo Moran:
Synchronization in Dynamic Networks. CoRR abs/1706.07831 (2017) - 2016
- [c26]Bernadette Charron-Bost, Matthias Függer, Thomas Nowak
Fast, Robust, Quantizable Approximate Consensus. ICALP 2016: 137:1-137:14 - [r2]Bernadette Charron-Bost, André Schiper:
Consensus with Partial Synchrony. Encyclopedia of Algorithms 2016: 436-441 - [i13]Bernadette Charron-Bost, Matthias Függer, Thomas Nowak:
Multidimensional Asymptotic Consensus in Dynamic Networks. CoRR abs/1611.02496 (2016) - 2015
- [j14]Bernadette Charron-Bost, Matthias Függer, Jennifer L. Welch, Josef Widder
Time Complexity of Link Reversal Routing. ACM Trans. Algorithms 11(3): 18:1-18:39 (2015) - [c25]Matthias Függer, Thomas Nowak
Diffusive clock synchronization in highly dynamic networks. CISS 2015: 1-6 - [c24]Bernadette Charron-Bost, Matthias Függer, Thomas Nowak
Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms. ICALP (2) 2015: 528-539 - [i12]Bernadette Charron-Bost, Matthias Függer, Thomas Nowak:
A Proof of the Convergence of the Hegselmann-Krause Dynamics on the Circle. CoRR abs/1504.05479 (2015) - [i11]Bernadette Charron-Bost, Matthias Függer, Thomas Nowak:
Amortized Averaging Algorithms for Approximate Consensus. CoRR abs/1512.04222 (2015) - 2014
- [i10]Thomas Nowak, Bernadette Charron-Bost:
An Overview of Transience Bounds in Max-Plus Algebra. CoRR abs/1405.3458 (2014) - [i9]Bernadette Charron-Bost, Matthias Függer, Thomas Nowak:
Approximate Consensus in Highly Dynamic Networks. CoRR abs/1408.0620 (2014) - 2013
- [j13]Bernadette Charron-Bost, Antoine Gaillard, Jennifer L. Welch, Josef Widder
Link Reversal Routing with Binary Link Labels: Work Complexity. SIAM J. Comput. 42(2): 634-661 (2013) - [c23]Bernadette Charron-Bost, Matthias Függer, Thomas Nowak
Transience Bounds for Distributed Algorithms. FORMATS 2013: 77-90 - [i8]Bernadette Charron-Bost:
Orientation and Connectivity Based Criteria for Asymptotic Consensus. CoRR abs/1303.2043 (2013) - [i7]Bernadette Charron-Bost, Stephan Merz, Andrey Rybalchenko, Josef Widder:
Formal Verification of Distributed Algorithms (Dagstuhl Seminar 13141). Dagstuhl Reports 3(4): 1-16 (2013) - 2012
- [i6]Bernadette Charron-Bost, Matthias Függer, Thomas Nowak:
New Transience Bounds for Long Walks. CoRR abs/1209.3342 (2012) - 2011
- [c22]Bernadette Charron-Bost, Matthias Függer, Jennifer L. Welch, Josef Widder
Full Reversal Routing as a Linear Dynamical System. SIROCCO 2011: 101-112 - [c21]Bernadette Charron-Bost, Matthias Függer, Jennifer L. Welch, Josef Widder
Partial is Full. SIROCCO 2011: 113-124 - [c20]Bernadette Charron-Bost, Matthias Függer, Jennifer L. Welch, Josef Widder
Brief announcement: full reversal routing as a linear dynamical system. SPAA 2011: 129-130 - [c19]Bernadette Charron-Bost, Henri Debrat, Stephan Merz:
Formal Verification of Consensus Algorithms Tolerating Malicious Faults. SSS 2011: 120-134 - [i5]Bernadette Charron-Bost, Matthias Függer, Thomas Nowak:
On the Transience of Linear Max-Plus Dynamical Systems. CoRR abs/1111.4600 (2011) - 2010
- [j12]Bernadette Charron-Bost, Martin Hutle, Josef Widder
In search of lost time. Inf. Process. Lett. 110(21): 928-933 (2010) - [e3]Bernadette Charron-Bost, Fernando Pedone
Replication: Theory and Practice. Lecture Notes in Computer Science 5959, Springer 2010, ISBN 978-3-642-11293-5 [contents]
2000 – 2009
- 2009
- [j11]Bernadette Charron-Bost, André Schiper:
The Heard-Of model: computing in distributed systems with benign faults. Distributed Comput. 22(1): 49-71 (2009) - [j10]Bernadette Charron-Bost, Stephan Merz:
Formal Verification of a Consensus Algorithm in the Heard-Of Model. Int. J. Softw. Informatics 3(2-3): 273-303 (2009) - [c18]Bernadette Charron-Bost, Jennifer L. Welch, Josef Widder
Link Reversal: How to Play Better to Work Less. ALGOSENSORS 2009: 88-101 - [c17]Mouna Chaouch-Saad, Bernadette Charron-Bost, Stephan Merz:
A Reduction Theorem for the Verification of Round-Based Distributed Algorithms. RP 2009: 93-106 - [c16]Bernadette Charron-Bost, Antoine Gaillard, Jennifer L. Welch, Josef Widder
Routing without ordering. SPAA 2009: 145-153 - 2008
- [e2]Bernadette Charron-Bost, Shlomi Dolev, Jo C. Ebergen, Ulrich Schmid:
Fault-Tolerant Distributed Algorithms on VLSI Chips, 07.09. - 10.09.2008. Dagstuhl Seminar Proceedings 08371, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2008 [contents] - [r1]Bernadette Charron-Bost, André Schiper:
Consensus with Partial Synchrony. Encyclopedia of Algorithms 2008 - [i4]Bernadette Charron-Bost, Shlomi Dolev, Jo C. Ebergen, Ulrich Schmid:
08371 Abstracts Collection - Fault-Tolerant Distributed Algorithms on VLSI Chips. Fault-Tolerant Distributed Algorithms on VLSI Chips 2008 - [i3]Bernadette Charron-Bost, Shlomi Dolev, Jo C. Ebergen, Ulrich Schmid:
08371 Summary - Fault-Tolerant Distributed Algorithms on VLSI Chips. Fault-Tolerant Distributed Algorithms on VLSI Chips 2008 - 2007
- [j9]Bernadette Charron-Bost, André Schiper:
Harmful dogmas in fault tolerant distributed computing. SIGACT News 38(1): 53-61 (2007) - [c15]Martin Biely
Tolerating corrupted communication. PODC 2007: 244-253 - 2006
- [c14]Bernadette Charron-Bost, André Schiper:
Improving Fast Paxos: being optimistic with no overhead. PRDC 2006: 287-295 - 2005
- [e1]Peter Vojtás, Mária Bieliková, Bernadette Charron-Bost, Ondrej Sýkora:
SOFSEM 2005: Theory and Practice of Computer Science, 31st Conference on Current Trends in Theory and Practice of Computer Science, Liptovský Ján, Slovakia, January 22-28, 2005, Proceedings. Lecture Notes in Computer Science 3381, Springer 2005, ISBN 3-540-24302-X [contents] - 2004
- [j8]Bernadette Charron-Bost, André Schiper:
Uniform consensus is harder than consensus. J. Algorithms 51(1): 15-37 (2004) - [c13]Bernadette Charron-Bost, Fabrice Le Fessant:
Validity Conditions in Agreement Problems and Time Complexity. SOFSEM 2004: 196-207 - [i2]Bernadette Charron-Bost:
Reductions in Distributed Computing Part I: Consensus and Atomic Commitment Tasks. CoRR abs/cs/0412115 (2004) - [i1]Bernadette Charron-Bost:
Reductions in Distributed Computing Part II: k-Threshold Agreement Tasks. CoRR abs/cs/0412116 (2004) - 2003
- [j7]Bernadette Charron-Bost, Robert Cori:
A Note on Linearizability and the Global Time Axiom. Parallel Process. Lett. 13(1): 19-24 (2003) - [c12]Bernadette Charron-Bost:
Comparing the Atomic Commitment and Consensus Problems. Future Directions in Distributed Computing 2003: 29-34 - 2002
- [c11]Bernadette Charron-Bost, Xavier Défago
Broadcasting Messages in Fault-Tolerant Distributed Systems: The Benefit of Handling Input-Triggered and Output-Triggered Suspicions Differently. SRDS 2002: 244-249 - 2001
- [c10]Bernadette Charron-Bost:
Agreement Problems in Fault-Tolerant Distributed Systems. SOFSEM 2001: 10-32 - [c9]Bernadette Charron-Bost, Xavier Défago
Time vs. Space in Fault-Tolerant Distributed Systems. WORDS 2001: 21-27 - 2000
- [c8]Bernadette Charron-Bost, Sam Toueg, Anindya Basu:
Revisiting Safety and Liveness in the Context of Failures. CONCUR 2000: 552-565 - [c7]Bernadette Charron-Bost, Rachid Guerraoui, André Schiper:
Synchronous System and Perfect Failure Detector: Solvability and Efficiency Issue. DSN 2000: 523-532
1990 – 1999
- 1997
- [j6]Bernadette Charron-Bost, Robert Cori, Antoine Petit:
Introduction à l'algorithmique des objets partagés. RAIRO Theor. Informatics Appl. 31(2): 97-148 (1997) - [j5]Bernadette Charron-Bost, Gerard Tel:
Calculs approchés de la borne inférieure de valeurs réparties. RAIRO Theor. Informatics Appl. 31(4): 305-330 (1997) - 1996
- [j4]Bernadette Charron-Bost, Friedemann Mattern, Gerard Tel:
Synchronous, Asynchronous, and Causally Ordered Communication. Distributed Comput. 9(4): 173-191 (1996) - [c6]Anindya Basu, Bernadette Charron-Bost, Sam Toueg:
Crash Failures vs. Crash + Link Failures (Abstract). PODC 1996: 246 - [c5]Tushar Deepak Chandra, Vassos Hadzilacos, Sam Toueg, Bernadette Charron-Bost:
On the Impossibility of Group Membership. PODC 1996: 322-330 - [c4]Anindya Basu, Bernadette Charron-Bost, Sam Toueg:
Simulating Reliable Links with Unreliable Links in the Presence of Process Crashes. WDAG 1996: 105-122 - 1995
- [j3]Bernadette Charron-Bost, Carole Delporte-Gallet, Hugues Fauconnier:
Local and Temporal Predicates In Distributed Systems. ACM Trans. Program. Lang. Syst. 17(1): 157-179 (1995) - 1993
- [j2]Bernadette Charron-Bost:
Coupling Coefficients of a Distributed Execution. Theor. Comput. Sci. 110(2): 341-376 (1993) - 1991
- [j1]Bernadette Charron-Bost:
Concerning the Size of Logical Clocks in Distributed Systems. Inf. Process. Lett. 39(1): 11-16 (1991) - 1990
- [c3]Bernadette Charron-Bost:
Concerning the Size of Clocks. Semantics of Systems of Concurrent Processes 1990: 176-184
1980 – 1989
- 1989
- [c2]Bernadette Charron-Bost:
Measure of Parallelism of Distributed Computations. STACS 1989: 434-445 - [c1]Bernadette Charron-Bost:
Combinatorics and Geometry of Consistent Cuts: Application to Concurrency Theory. WDAG 1989: 45-56
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: