2008 |
27 | EE | Bernadette Charron-Bost,
André Schiper:
Consensus with Partial Synchrony.
Encyclopedia of Algorithms 2008 |
2007 |
26 | EE | Martin Biely,
Josef Widder,
Bernadette Charron-Bost,
Antoine Gaillard,
Martin Hutle,
André Schiper:
Tolerating corrupted communication.
PODC 2007: 244-253 |
25 | EE | Bernadette Charron-Bost,
André Schiper:
Harmful dogmas in fault tolerant distributed computing.
SIGACT News 38(1): 53-61 (2007) |
2006 |
24 | EE | Bernadette Charron-Bost,
André Schiper:
Improving Fast Paxos: being optimistic with no overhead.
PRDC 2006: 287-295 |
2005 |
23 | | 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
Springer 2005 |
2004 |
22 | EE | Bernadette Charron-Bost,
Fabrice Le Fessant:
Validity Conditions in Agreement Problems and Time Complexity.
SOFSEM 2004: 196-207 |
21 | EE | Bernadette Charron-Bost:
Reductions in Distributed Computing Part I: Consensus and Atomic Commitment Tasks
CoRR abs/cs/0412115: (2004) |
20 | EE | Bernadette Charron-Bost:
Reductions in Distributed Computing Part II: k-Threshold Agreement Tasks
CoRR abs/cs/0412116: (2004) |
19 | EE | Bernadette Charron-Bost,
André Schiper:
Uniform consensus is harder than consensus.
J. Algorithms 51(1): 15-37 (2004) |
2003 |
18 | EE | Bernadette Charron-Bost:
Comparing the Atomic Commitment and Consensus Problems.
Future Directions in Distributed Computing 2003: 29-34 |
17 | EE | Bernadette Charron-Bost,
Robert Cori:
A Note on Linearizability and the Global Time Axiom.
Parallel Processing Letters 13(1): 19-24 (2003) |
2002 |
16 | EE | Bernadette Charron-Bost,
Xavier Défago,
André Schiper:
Broadcasting Messages in Fault-Tolerant Distributed Systems: The Benefit of Handling Input-Triggered and Output-Triggered Suspicions Differently.
SRDS 2002: 244-249 |
2001 |
15 | EE | Bernadette Charron-Bost:
Agreement Problems in Fault-Tolerant Distributed Systems.
SOFSEM 2001: 10-32 |
14 | EE | Bernadette Charron-Bost,
Xavier Défago,
André Schiper:
Time vs. Space in Fault-Tolerant Distributed Systems.
WORDS 2001: 21-27 |
2000 |
13 | EE | Bernadette Charron-Bost,
Sam Toueg,
Anindya Basu:
Revisiting Safety and Liveness in the Context of Failures.
CONCUR 2000: 552-565 |
12 | EE | Bernadette Charron-Bost,
Rachid Guerraoui,
André Schiper:
Synchronous System and Perfect Failure Detector: Solvability and Efficiency Issue.
DSN 2000: 523-532 |
1997 |
11 | | Bernadette Charron-Bost,
Robert Cori,
Antoine Petit:
Introduction à l'algorithmique des objets partagés.
ITA 31(2): 97-148 (1997) |
10 | | Bernadette Charron-Bost,
Gerard Tel:
Calculs approchés de la borne inférieure de valeurs réparties.
ITA 31(4): 305-330 (1997) |
1996 |
9 | | Anindya Basu,
Bernadette Charron-Bost,
Sam Toueg:
Crash Failures vs. Crash + Link Failures (Abstract).
PODC 1996: 246 |
8 | | Anindya Basu,
Bernadette Charron-Bost,
Sam Toueg:
Simulating Reliable Links with Unreliable Links in the Presence of Process Crashes.
WDAG 1996: 105-122 |
7 | | Bernadette Charron-Bost,
Friedemann Mattern,
Gerard Tel:
Synchronous, Asynchronous, and Causally Ordered Communication.
Distributed Computing 9(4): 173-191 (1996) |
1995 |
6 | EE | 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 |
5 | | Bernadette Charron-Bost:
Coupling Coefficients of a Distributed Execution.
Theor. Comput. Sci. 110(2): 341-376 (1993) |
1991 |
4 | | Bernadette Charron-Bost:
Concerning the Size of Logical Clocks in Distributed Systems.
Inf. Process. Lett. 39(1): 11-16 (1991) |
1990 |
3 | | Bernadette Charron-Bost:
Concerning the Size of Clocks.
Semantics of Systems of Concurrent Processes 1990: 176-184 |
1989 |
2 | | Bernadette Charron-Bost:
Measure of Parallelism of Distributed Computations.
STACS 1989: 434-445 |
1 | | Bernadette Charron-Bost:
Combinatorics and Geometry of Consistent Cuts: Application to Concurrency Theory.
WDAG 1989: 45-56 |