# Achour Mostéfaoui

According to our database1, Achour Mostéfaoui authored at least 143 papers between 1994 and 2019.

Collaborative distances:

Book
In proceedings
Article
PhD thesis
Other

## Bibliography

2019
Time-efficient read/write register in crash-prone asynchronous message-passing systems.
Computing, 2019

Does the Operational Model Capture Partition Tolerance in Distributed Systems?
Proceedings of the Parallel Computing Technologies, 2019

2018
An adaptive peer-sampling protocol for building networks of browsers.
World Wide Web, 2018

Randomized k-set agreement in crash-prone and Byzantine asynchronous systems.
Theor. Comput. Sci., 2018

A Simple Object that Spans the Whole Consensus Hierarchy.
Parallel Processing Letters, 2018

Extending Causal Consistency to any Object Defined by a Sequential Specification.
Bulletin of the EATCS, 2018

Breaking the Scalability Barrier of Causal Broadcast for Large and Dynamic Systems.
Proceedings of the 37th IEEE Symposium on Reliable Distributed Systems, 2018

Proceedings of the 22nd International Conference on Principles of Distributed Systems, 2018

Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits.
Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

2017
Atomic Read/Write Memory in Signature-Free Byzantine Asynchronous Message-Passing Systems.
Theory Comput. Syst., 2017

Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with t< n/3, O(n2) messages, and constant time.
Acta Inf., 2017

Which Broadcast Abstraction Captures k-Set Agreement?.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

Probabilistic Causal Message Ordering.
Proceedings of the Parallel Computing Technologies, 2017

2016
Intrusion-Tolerant Broadcast and Agreement Abstractions in the Presence of Byzantine Processes.
IEEE Trans. Parallel Distrib. Syst., 2016

CRATE: Writing Stories Together with our Browsers.
Proceedings of the 25th International Conference on World Wide Web, 2016

On Composition and Implementation of Sequential Consistency.
Proceedings of the Distributed Computing - 30th International Symposium, 2016

Speed for the Elite, Consistency for the Masses: Differentiating Eventual Consistency in Large-Scale Distributed Systems.
Proceedings of the 35th IEEE Symposium on Reliable Distributed Systems, 2016

Causal consistency: beyond memory.
Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2016

Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Time-Efficient Read/Write Register in Crash-Prone Asynchronous Message-Passing Systems.
Proceedings of the Networked Systems - 4th International Conference, 2016

Modular randomized byzantine k-set agreement in asynchronous message-passing systems.
Proceedings of the 17th International Conference on Distributed Computing and Networking, 2016

2015
Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time.
J. ACM, 2015

Signature-Free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n2) Messages, and Constant Time.
Proceedings of the Structural Information and Communication Complexity, 2015

Minimal Synchrony for Byzantine Consensus.
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Tracking Causal Dependencies in Web Services Orchestrations Defined in ORC.
Proceedings of the Networked Systems - Third International Conference, 2015

Efficiently Summarizing Data Streams over Sliding Windows.
Proceedings of the 14th IEEE International Symposium on Network Computing and Applications, 2015

A Message-Passing and Adaptive Implementation of the Randomized Test-and-Set Object.
Proceedings of the 14th IEEE International Symposium on Network Computing and Applications, 2015

Update Consistency for Wait-Free Concurrent Objects.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, 2015

2014
Update Consistency in Partitionable Systems.
Proceedings of the Distributed Computing - 28th International Symposium, 2014

Signature-free asynchronous byzantine consensus with t 22) messages.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

2013
Synchronous byzantine agreement with nearly a cubic number of communication bits: synchronous byzantine agreement with nearly a cubic number of communication bits.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

Topic 8: Distributed Systems and Algorithms - (Introduction).
Proceedings of the Euro-Par 2013 Parallel Processing, 2013

Concurrency Effects Over Variable-size Identifiers in Distributed Collaborative Editing.
Proceedings of the International workshop on Document Changes: Modeling, 2013

LSEQ: an adaptive structure for sequences in distributed collaborative editing.
Proceedings of the ACM Symposium on Document Engineering 2013, 2013

2012
Chasing the Weakest Failure Detector for k-Set Agreement in Message-Passing Systems.
Proceedings of the 11th IEEE International Symposium on Network Computing and Applications, 2012

2011
Relations Linking Failure Detectors Associated with k-Set Agreement in Message-Passing Systems.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2011

Looking for Efficient Implementations of Concurrent Objects.
Proceedings of the Parallel Computing Technologies - 11th International Conference, 2011

A Necessary and Sufficient Synchrony Condition for Solving Byzantine Consensus in Symmetric Networks.
Proceedings of the Distributed Computing and Networking - 12th International Conference, 2011

2010
Narrowing power vs efficiency in synchronous set agreement: Relationship, algorithms and lower bound.
Theor. Comput. Sci., 2010

Signature-Free Broadcast-Based Intrusion Tolerance: Never Decide a Byzantine Value.
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

Time-Free Authenticated Byzantine Consensus.
Proceedings of The Ninth IEEE International Symposium on Networking Computing and Applications, 2010

Low-Cost Secret-Sharing in Sensor Networks.
Proceedings of the 12th IEEE High Assurance Systems Engineering Symposium, 2010

2009
On the Fly Estimation of the Processes that Are Alive in an Asynchronous Message-Passing System.
IEEE Trans. Parallel Distrib. Syst., 2009

From adaptive renaming to set agreement.
Theor. Comput. Sci., 2009

What Agreement Problems Owe Michel.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Large-Scale Networked Systems: From Anarchy to Geometric Self-structuring.
Proceedings of the Distributed Computing and Networking, 10th International Conference, 2009

2008
The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement.
SIAM J. Comput., 2008

On the computability power and the robustness of set agreement-oriented failure detector classes.
Distributed Computing, 2008

From anarchy to geometric structuring: the power of virtual coordinates.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

RDDS 2008 PC Co-chairs' Message.
Proceedings of the On the Move to Meaningful Internet Systems: OTM 2008 Workshops, 2008

Narrowing Power vs. Efficiency in Synchronous Set Agreement.
Proceedings of the Distributed Computing and Networking, 9th International Conference, 2008

2007
On the Respective Power of *P and *S to Solve One-Shot Agreement Problems.
IEEE Trans. Parallel Distrib. Syst., 2007

Asynchronous Agreement and Its Relation with Error-Correcting Codes.
IEEE Trans. Computers, 2007

From omega to Omega: A simple bounded quiescent reliable broadcast-based transformation.
J. Parallel Distrib. Comput., 2007

From Renaming to Set Agreement.
Proceedings of the Structural Information and Communication Complexity, 2007

Towards the minimal synchrony for byzantine consensus.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Towards a Computing Model for Open Distributed Systems.
Proceedings of the Parallel Computing Technologies, 2007

Byzantine Consensus with Few Synchronous Links.
Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

Topic 8 Distributed Systems and Algorithms.
Proceedings of the Euro-Par 2007, 2007

2006
Time-Free and Timer-Based Assumptions Can Be Combined to Obtain Eventual Leadership.
IEEE Trans. Parallel Distrib. Syst., 2006

A Time-free Assumption to Implement Eventual Leadership.
Parallel Processing Letters, 2006

Synchronous condition-based consensus.
Distributed Computing, 2006

Exploring Gafni's Reduction Land: From Omegak to Wait-Free Adaptive (2p-[p/k])-Renaming Via k-Set Agreement.
Proceedings of the Distributed Computing, 20th International Symposium, 2006

On the fly estimation of the processes that are alive/crashed in an asynchronous message-passing system.
Proceedings of the 12th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2006), 2006

Irreducibility and additivity of set agreement-oriented failure detector classes.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

Core Persistence in Peer-to-Peer Systems: Relating Size to Lifetime.
Proceedings of the On the Move to Meaningful Internet Systems 2006: OTM 2006 Workshops, 2006

From Failure Detectors with Limited Scope Accuracy to System-wide Leadership.
Proceedings of the 20th International Conference on Advanced Information Networking and Applications (AINA 2006), 2006

2005
$\diamondsuit {\mathcal P}_{mute}$-based Consensus for Asynchronous Byzantine Systems.
Parallel Processing Letters, 2005

Inf. Process. Lett., 2005

From Static Distributed Systems to Dynamic Systems.
Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems (SRDS 2005), 2005

Intersecting Sets: a Basic Abstraction for Asynchronous Agreement Problems.
Proceedings of the 11th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2005), 2005

The combined power of conditions and failure detectors to solve asynchronous set agreement.
Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

Building and Using Quorums Despite any Number of Process of Crashes.
Proceedings of the Dependable Computing, 2005

2004
A necessary and sufficient condition for transforming limited accuracy failure detectors.
J. Comput. Syst. Sci., 2004

A weakest failure detector-based asynchronous consensus protocol for f (DOI)
Inf. Process. Lett., 2004

Condition-based consensus solvability: a hierarchy of conditions and efficient protocols.
Distributed Computing, 2004

The Synchronous Condition-Based Consensus Hierarchy.
Proceedings of the Distributed Computing, 18th International Conference, 2004

The Notion of Veto Number and the Respective Power of OP and OS to Solve One-Shot Agreement Problems.
Proceedings of the Distributed Computing, 18th International Conference, 2004

Proceedings of the 23rd International Symposium on Reliable Distributed Systems (SRDS 2004), 2004

Simple and Efficient Oracle-Based Consensus Protocols for Asynchronous Byzantine Systems.
Proceedings of the 23rd International Symposium on Reliable Distributed Systems (SRDS 2004), 2004

A Hybrid Approach for Building Eventually Accurate Failure Detectors.
Proceedings of the 10th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2004), 2004

Brief announcement: the synchronous condition-based consensus hierarchy.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Brief announcement: veto number and the respective power of eventual failure detectors.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

The Notion of Veto Number for Distributed Agreement Problems.
Proceedings of the Distributed Computing, 2004

2003
Using Conditions to Expedite Consensus in Synchronous Distributed Systems.
Proceedings of the Distributed Computing, 17th International Conference, 2003

Single-Write Safe Consensus using Constrained Inputs.
Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

A Hierarchy of Conditions for Asynchronous Interactive Consistency.
Proceedings of the Parallel Computing Technologies, 2003

Asynchronous Implementation of Failure Detectors.
Proceedings of the 2003 International Conference on Dependable Systems and Networks (DSN 2003), 2003

Evaluating the Condition-Based Approach to Solve Consensus.
Proceedings of the 2003 International Conference on Dependable Systems and Networks (DSN 2003), 2003

Using Error-Correcting Codes to Solve Distributed Agreement Problems: A Future Direction in Distributed Computing?
Proceedings of the Future Directions in Distributed Computing, 2003

2002
A Versatile Family of Consensus Protocols Based on Chandra-Toueg's Unreliable Failure Detectors.
IEEE Trans. Computers, 2002

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

An introduction to oracles for asynchronous distributed systems.
Future Generation Comp. Syst., 2002

Condition-Based Protocols for Set Agreement Problems.
Proceedings of the Distributed Computing, 16th International Conference, 2002

Distributed Agreement and Its Relation with Error-Correcting Codes.
Proceedings of the Distributed Computing, 16th International Conference, 2002

The Lord of the Rings: Efficient Maintenance of Views at Data Warehouses.
Proceedings of the Distributed Computing, 16th International Conference, 2002

Towards a formal model for view maintenance in data warehouses.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

Asynchronous interactive consistency and its relation with error-correcting codes.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

A Versatile and Modular Consensus Protoco.
Proceedings of the 2002 International Conference on Dependable Systems and Networks (DSN 2002), 2002

2001
Consensus-Based Fault-Tolerant Total Order Multicast.
IEEE Trans. Parallel Distrib. Syst., 2001

Parallel Processing Letters, 2001

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

The logically instantaneous communication mode: a communication abstraction.
Future Generation Comp. Syst., 2001

Conditions on input vectors for consensus solvability in asynchronous distributed systems.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

A Consensus Protocol Based on a Weak FailureDetector and a Sliding Round Window.
Proceedings of the 20th Symposium on Reliable Distributed Systems (SRDS 2001), 2001

Randomized k-set agreement.
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

Efficient Condition-Based Consensus.
Proceedings of the SIROCCO 8, 2001

A hierarchy of conditions for consensus solvability.
Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001

Consensus in One Communication Step.
Proceedings of the Parallel Computing Technologies, 2001

Randomized Multivalued Consensus.
Proceedings of the 4th International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2001), 2001

A Condition for k-Set Agreement in Asynchronous Distributed Systems.
Proceedings of the 15th International Parallel & Distributed Processing Symposium (IPDPS-01), 2001

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

From Binary Consensus to Multivalued Consensus in asynchronous message-passing systems.
Inf. Process. Lett., 2000

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

Proceedings of the 2000 Pacific Rim International Symposium on Dependable Computing (PRDC 2000), 2000

k-set agreement with limited accuracy failure detectors.
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

Consensus Based on Failure Detectors with a Perpetual Accuracy Property.
Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

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

The Best of Both Worlds: A Hybrid Approach to Solve Consensus.
Proceedings of the 2000 International Conference on Dependable Systems and Networks (DSN 2000) (formerly FTCS-30 and DCCA-8), 2000

1999
Solving Consensus Using Chandra-Toueg's Unreliable Failure Detectors: A General Quorum-Based Approach.
Proceedings of the Distributed Computing, 1999

Logical Clocks for Unreliable Process Groups.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1999

Logically Instantaneous Communication on Top of Distributed Memory Parallel Machines.
Proceedings of the Parallel Computing Technologies, 1999

Consistent Lamport Clocks for Asynchronous Groups with Process Crashes.
Proceedings of the Parallel Computing Technologies, 1999

Unreliable Failure Detectors with Limited Scope Accuracy and an Application to Consensus.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999

Consensus in Asynchronous Distributed Systems: A Concise Guided Tour.
Proceedings of the Advances in Distributed Systems, 1999

1998
Consensus in Asynchronous Systems Where Processes Can Crash and Recover.
Proceedings of the Seventeenth Symposium on Reliable Distributed Systems, 1998

Fault-Tolerant Total Order Multicast to Asynchronous Groups.
Proceedings of the Seventeenth Symposium on Reliable Distributed Systems, 1998

Shrinking Timestamp Sizes of Event Ordering Protocols.
Proceedings of the International Conference on Parallel and Distributed Systems, 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

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
Causal Delivery of Messages with Real-Time Data in Unreliable Networks.
Real-Time Systems, 1996

Efficient Message Logging for Uncoordinated Checkpointing Protocols.
Proceedings of the Dependable Computing, 1996

1995
Token Based Distributed Algorithms to the M Resources Allocation Problem.
Proceedings of the Seventh IASTED/ISMM International Conference on Parallel and Distributed Computing and Systems, 1995

Efficient Causally Ordered Communications for Multimedia Real-Time Applications.
Proceedings of the 4th International Symposium on High Performance Distributed Computing (HPDC '95), 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

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

Definition and Implementation of a Flexible Communication Primitive for Distributed Programming.
Proceedings of the Applications in Parallel and Distributed Computing, 1994