Achour Mostéfaoui

ORCID

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 60

Top Venues

Publications

Vincent Kowalski, Achour Mostéfaoui, Matthieu Perrin
An Optimal Byzantine SCD-Broadcast Protocol. EDCC (2024)
Vincent Kowalski, Achour Mostéfaoui, Matthieu Perrin
Invited Paper: Causal Mutual Byzantine Broadcast. ApPLIED@PODC (2024)
Sylvain Gay, Achour Mostéfaoui, Matthieu Perrin
Brief Announcement: No Broadcast Abstraction Characterizes k-Set-Agreement in Message-Passing Systems. PODC (2024)
Achour Mostéfaoui, Matthieu Perrin, Julien Weibel
Brief Announcement: Randomized Consensus: Common Coins Are not the Holy Grail! PODC (2024)
Mathilde Déprés, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal
Send/Receive Patterns Versus Read/Write Patterns in Crash-Prone Asynchronous Distributed Systems. DISC (2023)
Mathilde Déprés, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal
Brief Announcement: The MBroadcast Abstraction. PODC (2023)
Vincent Kowalski, Achour Mostéfaoui, Matthieu Perrin
Atomic Register Abstractions for Byzantine-Prone Distributed Systems. OPODIS (2023)
Davide Frey, Achour Mostéfaoui, Matthieu Perrin, Pierre-Louis Roman, François Taïani
Differentiated Consistency for Worldwide Gossips. IEEE Trans. Parallel Distributed Syst. 34 (1) (2023)
Matthieu Perrin, Achour Mostéfaoui, Grégoire Bonin, Ludmila Courtillat-Piazza
Extending the wait-free hierarchy to multi-threaded systems. Distributed Comput. 35 (4) (2022)
Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal
Set-constrained delivery broadcast: A communication abstraction for read/write implementable distributed objects. Theor. Comput. Sci. 886 (2021)
Brice Nédelec, Pascal Molli, Achour Mostéfaoui
A scalable sequence encoding for collaborative editing. Concurr. Comput. Pract. Exp. 33 (8) (2021)
Denis Bédin, François Lépine, Achour Mostéfaoui, Damien Perez, Matthieu Perrin
Wait-Free CAS-Based Algorithms: The Burden of the Past. DISC (2021)
Matthieu Perrin, Achour Mostéfaoui, Grégoire Bonin
Extending the Wait-free Hierarchy to Multi-Threaded Systems. PODC (2020)
Achour Mostéfaoui, Matthieu Perrin, Michel Raynal, Jiannong Cao
) messages. Inf. Process. Lett. 151 (2019)
Achour Mostéfaoui, Michel Raynal, Matthieu Roy
Time-efficient read/write register in crash-prone asynchronous message-passing systems. Computing 101 (1) (2019)
Achour Mostéfaoui, Matthieu Perrin, Michel Raynal
A New Insight into Local Coin-Based Randomized Consensus. PRDC (2019)
Grégoire Bonin, Achour Mostéfaoui, Matthieu Perrin
Does the Operational Model Capture Partition Tolerance in Distributed Systems? PaCT (2019)
Grégoire Bonin, Achour Mostéfaoui, Matthieu Perrin
Wait-Free Universality of Consensus in the Infinite Arrival Model. CoRR (2019)
Grégoire Bonin, Achour Mostéfaoui, Matthieu Perrin
Brief Announcement: Wait-Free Universality of Consensus in the Infinite Arrival Model. DISC (2019)
Brice Nédelec, Pascal Molli, Achour Mostéfaoui
Breaking the Scalability Barrier of Causal Broadcast for Large and Dynamic Systems. CoRR (2018)
Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal
Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits. ICDCN (2018)
Achour Mostéfaoui, Matthieu Perrin, Michel Raynal
Extending Causal Consistency to any Object Defined by a Sequential Specification. Bull. EATCS 125 (2018)
Achour Mostéfaoui, Matthieu Perrin, Michel Raynal
A Simple Object that Spans the Whole Consensus Hierarchy. CoRR (2018)
Achour Mostéfaoui, Hamouma Moumen, Michel Raynal
Randomized k-set agreement in crash-prone and Byzantine asynchronous systems. Theor. Comput. Sci. 709 (2018)
Brice Nédelec, Pascal Molli, Achour Mostéfaoui
Breaking the Scalability Barrier of Causal Broadcast for Large and Dynamic Systems. SRDS (2018)
Brice Nédelec, Pascal Molli, Achour Mostéfaoui
Causal Broadcast: How to Forget?. OPODIS (2018)
Achour Mostéfaoui, Matthieu Perrin, Michel Raynal
Extending Causal Consistency to any Object Defined by a Sequential Specification. CoRR (2018)
Brice Nédelec, Julian Tanke, Davide Frey, Pascal Molli, Achour Mostéfaoui
An adaptive peer-sampling protocol for building networks of browsers. World Wide Web 21 (3) (2018)
Achour Mostéfaoui, Matthieu Perrin, Michel Raynal
A Simple Object that Spans the Whole Consensus Hierarchy. Parallel Process. Lett. 28 (2) (2018)
Achour Mostéfaoui, Matoula Petrolia, Michel Raynal, Claude Jard
Atomic Read/Write Memory in Signature-Free Byzantine Asynchronous Message-Passing Systems. Theory Comput. Syst. 60 (4) (2017)
Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal
Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits. CoRR (2017)
Achour Mostéfaoui, Stéphane Weiss
Probabilistic Causal Message Ordering. PaCT (2017)
Achour Mostéfaoui, Michel Raynal
) messages, and constant time. Acta Informatica 54 (5) (2017)
Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal
Another Look at the Implementation of Read/write Registers in Crash-prone Asynchronous Message-Passing Systems (Extended Version). CoRR (2017)
Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal
Which Broadcast Abstraction Captures k-Set Agreement?. DISC (2017)
Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal
Which Broadcast Abstraction Captures $k$-Set Agreement? CoRR (2017)
Achour Mostéfaoui, Michel Raynal
Time-Efficient Read/Write Register in Crash-Prone Asynchronous Message-Passing Systems. NETYS (2016)
Matthieu Perrin, Achour Mostéfaoui, Claude Jard
Causal consistency: beyond memory. PPOPP (2016)
Matthieu Perrin, Matoula Petrolia, Achour Mostéfaoui, Claude Jard
On Composition and Implementation of Sequential Consistency. CoRR (2016)
Achour Mostéfaoui, Hamouma Moumen, Michel Raynal
Modular randomized byzantine k-set agreement in asynchronous message-passing systems. ICDCN (2016)
Achour Mostéfaoui, Michel Raynal
Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems. CoRR (2016)
Achour Mostéfaoui, Matoula Petrolia, Michel Raynal, Claude Jard
Atomic Read/Write Memory in Signature-free Byzantine Asynchronous Message-passing Systems. CoRR (2016)
Achour Mostéfaoui, Michel Raynal
Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems. PODC (2016)
Achour Mostéfaoui, Michel Raynal
Intrusion-Tolerant Broadcast and Agreement Abstractions in the Presence of Byzantine Processes. IEEE Trans. Parallel Distributed Syst. 27 (4) (2016)
Matthieu Perrin, Matoula Petrolia, Achour Mostéfaoui, Claude Jard
On Composition and Implementation of Sequential Consistency. DISC (2016)
Matthieu Perrin, Achour Mostéfaoui, Claude Jard
Causal Consistency: Beyond Memory. CoRR (2016)
Davide Frey, Achour Mostéfaoui, Matthieu Perrin, Pierre-Louis Roman, François Taïani
Speed for the Elite, Consistency for the Masses: Differentiating Eventual Consistency in Large-Scale Distributed Systems. SRDS (2016)
Achour Mostéfaoui, Michel Raynal
Time-Efficient Read/Write Register in Crash-prone Asynchronous Message-Passing Systems. CoRR (2016)
Brice Nédelec, Pascal Molli, Achour Mostéfaoui
CRATE: Writing Stories Together with our Browsers. WWW (Companion Volume) (2016)
Matthieu Perrin, Matoula Petrolia, Achour Mostéfaoui, Claude Jard
On Composition and Implementation of Sequential Consistency (Extended Version). CoRR (2016)
Achour Mostéfaoui, Michel Raynal
Signature-Free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n2) Messages, and Constant Time. SIROCCO (2015)
Matthieu Perrin, Achour Mostéfaoui, Claude Jard
Brief Announcement: Update Consistency in Partitionable Systems. CoRR (2015)
Nicolo Rivetti, Yann Busnel, Achour Mostéfaoui
Efficiently Summarizing Data Streams over Sliding Windows. NCA (2015)
Matthieu Perrin, Claude Jard, Achour Mostéfaoui
Tracking Causal Dependencies in Web Services Orchestrations Defined in ORC. CoRR (2015)
Achour Mostéfaoui, Hamouma Moumen, Michel Raynal
Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time. J. ACM 62 (4) (2015)
Emmanuelle Anceaume, François Castella, Achour Mostéfaoui, Bruno Sericola
A Message-Passing and Adaptive Implementation of the Randomized Test-and-Set Object. NCA (2015)
Zohir Bouzid, Achour Mostéfaoui, Michel Raynal
Minimal Synchrony for Byzantine Consensus. PODC (2015)
Matthieu Perrin, Achour Mostéfaoui, Claude Jard
Update Consistency for Wait-Free Concurrent Objects. IPDPS (2015)
Matthieu Perrin, Achour Mostéfaoui, Claude Jard
Update Consistency for Wait-free Concurrent Objects. CoRR (2015)
Matthieu Perrin, Claude Jard, Achour Mostéfaoui
Tracking Causal Dependencies in Web Services Orchestrations Defined in ORC. NETYS (2015)
Matthieu Perrin, Achour Mostéfaoui, Claude Jard
Update Consistency in Partitionable Systems. DISC (2014)
Achour Mostéfaoui, Moumen Hamouma, Michel Raynal
) messages. PODC (2014)
Dariusz R. Kowalski, Achour Mostéfaoui
Synchronous byzantine agreement with nearly a cubic number of communication bits: synchronous byzantine agreement with nearly a cubic number of communication bits. PODC (2013)
Achour Mostéfaoui, Andreas Polze, Carlos Baquero, Paul D. Ezhilchelvan, Lars Lundberg
Topic 8: Distributed Systems and Algorithms - (Introduction). Euro-Par (2013)
Brice Nédelec, Pascal Molli, Achour Mostéfaoui, Emmanuel Desmontils
Concurrency Effects Over Variable-size Identifiers in Distributed Collaborative Editing. DChanges (2013)
Brice Nédelec, Pascal Molli, Achour Mostéfaoui, Emmanuel Desmontils
LSEQ: an adaptive structure for sequences in distributed collaborative editing. ACM Symposium on Document Engineering (2013)
Achour Mostéfaoui, Michel Raynal, Julien Stainer
Chasing the Weakest Failure Detector for k-Set Agreement in Message-Passing Systems. NCA (2012)
Achour Mostéfaoui, Michel Raynal
Looking for Efficient Implementations of Concurrent Objects. PaCT (2011)
Achour Mostéfaoui, Michel Raynal, Julien Stainer
Relations Linking Failure Detectors Associated with k-Set Agreement in Message-Passing Systems. SSS (2011)
Olivier Baldellon, Achour Mostéfaoui, Michel Raynal
A Necessary and Sufficient Synchrony Condition for Solving Byzantine Consensus in Symmetric Networks. ICDCN (2011)
Marin Bertier, Achour Mostéfaoui, Gilles Trédan
Low-Cost Secret-Sharing in Sensor Networks. HASE (2010)
Achour Mostéfaoui, Michel Raynal, Corentin Travers
Narrowing power vs efficiency in synchronous set agreement: Relationship, algorithms and lower bound. Theor. Comput. Sci. 411 (1) (2010)
Moumen Hamouma, Achour Mostéfaoui
Time-Free Authenticated Byzantine Consensus. NCA (2010)
Achour Mostéfaoui, Michel Raynal
Signature-Free Broadcast-Based Intrusion Tolerance: Never Decide a Byzantine Value. OPODIS (2010)
Anne-Marie Kermarrec, Achour Mostéfaoui, Michel Raynal, Gilles Trédan, Aline Carneiro Viana
Large-Scale Networked Systems: From Anarchy to Geometric Self-structuring. ICDCN (2009)
Eli Gafni, Achour Mostéfaoui, Michel Raynal, Corentin Travers
From adaptive renaming to set agreement. Theor. Comput. Sci. 410 (14) (2009)
Achour Mostéfaoui, Michel Raynal, Gilles Trédan
On the Fly Estimation of the Processes that Are Alive in an Asynchronous Message-Passing System. IEEE Trans. Parallel Distributed Syst. 20 (6) (2009)
Achour Mostéfaoui
What Agreement Problems Owe Michel. DISC (2009)
Anne-Marie Kermarrec, Achour Mostéfaoui, Michel Raynal, Gilles Trédan, Aline Carneiro Viana
From anarchy to geometric structuring: the power of virtual coordinates. PODC (2008)
Vincent Gramoli, Anne-Marie Kermarrec, Achour Mostéfaoui, Michel Raynal, Bruno Sericola
Core Persistence in Peer-to-Peer Systems: Relating Size to Lifetime CoRR (2008)
Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Corentin Travers
The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement. SIAM J. Comput. 38 (4) (2008)
Achour Mostéfaoui, Michel Raynal, Corentin Travers
Narrowing Power vs. Efficiency in Synchronous Set Agreement. ICDCN (2008)
Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Corentin Travers
On the computability power and the robustness of set agreement-oriented failure detector classes. Distributed Comput. 21 (3) (2008)
Achour Mostéfaoui, Eiko Yoneki
RDDS 2008 PC Co-chairs' Message. OTM Workshops (2008)
Achour Mostéfaoui, Michel Raynal, Corentin Travers
From Renaming to Set Agreement. SIROCCO (2007)
Luís E. T. Rodrigues, Achour Mostéfaoui, Christof Fetzer, Philippas Tsigas
Topic 8 Distributed Systems and Algorithms. Euro-Par (2007)
Roy Friedman, Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal
Asynchronous Agreement and Its Relation with Error-Correcting Codes. IEEE Trans. Computers 56 (7) (2007)
Achour Mostéfaoui
Towards a Computing Model for Open Distributed Systems. PaCT (2007)
Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Corentin Travers
From omega to Omega: A simple bounded quiescent reliable broadcast-based transformation. J. Parallel Distributed Comput. 67 (1) (2007)
Moumen Hamouma, Achour Mostéfaoui, Gilles Trédan
Byzantine Consensus with Few Synchronous Links. OPODIS (2007)
Achour Mostéfaoui, Gilles Trédan
Towards the minimal synchrony for byzantine consensus. PODC (2007)
Roy Friedman, Achour Mostéfaoui, Michel Raynal
On the Respective Power of *P and *S to Solve One-Shot Agreement Problems. IEEE Trans. Parallel Distributed Syst. 18 (5) (2007)
Achour Mostéfaoui, Eric Mourgaya, Michel Raynal, Corentin Travers
A Time-free Assumption to Implement Eventual Leadership. Parallel Process. Lett. 16 (2) (2006)
Achour Mostéfaoui, Michel Raynal, Corentin Travers, Sergio Rajsbaum
From Failure Detectors with Limited Scope Accuracy to System-wide Leadership. AINA (1) (2006)
Achour Mostéfaoui, Michel Raynal, Corentin Travers
Time-Free and Timer-Based Assumptions Can Be Combined to Obtain Eventual Leadership. IEEE Trans. Parallel Distributed Syst. 17 (7) (2006)
Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Corentin Travers
Irreducibility and additivity of set agreement-oriented failure detector classes. PODC (2006)
Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal
Synchronous condition-based consensus. Distributed Comput. 18 (5) (2006)
Achour Mostéfaoui, Michel Raynal, Corentin Travers
to Wait-Free Adaptive (2p-[p/k])-Renaming Via k-Set Agreement. DISC (2006)
Vincent Gramoli, Anne-Marie Kermarrec, Achour Mostéfaoui, Michel Raynal, Bruno Sericola
Core Persistence in Peer-to-Peer Systems: Relating Size to Lifetime. OTM Workshops (2) (2006)
Achour Mostéfaoui, Michel Raynal, Gilles Trédan
On the fly estimation of the processes that are alive/crashed in an asynchronous message-passing system. PRDC (2006)

Achour Mostéfaoui.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Achour Mostéfaoui