Jean-Michel Hélary

According to our database1, Jean-Michel Hélary
  • authored at least 54 papers between 1987 and 2009.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2009
Computing, Observing, Controlling, Checkpointing: Symbiosis Is Even Better Than Agreement!
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

2008
A methodology to design arbitrary failure detectors for distributed protocols.
Journal of Systems Architecture - Embedded Systems Design, 2008

2007
A Component-Based Methodology to Design Arbitrary Failure Detectors for Distributed Protocols.
Proceedings of the Tenth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2007), 2007

2006
About the Efficiency of Partial Replication to Implement Distributed Shared Memory.
Proceedings of the 2006 International Conference on Parallel Processing (ICPP 2006), 2006

2005
Building Responsive TMR-Based Servers in Presence of Timing Constraints.
Proceedings of the Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2005), 2005

Group communication in ad-hoc networks: a few results and a case study.
Proceedings of the International Conference on Pervasive Services 2005, 2005

2003
Early Stopping in Global Data Computation.
IEEE Trans. Parallel Distrib. Syst., 2003

Efficient Causality-Tracking Timestamping.
IEEE Trans. Knowl. Data Eng., 2003

Consensus in Byzantine asynchronous systems.
J. Discrete Algorithms, 2003

2002
Interval Consistency of Asynchronous Distributed Computations.
J. Comput. Syst. Sci., 2002

A Note on the Determination of the Immediate Predecessors in a Distributed Computation.
Int. J. Found. Comput. Sci., 2002

Tracking immediate predecessors in distributed computations.
SPAA, 2002

Building responseive TMR-based servers in presence of timing constraints.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

Early stopping in aglobal data computation.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

2001
Impossibility of scalar clock-based communication-induced checkpointing protocols ensuring the RDT property.
Inf. Process. Lett., 2001

Rollback-Dependency Trackability: A Minimal Characterization and Its Protocol.
Inf. Comput., 2001

Direct dependency-based determination of consistent global checkpoints.
Comput. Syst. Sci. Eng., 2001

Building TMR-Based Reliable Servers Despite Bounded Input Lifetimes.
Proceedings of the Euro-Par 2001: Parallel Processing, 2001

2000
Computing Global Functions in Asynchronous Distributed Systems with Perfect Failure Detectors.
IEEE Trans. Parallel Distrib. Syst., 2000

Communication-Based Prevention of Useless Checkpoints in Fistributed Computations.
Distributed Computing, 2000

Minimal Size of Piggybacked Information for Tracking Causality: A Graph-Based Characterization.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

Tracking causality in distributed systems: a suite of efficient protocols.
Proceedings of the SIROCCO 7, 2000

Consensus in byzantine asynchronous systems.
Proceedings of the SIROCCO 7, 2000

Computing Global Functions in Asynchronous Distributed Systems Prone to Process Crashes.
Proceedings of the 20th International Conference on Distributed Computing Systems, 2000

From Crash Fault-Tolerance to Arbitrary-Fault Tolerance: Towards a Modular Approach.
Proceedings of the 2000 International Conference on Dependable Systems and Networks (DSN 2000) (formerly FTCS-30 and DCCA-8), 2000

1999
Consistency Issues in Distributed Checkpoints.
IEEE Trans. Software Eng., 1999

Communication-Induced Determination of Consistent Snapshots.
IEEE Trans. Parallel Distrib. Syst., 1999

Rollback-Dependency Trackability: Visible Characterizations.
Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

Direct Dependency-Based Determination of Consistent GlobalCheckpoints.
Proceedings of the Procedings of the 3rd International Conference on Principles of Distributed Systems. OPODIS 99, 1999

1998
Consistent Records in Asynchronous Computations.
Acta Inf., 1998

Communication-Induced Determination of Consistent Snapshots.
Proceedings of the Digest of Papers: FTCS-28, 1998

1997
Adaptive checkpointing in message passing distributed systems.
Int. J. Systems Science, 1997

Solving agreement problems with failure detectors: a survey.
Annales des Télécommunications, 1997

Virtual Precedence in Asynchronous Systems: Cencept and Applications.
Proceedings of the Distributed Algorithms, 11th International Workshop, 1997

Preventing Useless Checkpoints in Distributed Computations.
Proceedings of the Sixteenth Symposium on Reliable Distributed Systems, 1997

Cycle Prevention in Distributed Checkpointing.
Proceedings of the On Principles Of Distributed Systems, 1997

A Communication-Induced Checkpointing Protocol that Ensures Rollback-Dependency Trackability.
Proceedings of the Digest of Papers: FTCS-27, 1997

Consistent State Restoration in Shared Memory Systems.
Proceedings of the 1997 Advances in Parallel and Distributed Computing Conference (APDC '97), 1997

1996
Erratum: Deadlock Models and a General Algorithm for Distributed Deadlock Detection.
J. Parallel Distrib. Comput., 1996

About State Recording in Asynchronous Computations (Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

1995
Deadlock Models and a General Algorithm for Distributed Deadlock Detection.
J. Parallel Distrib. Comput., 1995

Deadlocks in Distributed Systems: Request Models and Definitions.
Proceedings of the 5th IEEE Workshop on Future Trends of Distributed Computing Systems (FTDCS 1995), 1995

Characterization of Consistent Global Checkpoints in Large-Scale Distributed Systems.
Proceedings of the 5th IEEE Workshop on Future Trends of Distributed Computing Systems (FTDCS 1995), 1995

1994
A General Scheme for Token- and Tree-Based Distributed Mutual Exclusion Algorithms.
IEEE Trans. Parallel Distrib. Syst., 1994

Towards the Construction of Distributed Detection Programs, with an Application to Distributed Termination.
Distributed Computing, 1994

A O(log2 n) Fault-Tolerant Distributed Mutual Exclusion Algorithm Based on Open-Cube Structure.
Proceedings of the 14th International Conference on Distributed Computing Systems, 1994

Performance Improvement of State Space Exploration by Regular & Diffrential Hashing Functions.
Proceedings of the Computer Aided Verification, 6th International Conference, 1994

1993
Termination Detection in a Very General Distributed Computing Model.
Proceedings of the 13th International Conference on Distributed Computing Systems, 1993

1992
Distributed Evaluation: A Tool for Constructing Distributed Detection Programs.
Proceedings of the Theory of Computing and Systems, 1992

1990
Synchronization and control of distributed systems and programs.
Wiley series in parallel computing, Wiley, ISBN: 978-0-471-92453-1, 1990

1989
Observing Global States of Asynchronous Distributed Applications.
Proceedings of the Distributed Algorithms, 1989

1988
A Distributed Algorithm for Mutual Exclusion in an Arbitrary Network.
Comput. J., 1988

1987
Calcul Réparti D'un Extrémum Et Du Routage Associé Dans Un Réseau Quelconque.
ITA, 1987

Detection of Stable Properties in Distributed Applications.
Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, 1987


  Loading...