Bernadette Charron-Bost

According to our database1, Bernadette Charron-Bost authored at least 59 papers between 1989 and 2018.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Randomization and quantization for average consensus.
CoRR, 2018

The Firing Squad Problem Revisited.
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

2017
New transience bounds for max-plus linear systems.
Discrete Applied Mathematics, 2017

Synchronization in Dynamic Networks.
CoRR, 2017

2016
Consensus with Partial Synchrony.
Encyclopedia of Algorithms, 2016

Multidimensional Asymptotic Consensus in Dynamic Networks.
CoRR, 2016

Fast, Robust, Quantizable Approximate Consensus.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Time Complexity of Link Reversal Routing.
ACM Trans. Algorithms, 2015

Amortized Averaging Algorithms for Approximate Consensus.
CoRR, 2015

A Proof of the Convergence of the Hegselmann-Krause Dynamics on the Circle.
CoRR, 2015

Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

Diffusive clock synchronization in highly dynamic networks.
Proceedings of the 49th Annual Conference on Information Sciences and Systems, 2015

2014
An Overview of Transience Bounds in Max-Plus Algebra.
CoRR, 2014

Approximate Consensus in Highly Dynamic Networks.
CoRR, 2014

2013
Link Reversal Routing with Binary Link Labels: Work Complexity.
SIAM J. Comput., 2013

Formal Verification of Distributed Algorithms (Dagstuhl Seminar 13141).
Dagstuhl Reports, 2013

Orientation and Connectivity Based Criteria for Asymptotic Consensus
CoRR, 2013

Transience Bounds for Distributed Algorithms.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2013

2012
New Transience Bounds for Long Walks
CoRR, 2012

2011
On the Transience of Linear Max-Plus Dynamical Systems
CoRR, 2011

Formal Verification of Consensus Algorithms Tolerating Malicious Faults.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2011

Brief announcement: full reversal routing as a linear dynamical system.
Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

Partial is Full.
Proceedings of the Structural Information and Communication Complexity, 2011

Full Reversal Routing as a Linear Dynamical System.
Proceedings of the Structural Information and Communication Complexity, 2011

2010
In search of lost time.
Inf. Process. Lett., 2010

2009
Formal Verification of a Consensus Algorithm in the Heard-Of Model.
Int. J. Software and Informatics, 2009

The Heard-Of model: computing in distributed systems with benign faults.
Distributed Computing, 2009

Routing without ordering.
Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

A Reduction Theorem for the Verification of Round-Based Distributed Algorithms.
Proceedings of the Reachability Problems, 3rd International Workshop, 2009

Link Reversal: How to Play Better to Work Less.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2009

2008
Consensus with Partial Synchrony.
Proceedings of the Encyclopedia of Algorithms, 2008

08371 Summary - Fault-Tolerant Distributed Algorithms on VLSI Chips.
Proceedings of the Fault-Tolerant Distributed Algorithms on VLSI Chips, 07.09., 2008

08371 Abstracts Collection - Fault-Tolerant Distributed Algorithms on VLSI Chips.
Proceedings of the Fault-Tolerant Distributed Algorithms on VLSI Chips, 07.09., 2008

2007
Harmful dogmas in fault tolerant distributed computing.
SIGACT News, 2007

Tolerating corrupted communication.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

2006
Improving Fast Paxos: being optimistic with no overhead.
Proceedings of the 12th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2006), 2006

2004
Uniform consensus is harder than consensus.
J. Algorithms, 2004

Reductions in Distributed Computing Part II: k-Threshold Agreement Tasks
CoRR, 2004

Reductions in Distributed Computing Part I: Consensus and Atomic Commitment Tasks
CoRR, 2004

Validity Conditions in Agreement Problems and Time Complexity.
Proceedings of the SOFSEM 2004: Theory and Practice of Computer Science, 2004

2003
A Note on Linearizability and the Global Time Axiom.
Parallel Processing Letters, 2003

Comparing the Atomic Commitment and Consensus Problems.
Proceedings of the Future Directions in Distributed Computing, 2003

2002
Broadcasting Messages in Fault-Tolerant Distributed Systems: The Benefit of Handling Input-Triggered and Output-Triggered Suspicions Differently.
Proceedings of the 21st Symposium on Reliable Distributed Systems (SRDS 2002), 2002

2001
Time vs. Space in Fault-Tolerant Distributed Systems.
Proceedings of the 6th Workshop on Object-Oriented Real-Time Dependable Systems (WORDS 2001), 2001

Agreement Problems in Fault-Tolerant Distributed Systems.
Proceedings of the SOFSEM 2001: Theory and Practice of Informatics, 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24, 2001

2000
Synchronous System and Perfect Failure Detector: Solvability and Efficiency Issue.
Proceedings of the 2000 International Conference on Dependable Systems and Networks (DSN 2000) (formerly FTCS-30 and DCCA-8), 2000

Revisiting Safety and Liveness in the Context of Failures.
Proceedings of the CONCUR 2000, 2000

1997
Calculs approchés de la borne inférieure de valeurs réparties.
ITA, 1997

Introduction à l'algorithmique des objets partagés.
ITA, 1997

1996
Synchronous, Asynchronous, and Causally Ordered Communication.
Distributed Computing, 1996

Simulating Reliable Links with Unreliable Links in the Presence of Process Crashes.
Proceedings of the Distributed Algorithms, 10th International Workshop, 1996

On the Impossibility of Group Membership.
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

Crash Failures vs. Crash + Link Failures (Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

1995
Local and Temporal Predicates In Distributed Systems.
ACM Trans. Program. Lang. Syst., 1995

1993
Coupling Coefficients of a Distributed Execution.
Theor. Comput. Sci., 1993

1991
Concerning the Size of Logical Clocks in Distributed Systems.
Inf. Process. Lett., 1991

1990
Concerning the Size of Clocks.
Proceedings of the Semantics of Systems of Concurrent Processes, 1990

1989
Combinatorics and Geometry of Consistent Cuts: Application to Concurrency Theory.
Proceedings of the Distributed Algorithms, 1989

Measure of Parallelism of Distributed Computations.
Proceedings of the STACS 89, 1989


  Loading...