Achour Mostéfaoui
Orcid: 0000-0001-7208-4635Affiliations:
- IRISA Rennes
According to our database1,
Achour Mostéfaoui
authored at least 165 papers
between 1994 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on irisa.fr
-
on dl.acm.org
On csauthors.net:
Bibliography
2025
Proceedings of the 26th International Conference on Distributed Computing and Networking, 2025
2024
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024
Brief Announcement: No Broadcast Abstraction Characterizes k-Set-Agreement in Message-Passing Systems.
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024
No Symmetric Broadcast Abstraction Characterizes k-Set-Agreement in Message-Passing Systems.
Proceedings of the 28th International Conference on Principles of Distributed Systems, 2024
Proceedings of the 19th European Dependable Computing Conference, 2024
Proceedings of the 2024 Workshop on Advanced Tools, 2024
2023
IEEE Trans. Parallel Distributed Syst., 2023
Send/Receive Patterns Versus Read/Write Patterns in Crash-Prone Asynchronous Distributed Systems.
Proceedings of the 37th International Symposium on Distributed Computing, 2023
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023
Proceedings of the 27th International Conference on Principles of Distributed Systems, 2023
2022
Distributed Comput., 2022
2021
Set-constrained delivery broadcast: A communication abstraction for read/write implementable distributed objects.
Theor. Comput. Sci., 2021
Concurr. Comput. Pract. Exp., 2021
Proceedings of the 35th International Symposium on Distributed Computing, 2021
2020
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020
2019
Inf. Process. Lett., 2019
Time-efficient read/write register in crash-prone asynchronous message-passing systems.
Computing, 2019
Brief Announcement: Wait-Free Universality of Consensus in the Infinite Arrival Model.
Proceedings of the 33rd International Symposium on Distributed Computing, 2019
Proceedings of the 24th IEEE Pacific Rim International Symposium on Dependable Computing, 2019
Proceedings of the Parallel Computing Technologies, 2019
2018
World Wide Web, 2018
Theor. Comput. Sci., 2018
Parallel Process. Lett., 2018
Bull. EATCS, 2018
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
Another Look at the Implementation of Read/write Registers in Crash-prone Asynchronous Message-Passing Systems (Extended Version).
CoRR, 2017
Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with t< n/3, O(n<sup>2</sup>) messages, and constant time.
Acta Informatica, 2017
Proceedings of the 31st International Symposium on Distributed Computing, 2017
Proceedings of the Parallel Computing Technologies, 2017
2016
Intrusion-Tolerant Broadcast and Agreement Abstractions in the Presence of Byzantine Processes.
IEEE Trans. Parallel Distributed Syst., 2016
CoRR, 2016
Proceedings of the 25th International Conference on World Wide Web, 2016
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
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
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015
Proceedings of the Networked Systems - Third International Conference, 2015
Proceedings of the 14th IEEE International Symposium on Network Computing and Applications, 2015
Proceedings of the 14th IEEE International Symposium on Network Computing and Applications, 2015
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, 2015
2014
Proceedings of the Distributed Computing - 28th International Symposium, 2014
Signature-free asynchronous byzantine consensus with t 2<n/3 and o(n<sup>2</sup>) 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
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
Proceedings of the ACM Symposium on Document Engineering 2013, 2013
2012
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
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
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010
Proceedings of The Ninth IEEE International Symposium on Networking Computing and Applications, 2010
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 Distributed Syst., 2009
Proceedings of the Distributed Computing, 23rd International Symposium, 2009
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 Comput., 2008
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008
Proceedings of the On the Move to Meaningful Internet Systems: OTM 2008 Workshops, 2008
Proceedings of the Distributed Computing and Networking, 9th International Conference, 2008
2007
IEEE Trans. Parallel Distributed Syst., 2007
IEEE Trans. Computers, 2007
From omega to Omega: A simple bounded quiescent reliable broadcast-based transformation.
J. Parallel Distributed Comput., 2007
Proceedings of the Structural Information and Communication Complexity, 2007
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007
Proceedings of the Parallel Computing Technologies, 2007
Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007
2006
IEEE Trans. Parallel Distributed Syst., 2006
Parallel Process. Lett., 2006
Exploring Gafni's Reduction Land: From <i>Omega</i><sup><i>k</i></sup> 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
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006
Proceedings of the On the Move to Meaningful Internet Systems 2006: OTM 2006 Workshops, 2006
Proceedings of the 20th International Conference on Advanced Information Networking and Applications (AINA 2006), 2006
2005
Simple and Efficient Oracle-Based Consensus Protocols for Asynchronous Byzantine Systems.
IEEE Trans. Dependable Secur. Comput., 2005
$\diamondsuit {\mathcal P}_{mute}$-based Consensus for Asynchronous Byzantine Systems.
Parallel Process. Lett., 2005
Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems (SRDS 2005), 2005
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
Proceedings of the Dependable Computing, 2005
2004
A necessary and sufficient condition for transforming limited accuracy failure detectors.
J. Comput. Syst. Sci., 2004
Inf. Process. Lett., 2004
Condition-based consensus solvability: a hierarchy of conditions and efficient protocols.
Distributed Comput., 2004
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
Proceedings of the 10th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC 2004), 2004
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
Proceedings of the Distributed Computing, 2004
2003
Conditions on input vectors for consensus solvability in asynchronous distributed systems.
J. ACM, 2003
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
Proceedings of the Parallel Computing Technologies, 2003
Proceedings of the 2003 International Conference on Dependable Systems and Networks (DSN 2003), 2003
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
J. Comput. Syst. Sci., 2002
Future Gener. Comput. Syst., 2002
Proceedings of the Distributed Computing, 16th International Conference, 2002
Proceedings of the Distributed Computing, 16th International Conference, 2002
Proceedings of the Distributed Computing, 16th International Conference, 2002
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002
Proceedings of the 2002 International Conference on Dependable Systems and Networks (DSN 2002), 2002
2001
IEEE Trans. Parallel Distributed Syst., 2001
Impossibility of scalar clock-based communication-induced checkpointing protocols ensuring the RDT property.
Inf. Process. Lett., 2001
Future Gener. Comput. Syst., 2001
Proceedings of the 20th Symposium on Reliable Distributed Systems (SRDS 2001), 2001
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001
Efficient Condition-Based Consensus.
Proceedings of the SIROCCO 8, 2001
Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001
Proceedings of the Parallel Computing Technologies, 2001
Proceedings of the 4th International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2001), 2001
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 Distributed Syst., 2000
From Binary Consensus to Multivalued Consensus in asynchronous message-passing systems.
Inf. Process. Lett., 2000
Distributed Comput., 2000
Proceedings of the 2000 Pacific Rim International Symposium on Dependable Computing (PRDC 2000), 2000
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000
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
Proceedings of the 2000 International Conference on Dependable Systems and Networks (DSN 2000) (formerly FTCS-30 and DCCA-8), 2000
1999
IEEE Trans. Parallel Distributed Syst., 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
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
Proceedings of the Advances in Distributed Systems, 1999
1998
Proceedings of the Seventeenth Symposium on Reliable Distributed Systems, 1998
Proceedings of the Seventeenth Symposium on Reliable Distributed Systems, 1998
Proceedings of the International Conference on Parallel and Distributed Systems, 1998
1997
Int. J. Syst. Sci., 1997
Proceedings of the Distributed Algorithms, 11th International Workshop, 1997
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
Proceedings of the 1997 Advances in Parallel and Distributed Computing Conference (APDC '97), 1997
1996
Real Time Syst., 1996
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
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
IEEE Trans. Parallel Distributed Syst., 1994
A O(log<sub>2</sub> 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