The following pages link to Achour Mostefaoui (Q294740):
Displaying 50 items.
- From binary consensus to multivalued consensus in asynchronous message-passing systems (Q294742) (← links)
- From \(\diamond \mathcal W\) to \(\omega\) : A simple bounded quiescent reliable broadcast-based transformation (Q868046) (← links)
- (Q1008729) (redirect page) (← links)
- From adaptive renaming to set agreement (Q1008730) (← links)
- Narrowing power vs efficiency in synchronous set agreement: relationship, algorithms and lower bound (Q1041222) (← links)
- Asynchronous bounded lifetime failure detectors (Q1041728) (← links)
- (Q1603359) (redirect page) (← links)
- Impossibility of scalar clock-based communication-induced checkpointing protocols ensuring the RDT property (Q1603361) (← links)
- Interval consistency of asynchronous distributed computations (Q1608322) (← links)
- Randomized \(k\)-set agreement in crash-prone and Byzantine asynchronous systems (Q1686116) (← links)
- Extending the wait-free hierarchy to multi-threaded systems (Q2166369) (← links)
- Time-efficient read/write register in crash-prone asynchronous message-passing systems (Q2218424) (← links)
- Set-constrained delivery broadcast: a communication abstraction for Read/write implementable distributed objects (Q2232592) (← links)
- Crash-tolerant causal broadcast in \(O(n)\) messages (Q2274523) (← links)
- Synchronous condition-based consensus (Q2375299) (← links)
- On the computability power and the robustness of set agreement-oriented failure detector classes (Q2377255) (← links)
- A weakest failure detector-based asynchronous consensus protocol for \(f<n\) (Q2390214) (← links)
- Atomic read/write memory in signature-free Byzantine asynchronous message-passing systems (Q2398211) (← links)
- Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time (Q2406433) (← links)
- A hierarchy of conditions for consensus solvability (Q2787677) (← links)
- Signature-free asynchronous byzantine consensus with t < n/3 and o(n <sup>2</sup> ) messages (Q2943606) (← links)
- Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time (Q3177735) (← links)
- The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement (Q3395045) (← links)
- Conditions on input vectors for consensus solvability in asynchronous distributed systems (Q3452512) (← links)
- Signature-Free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n 2) Messages, and Constant Time (Q3460716) (← links)
- Exploring Gafni’s Reduction Land: From Ω k to Wait-Free Adaptive $(2p-\lceil\frac{p}{k}\rceil)$ -Renaming Via k-Set Agreement (Q3524290) (← links)
- Adaptive checkpointing in message passing distributed systems (Q4392353) (← links)
- (Q4413395) (← links)
- (Q4437113) (← links)
- (Q4437114) (← links)
- (Q4437115) (← links)
- The logically instantaneous communication mode: a communication abstraction (Q4538489) (← links)
- Asynchronous Agreement and Its Relation with Error-Correcting Codes (Q4564181) (← links)
- (Q4778617) (← links)
- An introduction to oracles for asynchronous distributed systems (Q4788311) (← links)
- A Simple Object that Spans the Whole Consensus Hierarchy (Q5087841) (← links)
- Communication-based prevention of useless checkpoints in distributed computations (Q5137893) (← links)
- Condition-based consensus solvability: a hierarchy of conditions and efficient protocols (Q5138500) (← links)
- Conditions on input vectors for consensus solvability in asynchronous distributed systems (Q5175963) (← links)
- Synchronous byzantine agreement with nearly a cubic number of communication bits (Q5176085) (← links)
- k-set agreement with limited accuracy failure detectors (Q5176780) (← links)
- The combined power of conditions and failure detectors to solve asynchronous set agreement (Q5177240) (← links)
- Irreducibility and additivity of set agreement-oriented failure detector classes (Q5177276) (← links)
- (Q5203927) (← links)
- Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems (Q5361960) (← links)
- Towards the minimal synchrony for byzantine consensus (Q5401430) (← links)
- From Renaming to Set Agreement (Q5425961) (← links)
- Narrowing Power vs. Efficiency in Synchronous Set Agreement (Q5445741) (← links)
- The Synchronous Condition-Based Consensus Hierarchy (Q5464188) (← links)
- The Notion of Veto Number and the Respective Power of $\Diamond {\cal P}$ and $\Diamond {\cal S}$ to Solve One-Shot Agreement Problems (Q5464210) (← links)
