default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAchour Mostéfaoui
Person information
- affiliation: IRISA Rennes
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c116]Vincent Kowalski
, Achour Mostéfaoui, Matthieu Perrin:
Invited Paper: Causal Mutual Byzantine Broadcast. ApPLIED@PODC 2024: 1-8- [c115]Vincent Kowalski, Achour Mostéfaoui, Matthieu Perrin:
An Optimal Byzantine SCD-Broadcast Protocol. EDCC 2024: 139-146 - [c114]Achour Mostéfaoui, Matthieu Perrin, Julien Weibel:
Brief Announcement: Randomized Consensus: Common Coins Are not the Holy Grail! PODC 2024: 36-39 - [c113]Sylvain Gay, Achour Mostéfaoui, Matthieu Perrin:
Brief Announcement: No Broadcast Abstraction Characterizes k-Set-Agreement in Message-Passing Systems. PODC 2024: 343-346 - 2023
- [j46]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): 1-15 (2023) - [c112]Vincent Kowalski, Achour Mostéfaoui, Matthieu Perrin:
Atomic Register Abstractions for Byzantine-Prone Distributed Systems. OPODIS 2023: 35:1-35:20 - [c111]Mathilde Déprés, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal:
Brief Announcement: The MBroadcast Abstraction. PODC 2023: 282-285 - [c110]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: 16:1-16:24 - 2022
- [j45]Matthieu Perrin, Achour Mostéfaoui, Grégoire Bonin, Ludmila Courtillat-Piazza:
Extending the wait-free hierarchy to multi-threaded systems. Distributed Comput. 35(4): 375-398 (2022) - 2021
- [j44]Brice Nédelec, Pascal Molli, Achour Mostéfaoui:
A scalable sequence encoding for collaborative editing. Concurr. Comput. Pract. Exp. 33(8) (2021) - [j43]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: 49-68 (2021) - [c109]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: 11:1-11:15 - 2020
- [c108]Matthieu Perrin, Achour Mostéfaoui, Grégoire Bonin:
Extending the Wait-free Hierarchy to Multi-Threaded Systems. PODC 2020: 21-30
2010 – 2019
- 2019
- [j42]Achour Mostéfaoui, Michel Raynal, Matthieu Roy:
Time-efficient read/write register in crash-prone asynchronous message-passing systems. Computing 101(1): 3-17 (2019) - [j41]Achour Mostéfaoui, Matthieu Perrin, Michel Raynal, Jiannong Cao:
Crash-tolerant causal broadcast in O(n) messages. Inf. Process. Lett. 151 (2019) - [c107]Grégoire Bonin, Achour Mostéfaoui, Matthieu Perrin:
Does the Operational Model Capture Partition Tolerance in Distributed Systems? PaCT 2019: 400-407 - [c106]Achour Mostéfaoui, Matthieu Perrin, Michel Raynal:
A New Insight into Local Coin-Based Randomized Consensus. PRDC 2019: 207-216 - [c105]Grégoire Bonin, Achour Mostéfaoui, Matthieu Perrin:
Brief Announcement: Wait-Free Universality of Consensus in the Infinite Arrival Model. DISC 2019: 38:1-38:3 - [i17]Grégoire Bonin, Achour Mostéfaoui, Matthieu Perrin:
Wait-Free Universality of Consensus in the Infinite Arrival Model. CoRR abs/1908.02063 (2019) - 2018
- [j40]Achour Mostéfaoui, Matthieu Perrin, Michel Raynal:
Extending Causal Consistency to any Object Defined by a Sequential Specification. Bull. EATCS 125 (2018) - [j39]Achour Mostéfaoui, Matthieu Perrin, Michel Raynal:
A Simple Object that Spans the Whole Consensus Hierarchy. Parallel Process. Lett. 28(2): 1850006:1-1850006:9 (2018) - [j38]Achour Mostéfaoui, Hamouma Moumen, Michel Raynal:
Randomized k-set agreement in crash-prone and Byzantine asynchronous systems. Theor. Comput. Sci. 709: 80-97 (2018) - [j37]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): 629-661 (2018) - [c104]Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal:
Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits. ICDCN 2018: 7:1-7:10 - [c103]Brice Nédelec, Pascal Molli, Achour Mostéfaoui:
Causal Broadcast: How to Forget?. OPODIS 2018: 20:1-20:16 - [c102]Brice Nédelec, Pascal Molli, Achour Mostéfaoui:
Breaking the Scalability Barrier of Causal Broadcast for Large and Dynamic Systems. SRDS 2018: 51-60 - [i16]Achour Mostéfaoui, Matthieu Perrin, Michel Raynal:
A Simple Object that Spans the Whole Consensus Hierarchy. CoRR abs/1802.00678 (2018) - [i15]Achour Mostéfaoui, Matthieu Perrin, Michel Raynal:
Extending Causal Consistency to any Object Defined by a Sequential Specification. CoRR abs/1802.00706 (2018) - [i14]Brice Nédelec, Pascal Molli, Achour Mostéfaoui:
Breaking the Scalability Barrier of Causal Broadcast for Large and Dynamic Systems. CoRR abs/1805.05201 (2018) - 2017
- [j36]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. Acta Informatica 54(5): 501-520 (2017) - [j35]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): 677-694 (2017) - [c101]Achour Mostéfaoui, Stéphane Weiss:
Probabilistic Causal Message Ordering. PaCT 2017: 315-326 - [c100]Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal:
Which Broadcast Abstraction Captures k-Set Agreement?. DISC 2017: 27:1-27:16 - [i13]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 abs/1702.08176 (2017) - [i12]Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal:
Which Broadcast Abstraction Captures $k$-Set Agreement? CoRR abs/1705.04835 (2017) - [i11]Damien Imbs, Achour Mostéfaoui, Matthieu Perrin, Michel Raynal:
Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits. CoRR abs/1706.05267 (2017) - 2016
- [j34]Achour Mostéfaoui, Michel Raynal:
Intrusion-Tolerant Broadcast and Agreement Abstractions in the Presence of Byzantine Processes. IEEE Trans. Parallel Distributed Syst. 27(4): 1085-1098 (2016) - [c99]Achour Mostéfaoui, Hamouma Moumen, Michel Raynal:
Modular randomized byzantine k-set agreement in asynchronous message-passing systems. ICDCN 2016: 5:1-5:10 - [c98]Achour Mostéfaoui, Michel Raynal:
Time-Efficient Read/Write Register in Crash-Prone Asynchronous Message-Passing Systems. NETYS 2016: 250-265 - [c97]Achour Mostéfaoui, Michel Raynal:
Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems. PODC 2016: 381-389 - [c96]Matthieu Perrin, Achour Mostéfaoui, Claude Jard:
Causal consistency: beyond memory. PPoPP 2016: 26:1-26:12 - [c95]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: 197-206 - [c94]Matthieu Perrin, Matoula Petrolia, Achour Mostéfaoui, Claude Jard:
On Composition and Implementation of Sequential Consistency. DISC 2016: 284-297 - [c93]Brice Nédelec, Pascal Molli, Achour Mostéfaoui:
CRATE: Writing Stories Together with our Browsers. WWW (Companion Volume) 2016: 231-234 - [i10]Achour Mostéfaoui, Michel Raynal:
Time-Efficient Read/Write Register in Crash-prone Asynchronous Message-Passing Systems. CoRR abs/1601.04820 (2016) - [i9]Achour Mostéfaoui, Michel Raynal:
Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems. CoRR abs/1602.02695 (2016) - [i8]Matthieu Perrin, Achour Mostéfaoui, Claude Jard:
Causal Consistency: Beyond Memory. CoRR abs/1603.04199 (2016) - [i7]Achour Mostéfaoui, Matoula Petrolia, Michel Raynal, Claude Jard:
Atomic Read/Write Memory in Signature-free Byzantine Asynchronous Message-passing Systems. CoRR abs/1604.08161 (2016) - [i6]Matthieu Perrin, Matoula Petrolia, Achour Mostéfaoui, Claude Jard:
On Composition and Implementation of Sequential Consistency (Extended Version). CoRR abs/1607.05596 (2016) - [i5]Matthieu Perrin, Matoula Petrolia, Achour Mostéfaoui, Claude Jard:
On Composition and Implementation of Sequential Consistency. CoRR abs/1607.06258 (2016) - 2015
- [j33]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): 31:1-31:21 (2015) - [c92]Matthieu Perrin, Achour Mostéfaoui, Claude Jard:
Update Consistency for Wait-Free Concurrent Objects. IPDPS 2015: 219-228 - [c91]Nicolo Rivetti, Yann Busnel, Achour Mostéfaoui:
Efficiently Summarizing Data Streams over Sliding Windows. NCA 2015: 151-158 - [c90]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: 167-175 - [c89]Matthieu Perrin, Claude Jard, Achour Mostéfaoui:
Tracking Causal Dependencies in Web Services Orchestrations Defined in ORC. NETYS 2015: 382-396 - [c88]Zohir Bouzid, Achour Mostéfaoui, Michel Raynal:
Minimal Synchrony for Byzantine Consensus. PODC 2015: 461-470 - [c87]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: 194-208 - [i4]Matthieu Perrin, Achour Mostéfaoui, Claude Jard:
Update Consistency for Wait-free Concurrent Objects. CoRR abs/1501.02165 (2015) - [i3]Matthieu Perrin, Achour Mostéfaoui, Claude Jard:
Brief Announcement: Update Consistency in Partitionable Systems. CoRR abs/1501.02175 (2015) - [i2]Matthieu Perrin, Claude Jard, Achour Mostéfaoui:
Tracking Causal Dependencies in Web Services Orchestrations Defined in ORC. CoRR abs/1505.06299 (2015) - 2014
- [c86]Achour Mostéfaoui, Moumen Hamouma, Michel Raynal:
Signature-free asynchronous byzantine consensus with t 2<n/3 and o(n2) messages. PODC 2014: 2-9 - [c85]Matthieu Perrin, Achour Mostéfaoui, Claude Jard:
Update Consistency in Partitionable Systems. DISC 2014: 546-549 - 2013
- [c84]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: 37-46 - [c83]Brice Nédelec, Pascal Molli, Achour Mostéfaoui, Emmanuel Desmontils:
Concurrency Effects Over Variable-size Identifiers in Distributed Collaborative Editing. DChanges 2013 - [c82]Achour Mostéfaoui, Andreas Polze, Carlos Baquero, Paul D. Ezhilchelvan, Lars Lundberg:
Topic 8: Distributed Systems and Algorithms - (Introduction). Euro-Par 2013: 367-368 - [c81]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: 84-91 - 2012
- [c80]Achour Mostéfaoui, Michel Raynal, Julien Stainer:
Chasing the Weakest Failure Detector for k-Set Agreement in Message-Passing Systems. NCA 2012: 44-51 - 2011
- [c79]Olivier Baldellon, Achour Mostéfaoui, Michel Raynal:
A Necessary and Sufficient Synchrony Condition for Solving Byzantine Consensus in Symmetric Networks. ICDCN 2011: 215-226 - [c78]Achour Mostéfaoui, Michel Raynal:
Looking for Efficient Implementations of Concurrent Objects. PaCT 2011: 74-87 - [c77]Achour Mostéfaoui, Michel Raynal, Julien Stainer:
Relations Linking Failure Detectors Associated with k-Set Agreement in Message-Passing Systems. SSS 2011: 341-355 - 2010
- [j32]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): 58-69 (2010) - [c76]Marin Bertier, Achour Mostéfaoui, Gilles Trédan:
Low-Cost Secret-Sharing in Sensor Networks. HASE 2010: 1-9 - [c75]Moumen Hamouma, Achour Mostéfaoui:
Time-Free Authenticated Byzantine Consensus. NCA 2010: 140-146 - [c74]Achour Mostéfaoui, Michel Raynal:
Signature-Free Broadcast-Based Intrusion Tolerance: Never Decide a Byzantine Value. OPODIS 2010: 143-158
2000 – 2009
- 2009
- [j31]Eli Gafni, Achour Mostéfaoui, Michel Raynal, Corentin Travers:
From adaptive renaming to set agreement. Theor. Comput. Sci. 410(14): 1328-1335 (2009) - [j30]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): 778-787 (2009) - [c73]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: 25-36 - [c72]Achour Mostéfaoui:
What Agreement Problems Owe Michel. DISC 2009: 5 - 2008
- [j29]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): 201-222 (2008) - [j28]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): 1574-1601 (2008) - [c71]Achour Mostéfaoui, Michel Raynal, Corentin Travers:
Narrowing Power vs. Efficiency in Synchronous Set Agreement. ICDCN 2008: 99-111 - [c70]Achour Mostéfaoui, Eiko Yoneki:
RDDS 2008 PC Co-chairs' Message. OTM Workshops 2008: 893 - [c69]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: 435 - [i1]Vincent Gramoli, Anne-Marie Kermarrec, Achour Mostéfaoui, Michel Raynal, Bruno Sericola:
Core Persistence in Peer-to-Peer Systems: Relating Size to Lifetime. CoRR abs/0801.1419 (2008) - 2007
- [j27]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): 125-129 (2007) - [j26]Roy Friedman, Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal:
Asynchronous Agreement and Its Relation with Error-Correcting Codes. IEEE Trans. Computers 56(7): 865-875 (2007) - [j25]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): 589-597 (2007) - [c68]Luís E. T. Rodrigues, Achour Mostéfaoui, Christof Fetzer, Philippas Tsigas:
Topic 8 Distributed Systems and Algorithms. Euro-Par 2007: 549 - [c67]Moumen Hamouma, Achour Mostéfaoui, Gilles Trédan:
Byzantine Consensus with Few Synchronous Links. OPODIS 2007: 76-89 - [c66]Achour Mostéfaoui:
Towards a Computing Model for Open Distributed Systems. PaCT 2007: 74-79 - [c65]Achour Mostéfaoui, Gilles Trédan:
Towards the minimal synchrony for byzantine consensus. PODC 2007: 314-315 - [c64]Achour Mostéfaoui, Michel Raynal, Corentin Travers:
From Renaming to Set Agreement. SIROCCO 2007: 66-80 - 2006
- [j24]Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal:
Synchronous condition-based consensus. Distributed Comput. 18(5): 325-343 (2006) - [j23]Achour Mostéfaoui, Eric Mourgaya, Michel Raynal, Corentin Travers:
A Time-free Assumption to Implement Eventual Leadership. Parallel Process. Lett. 16(2): 189-208 (2006) - [j22]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): 656-666 (2006) - [c63]Achour Mostéfaoui, Michel Raynal, Corentin Travers, Sergio Rajsbaum:
From Failure Detectors with Limited Scope Accuracy to System-wide Leadership. AINA (1) 2006: 81-86 - [c62]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: 1470-1479 - [c61]Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Corentin Travers:
Irreducibility and additivity of set agreement-oriented failure detector classes. PODC 2006: 153-162 - [c60]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: 259-266 - [c59]Achour Mostéfaoui, Michel Raynal, Corentin Travers:
Exploring Gafni's Reduction Land: From Omegak to Wait-Free Adaptive (2p-[p/k])-Renaming Via k-Set Agreement. DISC 2006: 1-15 - 2005
- [j21]Roy Friedman, Achour Mostéfaoui, Michel Raynal:
Asynchronous bounded lifetime failure detectors. Inf. Process. Lett. 94(2): 85-91 (2005) - [j20]Roy Friedman, Achour Mostéfaoui, Michel Raynal:
$\diamondsuit {\mathcal P}_{mute}$-based Consensus for Asynchronous Byzantine Systems. Parallel Process. Lett. 15(1-2): 169-182 (2005) - [j19]Roy Friedman, Achour Mostéfaoui, Michel Raynal:
Simple and Efficient Oracle-Based Consensus Protocols for Asynchronous Byzantine Systems. IEEE Trans. Dependable Secur. Comput. 2(1): 46-56 (2005) - [c58]Roy Friedman, Achour Mostéfaoui, Michel Raynal:
Building and Using Quorums Despite any Number of Process of Crashes. EDCC 2005: 2-19 - [c57]Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal:
The combined power of conditions and failure detectors to solve asynchronous set agreement. PODC 2005: 179-188 - [c56]Roy Friedman, Achour Mostéfaoui, Michel Raynal:
Intersecting Sets: a Basic Abstraction for Asynchronous Agreement Problems. PRDC 2005: 15-22 - [c55]Achour Mostéfaoui, Michel Raynal, Corentin Travers, Stacy Patterson, Divyakant Agrawal, Amr El Abbadi:
From Static Distributed Systems to Dynamic Systems. SRDS 2005: 109-118 - 2004
- [j18]Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Matthieu Roy:
Condition-based consensus solvability: a hierarchy of conditions and efficient protocols. Distributed Comput. 17(1): 1-20 (2004) - [j17]Roy Friedman, Achour Mostéfaoui, Michel Raynal:
A weakest failure detector-based asynchronous consensus protocol for f<n. Inf. Process. Lett. 90(1): 39-46 (2004) - [j16]Emmanuelle Anceaume, Antonio Fernández, Achour Mostéfaoui, Gil Neiger, Michel Raynal:
A necessary and sufficient condition for transforming limited accuracy failure detectors. J. Comput. Syst. Sci. 68(1): 123-133 (2004) - [c54]Roy Friedman, Achour Mostéfaoui, Michel Raynal:
The Notion of Veto Number for Distributed Agreement Problems. IWDC 2004: 315-325 - [c53]Roy Friedman, Achour Mostéfaoui, Michel Raynal:
Brief announcement: veto number and the respective power of eventual failure detectors. PODC 2004: 398 - [c52]Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal:
Brief announcement: the synchronous condition-based consensus hierarchy. PODC 2004: 399 - [c51]Achour Mostéfaoui, David Powell, Michel Raynal:
A Hybrid Approach for Building Eventually Accurate Failure Detectors. PRDC 2004: 57-65 - [c50]Achour Mostéfaoui, Michel Raynal, Corentin Travers:
Crash-Resilient Time-Free Eventual Leadership. SRDS 2004: 208-217 - [c49]Roy Friedman, Achour Mostéfaoui, Michel Raynal:
Simple and Efficient Oracle-Based Consensus Protocols for Asynchronous Byzantine Systems. SRDS 2004: 228-237 - [c48]Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal:
The Synchronous Condition-Based Consensus Hierarchy. DISC 2004: 1-15 - [c47]Roy Friedman, Achour Mostéfaoui, Michel Raynal:
The Notion of Veto Number and the Respective Power of OP and OS to Solve One-Shot Agreement Problems. DISC 2004: 41-55 - 2003
- [j15]Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal:
Conditions on input vectors for consensus solvability in asynchronous distributed systems. J. ACM 50(6): 922-954 (2003) - [c46]Roy Friedman, Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal:
Using Error-Correcting Codes to Solve Distributed Agreement Problems: A Future Direction in Distributed Computing? Future Directions in Distributed Computing 2003: 17-21 - [c45]Achour Mostéfaoui, Eric Mourgaya, Michel Raynal:
Asynchronous Implementation of Failure Detectors. DSN 2003: 351-360 - [c44]Achour Mostéfaoui, Eric Mourgaya, Philippe Raipin Parvédy, Michel Raynal:
Evaluating the Condition-Based Approach to Solve Consensus. DSN 2003: 541-550 - [c43]Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Matthieu Roy:
A Hierarchy of Conditions for Asynchronous Interactive Consistency. PaCT 2003: 130-140 - [c42]Matthieu Roy, Achour Mostéfaoui:
Single-Write Safe Consensus using Constrained Inputs. SIROCCO 2003: 291-306 - [c41]Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal:
Using Conditions to Expedite Consensus in Synchronous Distributed Systems. DISC 2003: 249-263 - 2002
- [j14]Achour Mostéfaoui, Eric Mourgaya, Michel Raynal:
An introduction to oracles for asynchronous distributed systems. Future Gener. Comput. Syst. 18(6): 757-767 (2002) - [j13]Jean-Michel Hélary, Achour Mostéfaoui, Michel Raynal:
Interval Consistency of Asynchronous Distributed Computations. J. Comput. Syst. Sci. 64(2): 329-349 (2002) - [j12]Michel Hurfin, Achour Mostéfaoui, Michel Raynal:
A Versatile Family of Consensus Protocols Based on Chandra-Toueg's Unreliable Failure Detectors. IEEE Trans. Computers 51(4): 395-408 (2002) - [c40]Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal:
A Versatile and Modular Consensus Protoco. DSN 2002: 364-373 - [c39]Achour Mostéfaoui, Michel Raynal, Matthieu Roy, Divyakant Agrawal, Amr El Abbadi:
Towards a formal model for view maintenance in data warehouses. PODC 2002: 129 - [c38]Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal:
Asynchronous interactive consistency and its relation with error-correcting codes. PODC 2002: 253 - [c37]Divyakant Agrawal, Amr El Abbadi, Achour Mostéfaoui, Michel Raynal, Matthieu Roy:
The Lord of the Rings: Efficient Maintenance of Views at Data Warehouses. DISC 2002: 33-47 - [c36]Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Matthieu Roy:
Condition-Based Protocols for Set Agreement Problems. DISC 2002: 48-62 - [c35]Roy Friedman, Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal:
Distributed Agreement and Its Relation with Error-Correcting Codes. DISC 2002: 63-87 - 2001
- [j11]Achour Mostéfaoui, Michel Raynal, Paulo Veríssimo:
The logically instantaneous communication mode: a communication abstraction. Future Gener. Comput. Syst. 17(6): 669-678 (2001) - [j10]Roberto Baldoni, Jean-Michel Hélary, Achour Mostéfaoui, Michel Raynal:
Impossibility of scalar clock-based communication-induced checkpointing protocols ensuring the RDT property. Inf. Process. Lett. 80(2): 105-111 (2001) - [j9]Achour Mostéfaoui, Michel Raynal:
Leader-Based Consensus. Parallel Process. Lett. 11(1): 95-107 (2001) - [j8]Udo Fritzke Jr., Philippe Ingels, Achour Mostéfaoui, Michel Raynal:
Consensus-Based Fault-Tolerant Total Order Multicast. IEEE Trans. Parallel Distributed Syst. 12(2): 147-156 (2001) - [c34]Achour Mostéfaoui, Michel Raynal:
A Condition for k-Set Agreement in Asynchronous Distributed Systems. IPDPS 2001: 78 - [c33]Paul D. Ezhilchelvan, Achour Mostéfaoui, Michel Raynal:
Randomized Multivalued Consensus. ISORC 2001: 195-200 - [c32]Francisco Vilar Brasileiro, Fabíola Greve, Achour Mostéfaoui, Michel Raynal:
Consensus in One Communication Step. PaCT 2001: 42-50 - [c31]Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Matthieu Roy:
A hierarchy of conditions for consensus solvability. PODC 2001: 151-160 - [c30]Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal, Matthieu Roy:
Efficient Condition-Based Consensus. SIROCCO 2001: 275-292 - [c29]Achour Mostéfaoui, Michel Raynal:
Randomized k-set agreement. SPAA 2001: 291-297 - [c28]Michel Hurfin, Achour Mostéfaoui, Michel Raynal, Raimundo A. Macêdo:
A Consensus Protocol Based on a Weak FailureDetector and a Sliding Round Window. SRDS 2001: 120-129 - [c27]Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal:
Conditions on input vectors for consensus solvability in asynchronous distributed systems. STOC 2001: 153-162 - 2000
- [j7]Jean-Michel Hélary, Achour Mostéfaoui, Robert H. B. Netzer, Michel Raynal:
Communication-Based Prevention of Useless Checkpoints in Fistributed Computations. Distributed Comput. 13(1): 29-43 (2000) - [j6]Achour Mostéfaoui, Michel Raynal, Frederic Tronel:
From Binary Consensus to Multivalued Consensus in asynchronous message-passing systems. Inf. Process. Lett. 73(5-6): 207-212 (2000) - [j5]Jean-Michel Hélary, Michel Hurfin, Achour Mostéfaoui, Michel Raynal, Frederic Tronel:
Computing Global Functions in Asynchronous Distributed Systems with Perfect Failure Detectors. IEEE Trans. Parallel Distributed Syst. 11(9): 897-909 (2000) - [c26]Achour Mostéfaoui, Michel Raynal, Frederic Tronel:
The Best of Both Worlds: A Hybrid Approach to Solve Consensus. DSN 2000: 513-522 - [c25]Jean-Michel Hélary, Michel Hurfin, Achour Mostéfaoui, Michel Raynal, Frederic Tronel:
Computing Global Functions in Asynchronous Distributed Systems Prone to Process Crashes. ICDCS 2000: 584-591 - [c24]Achour Mostéfaoui, Michel Raynal:
Consensus Based on Failure Detectors with a Perpetual Accuracy Property. IPDPS 2000: 514-519 - [c23]Achour Mostéfaoui, Michel Raynal:
k-set agreement with limited accuracy failure detectors. PODC 2000: 143-152 - [c22]Achour Mostéfaoui, Michel Raynal:
Low cost consensus-based Atomic Broadcast. PRDC 2000: 45-52
1990 – 1999
- 1999
- [j4]Jean-Michel Hélary, Achour Mostéfaoui, Michel Raynal:
Communication-Induced Determination of Consistent Snapshots. IEEE Trans. Parallel Distributed Syst. 10(9): 865-877 (1999) - [c21]Rachid Guerraoui, Michel Hurfin, Achour Mostéfaoui, Rui Carlos Oliveira, Michel Raynal, André Schiper:
Consensus in Asynchronous Distributed Systems: A Concise Guided Tour. Advances in Distributed Systems 1999: 33-47 - [c20]Achour Mostéfaoui, Michel Raynal:
Unreliable Failure Detectors with Limited Scope Accuracy and an Application to Consensus. FSTTCS 1999: 329-340 - [c19]Achour Mostéfaoui, Michel Raynal, Makoto Takizawa:
Consistent Lamport Clocks for Asynchronous Groups with Process Crashes. PaCT 1999: 98-107 - [c18]Achour Mostéfaoui, Michel Raynal, Paulo Veríssimo:
Logically Instantaneous Communication on Top of Distributed Memory Parallel Machines. PaCT 1999: 258-270 - [c17]Achour Mostéfaoui, Michel Raynal, Makoto Takizawa:
Logical Clocks for Unreliable Process Groups. PDPTA 1999: 2272-2278 - [c16]Achour Mostéfaoui, Michel Raynal:
Solving Consensus Using Chandra-Toueg's Unreliable Failure Detectors: A General Quorum-Based Approach. DISC 1999: 49-63 - 1998
- [c15]Jean-Michel Hélary, Achour Mostéfaoui, Michel Raynal:
Communication-Induced Determination of Consistent Snapshots. FTCS 1998: 208-217 - [c14]Achour Mostéfaoui, Oliver E. Theel:
Shrinking Timestamp Sizes of Event Ordering Protocols. ICPADS 1998: 193-202 - [c13]Udo Fritzke Jr., Philippe Ingels, Achour Mostéfaoui, Michel Raynal:
Fault-Tolerant Total Order Multicast to Asynchronous Groups. SRDS 1998: 228-234 - [c12]Michel Hurfin, Achour Mostéfaoui, Michel Raynal:
Consensus in Asynchronous Systems Where Processes Can Crash and Recover. SRDS 1998: 280-286 - 1997
- [j3]Roberto Baldoni, Jean-Michel Hélary, Achour Mostéfaoui, Michel Raynal:
Adaptive checkpointing in message passing distributed systems. Int. J. Syst. Sci. 28(11): 1145-1161 (1997) - [c11]Roberto Baldoni, Jean-Michel Hélary, Achour Mostéfaoui, Michel Raynal:
Consistent State Restoration in Shared Memory Systems. APDC 1997: 330-337 - [c10]Roberto Baldoni, Jean-Michel Hélary, Achour Mostéfaoui, Michel Raynal:
A Communication-Induced Checkpointing Protocol that Ensures Rollback-Dependency Trackability. FTCS 1997: 68-77 - [c9]Jean-Michel Hélary, Achour Mostéfaoui, Michel Raynal:
Cycle Prevention in Distributed Checkpointing. OPODIS 1997: 309-318 - [c8]Jean-Michel Hélary, Achour Mostéfaoui, Robert H. B. Netzer, Michel Raynal:
Preventing Useless Checkpoints in Distributed Computations. SRDS 1997: 183-190 - [c7]Jean-Michel Hélary, Achour Mostéfaoui, Michel Raynal:
Virtual Precedence in Asynchronous Systems: Cencept and Applications. WDAG 1997: 170-184 - 1996
- [j2]Roberto Baldoni, Achour Mostéfaoui, Michel Raynal:
Causal Delivery of Messages with Real-Time Data in Unreliable Networks. Real Time Syst. 10(3): 245-262 (1996) - [c6]Achour Mostéfaoui, Michel Raynal:
Efficient Message Logging for Uncoordinated Checkpointing Protocols. EDCC 1996: 353-364 - 1995
- [c5]Roberto Baldoni, Jerzy Brzezinski, Jean-Michel Hélary, Achour Mostéfaoui, Michel Raynal:
Characterization of Consistent Global Checkpoints in Large-Scale Distributed Systems. FTDCS 1995: 314-323 - [c4]Roberto Baldoni, Achour Mostéfaoui, Michel Raynal:
Efficient Causally Ordered Communications for Multimedia Real-Time Applications. HPDC 1995: 140-147 - [c3]Aomar Maddi, Achour Mostéfaoui:
Token Based Distributed Algorithms to the M Resources Allocation Problem. Parallel and Distributed Computing and Systems 1995: 193-196 - 1994
- [j1]Jean-Michel Hélary, Achour Mostéfaoui, Michel Raynal:
A General Scheme for Token- and Tree-Based Distributed Mutual Exclusion Algorithms. IEEE Trans. Parallel Distributed Syst. 5(11): 1185-1196 (1994) - [c2]Achour Mostéfaoui, Michel Raynal:
Definition and Implementation of a Flexible Communication Primitive for Distributed Programming. Applications in Parallel and Distributed Computing 1994: 115-124 - [c1]Jean-Michel Hélary, Achour Mostéfaoui:
A O(log2 n) Fault-Tolerant Distributed Mutual Exclusion Algorithm Based on Open-Cube Structure. ICDCS 1994: 89-96
Coauthor Index
[c111] [c110] [j43] [j42] [j41] [c106] [j40] [j39] [j38] [c104] [i16] [i15] [j36] [j35] [c100] [i13] [i12] [i11] [j34] [c99] [c98] [c97] [i10] [i9] [i7] [j33] [c88] [c87] [c86] [c80] [c79] [c78] [c77] [j32] [c74] [j31] [j30] [c73] [j29] [j28] [c71] [c69] [i1] [j27] [j26] [j25] [c64] [j24] [j23] [j22] [c63] [c62] [c61] [c60] [c59] [j21] [j20] [j19] [c58] [c57] [c56] [c55] [j18] [j17] [j16] [c54] [c53] [c52] [c51] [c50] [c49] [c48] [c47] [j15] [c46] [c45] [c44] [c43] [c41] [j14] [j13] [j12] [c40] [c39] [c38] [c37] [c36] [c35] [j11] [j10] [j9] [j8] [c34] [c33] [c32] [c31] [c30] [c29] [c28] [c27] [j7] [j6] [j5] [c26] [c25] [c24] [c23] [c22] [j4] [c21] [c20] [c19] [c18] [c17] [c16] [c15] [c13] [c12] [j3] [c11] [c10] [c9] [c8] [c7] [j2] [c6] [c5] [c4] [j1] [c2]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-26 18:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
