Home » Fiche   membre
Fiche   membre Retour à l'annuaire  

Achour MOSTEFAOUI

ENSEIGNANT-CHERCHEUR

HDR

: Achour.Mostefaouiatls2n.fr

Adresse :

Université de Nantes - faculté des Sciences et Techniques ( FST )
Petit Port
2 Chemin de la Houssinière
BP 92208
44322 Nantes Cedex 3

Batiment 34, étage 4, bureau 402


Publications référencées sur HAL

Revues internationales avec comité de lecture (ART_INT)

    • [1] D. Frey, A. Mostefaoui, M. Perrin, P. Roman, F. Taiani. Differentiated consistency for worldwide gossips. In IEEE Transactions on Parallel and Distributed Systems ; éd. Institute of Electrical and Electronics Engineers, 2023, vol. 35, num. 11.
      https://inria.hal.science/hal-03797554
    • [2] M. Perrin, A. Mostefaoui, G. Bonin, L. Courtillat-Piazza. Extending the Wait-free Hierarchy to Multi-Threaded Systems. In Distributed Computing ; éd. Springer Verlag, 2022, vol. 35.
      https://hal.science/hal-03819422
    • [3] B. Nédelec, P. Molli, A. Mostefaoui. A scalable sequence encoding for collaborative editing. In Concurrency and Computation: Practice and Experience ; éd. Wiley, 2021.
      https://hal.science/hal-01552799
    • [4] A. Mostefaoui, M. Raynal, M. Roy. Time-Efficient Read/Write Register in Crash-prone Asynchronous Message-Passing Systems. In Computing ; éd. Springer Verlag, 2019, vol. 101, num. 1.
      https://laas.hal.science/hal-01784210
    • [5] A. Mostefaoui, M. Perrin, M. Raynal, J. Cao. Crash-Tolerant Causal Broadcast in O(n) Messages. In Information Processing Letters ; éd. Elsevier, 2019, vol. 151.
      https://hal.science/hal-02279523
    • [6] A. Mostefaoui, H. Moumen, M. Raynal. Randomized k -set agreement in crash-prone and Byzantine asynchronous systems. In Theoretical Computer Science ; éd. Elsevier, 2018, vol. 709.
      https://hal.science/hal-02056183
    • [7] B. Nédelec, J. Tanke, P. Molli, A. Mostefaoui, D. Frey. An Adaptive Peer-Sampling Protocol for Building Networks of Browsers. In World Wide Web ; éd. Springer Verlag, 2018, vol. 21, num. 3.
      https://inria.hal.science/hal-01619906
    • [8] A. Mostefaoui, M. Perrin, M. Raynal. A Simple Object that Spans the Whole Consensus Hierarchy. In Parallel Processing Letters ; éd. World Scientific Publishing, 2018, vol. 28, num. 02.
      https://hal.science/hal-02053504
    • [9] M. Perrin, A. Mostefaoui, M. Raynal. Extending the Causal Consistency Condition to any Object Defined by a Sequential Specification. In Bulletin- European Association for Theoretical Computer Science ; éd. European Association for Theoretical Computer Science; 1999, 2018.
      https://hal.science/hal-02053316
    • [10] A. Mostefaoui, M. Raynal. Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with t < n/3, O(n${}^2$) messages, and constant time. In Acta Informatica ; éd. Springer Verlag, 2017, vol. 54, num. 5.
      https://inria.hal.science/hal-01660687
    • [11] A. Mostefaoui, M. Petrolia, M. Raynal, C. Jard. Atomic Read/Write Memory in Signature-Free Byzantine Asynchronous Message-Passing Systems. In Proc. of the 15th Int. Conf. on Parallel Computing Technologies (PaCT 2019), 2019, Almaty, France.In Theory of Computing Systems ; éd. Springer Verlag, 2017.
      https://inria.hal.science/hal-01661008
    • [12] A. Mostéfaoui, M. Raynal. Intrusion-Tolerant Broadcast and Agreement Abstractions in the Presence of Byzantine Processes. In IEEE Transactions on Parallel and Distributed Systems ; éd. Institute of Electrical and Electronics Engineers, 2016, vol. 27, num. 4.
      https://hal.science/hal-01176113
    • [13] A. Mostefaoui, M. Raynal. Signature-free Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n 2 ) Messages, and Constant Time *. In Acta Informatica ; éd. Springer Verlag, 2016.
      https://inria.hal.science/hal-03427171
    • [14] A. Mostéfaoui, H. Moumen, M. Raynal. Signature-Free Asynchronous Binary Byzantine Consensus with t$<$n/3, O(n²) Messages, and O(1) Expected Time. In Journal of the ACM (JACM) ; éd. Association for Computing Machinery, 2015, vol. 62.
      https://hal.science/hal-01176110
    • [15] A. Mostefaoui, M. Raynal, C. Travers. Narrowing power vs efficiency in synchronous set agreement: Relationship, algorithms and lower bound. In Theoretical Computer Science ; éd. Elsevier, 2010, vol. 411, num. 1.
      https://hal.science/hal-00543282
    • [16] E. Gafni, A. Mostefaoui, M. Raynal, C. Travers. From adaptive renaming to set agreement. In Theoretical Computer Science ; éd. Elsevier, 2009, vol. 410, num. 14.
      https://hal.science/hal-00432970
    • [17] A. Mostefaoui, M. Raynal, G. Trédan. On the Fly Estimation of the Processes that Are Alive in an Asynchronous Message-Passing System. In IEEE Transactions on Parallel and Distributed Systems ; éd. Institute of Electrical and Electronics Engineers, 2009, vol. 20, num. 6.
      https://hal.science/hal-00432964
    • [18] A. Mostefaoui, S. Rajsbaum, M. Raynal, C. Travers. The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement. In SIAM Journal on Computing ; éd. Society for Industrial and Applied Mathematics, 2008, vol. 38, num. 4.
      https://hal.science/hal-00432973
    • [19] A. Mostefaoui, S. Rajsbaum, M. Raynal, C. Travers. On the computability power and the robustness of set agreement-oriented failure detector classes. In Distributed Computing ; éd. Springer Verlag, 2008, vol. 21, num. 3.
      https://hal.science/hal-00432977
    • [20] A. Mostefaoui, R. Friedman, M. Raynal, S. Rajsbaum. Asynchronous Agreement and Its Relation with Error-Correcting Codes. In IEEE Transactions on Computers ; éd. Institute of Electrical and Electronics Engineers, 2007, vol. 56, num. 7.
      https://inria.hal.science/inria-00338071
    • [21] A. Mostefaoui, S. Rajsbaum, M. Raynal, C. Travers. From omega to Omega: A simple bounded quiescent reliable broadcast-based transformation. In Journal of Parallel and Distributed Computing ; éd. Elsevier, 2007, vol. 67, num. 1.
      https://inria.hal.science/inria-00338081
    • [22] R. Friedman, A. Mostefaoui, M. Raynal. On the Respective Power of *P and *S to Solve One-Shot Agreement Problems. In IEEE Transactions on Parallel and Distributed Systems ; éd. Institute of Electrical and Electronics Engineers, 2007, vol. 18, num. 5.
      https://inria.hal.science/inria-00338084

Conférences internationales avec comité de lecture et actes (COMM_INT)

    • [23] M. Déprés, A. Mostefaoui, M. Perrin, M. Raynal. Quelles Relations entre Lire/Ecrire et Envoyer/Recevoir dans les Systèmes Asynchrones avec Crashs de Processus ?. In AlgoTel 2024 – 26èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, mai 2024, Saint-Briac-sur-Mer, France.
      https://hal.science/hal-04555445
    • [24] V. Kowalski, A. Mostefaoui, M. Perrin. Une Implémentation Optimale pour SCD-Broadcast Byzantin. In AlgoTel 2024 – 26èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, mai 2024, Saint-Briac-sur-Mer, France.
      https://hal.science/hal-04567086v2
    • [25] M. Perrin, A. Mostefaoui, G. Bonin. Extending the Wait-free Hierarchy to Multi-Threaded Systems. In PODC '20: ACM Symposium on Principles of Distributed Computing, août 2020, Virtual Event Italy, France.
      https://hal.science/hal-02941703
    • [26] G. Bonin, A. Mostefaoui, M. Perrin. Does the operational model capture partition tolerance in distributed systems?. In 15th International Conference on Parallel Computing Technologies, août 2019, Astana, Kazakhstan.
      https://hal.science/hal-02484661
    • [27] G. Bonin, A. Mostefaoui, M. Perrin. Brief Announcement: Wait-Free Universality of Consensus in the Infinite Arrival Model. In International Symposium on Distributed Computing (DISC) 2019, octobre 2019, Budapest, Hongrie.
      https://hal.science/hal-02279627
    • [28] A. Mostefaoui, M. Perrin, M. Raynal. A New Insight into Local Coin-Based Randomized Consensus. In PRDC 2019 - 24th IEEE Pacific Rim International Symposium on Dependable Computing, décembre 2019, Kyoto, Japon.
      https://hal.science/hal-02484620
    • [29] D. Imbs, A. Mostefaoui, M. Perrin, M. Raynal. Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits. In ICDCN '18 - 19th International Conference on Distributed Computing and Networking, janvier 2018, Varanasi, Inde.
      https://hal.science/hal-02053261
    • [30] B. Nédelec, P. Molli, A. Mostefaoui. Breaking the Scalability Barrier of Causal Broadcast for Large and Dynamic Systems. In 37th IEEE International Symposium on Reliable Distributed Systems (SRDS), octobre 2018, Salvador de Bahia, Brésil.
      https://inria.hal.science/hal-01778901v2
    • [31] B. Nédelec, P. Molli, A. Mostefaoui. Causal Broadcast: How to Forget?. In The 22nd International Conference on Principles of Distributed Systems (OPODIS), décembre 2018, Hong Kong, Chine.
      https://hal.science/hal-01923830v2
    • [32] A. Mostefaoui, S. Weiss. A Probabilistic Causal Message Ordering Mechanism. In International Conference on Parallel Computing Technologies (PaCT'17), septembre 2017, Nizhny Novgorod, Russie.
      https://hal.science/hal-02056349
    • [33] D. Imbs, A. Mostefaoui, M. Perrin, M. Raynal. Which Broadcast Abstraction Captures k-Set Agreement?. In 31st International Symposium on Distributed Computing (DISC 2017), octobre 2017, Vienna, Autriche.In Andréa W. Richa (éds.), . Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
      https://hal.science/hal-01787801
    • [34] A. Mostefaoui, H. Moumen, M. Raynal. Modular randomized byzantine k-set agreement in asynchronous message-passing systems. In The 17th International Conference on Distributed Computing and Networking (ICDCN'16), janvier 2016, Singapore, Singapour.
      https://hal.science/hal-02056378
    • [35] M. Perrin, A. Mostefaoui, C. Jard. Causal Consistency: Beyond Memory. In 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, mars 2016, Barcelone, Espagne.
      https://hal.science/hal-01286755
    • [36] A. Mostefaoui, M. Raynal. Time-Efficient Read/Write Register in Crash-Prone Asynchronous Message-Passing Systems. In The 4th International Conference on Networked Systems, mai 2016, Marrakech, Maroc.
      https://hal.science/hal-02056397
    • [37] N. Rivetti, Y. Busnel, A. Mostefaoui. Résumer efficacement des flux de données massifs en fenêtre glissante. In ALGOTEL 2016 - 18èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, mai 2016, Bayonne, France.
      https://hal.science/hal-01303882
    • [38] A. Mostefaoui, M. Raynal. Two-Bit Messages are Sufficient to Implement Atomic Read/Write Registers in Crash-prone Systems. In The 2016 ACM Symposium on Principles of Distributed Computing (PODC'16), juillet 2016, Chicago, états-Unis.
      https://hal.science/hal-02056409
    • [39] D. Frey, A. Mostefaoui, M. Perrin, P. Roman, F. Taïani. Speed for the elite, consistency for the masses: differentiating eventual consistency in large-scale distributed systems. In Proceedings of the 2016 IEEE 35th Symposium on Reliable Distributed Systems (SRDS 2016), septembre 2016, Budapest, Hongrie.
      https://inria.hal.science/hal-01344138
    • [40] M. Perrin, M. Petrolia, A. Mostefaoui, C. Jard. On Composition and Implementation of Sequential Consistency. In 30th International Symposium on Distributed Computing, septembre 2016, Paris, France.
      https://hal.science/hal-01347069v2
    • [41] B. Nédelec, P. Molli, A. Mostefaoui. CRATE: Writing Stories Together with our Browsers. In 25th World Wide Web Conference, avril 2016, Montréal, Canada.In ACM (éds.), . , 2016.
      https://hal.science/hal-01303333
    • [42] M. Perrin, C. Jard, A. Mostefaoui. Tracking Causal Dependencies in Web Services Orchestrations Defined in ORC. In NETYS - 3rd International Conference on NETwork sYStems, mai 2015, Agadir, Maroc.
      https://hal.science/hal-01152761
    • [43] A. Mostéfaoui, M. Raynal. Asynchronous Byzantine Systems: From Multivalued to Binary Consensus with t < n/3, O(n²) Messages, O(1) Time, and no Signature. In 22nd International Colloquium on Structural Information & Communication Complexity (SIROCCO'15), juillet 2015, Montserrat, Espagne.
      https://hal.science/hal-01176117
    • [44] Z. Bouzid, A. Mostéfaoui, M. Raynal. Minimal Synchrony for Byzantine Consensus. In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC 2015), juillet 2015, Donostia-San Sebastián, Espagne.
      https://hal.science/hal-01178651
    • [45] M. Perrin, A. Mostefaoui, C. Jard. Update Consistency for Wait-free Concurrent Objects. In IPDPS - IEEE International Parallel & Distributed Processing Symposium, mai 2015, Hyderabad, Inde.In IEEE (éds.), . , 2015.
      https://hal.science/hal-01101657
    • [46] E. Anceaume, F. Castella, A. Mostefaoui, B. Sericola. A Message-Passing and Adaptive Implementation of the Randomized Test-and-Set Object. In International Symposium on Network Computing and Applications (NCA), septembre 2015, Boston, états-Unis.In Avresky, DR (éds.), . IEEE, 2015.
      https://hal.science/hal-01190379
    • [47] N. Rivetti, Y. Busnel, A. Mostefaoui. Efficiently Summarizing Data Streams over Sliding Windows. In IEEE 14th International Symposium on Network Computing and Applications, septembre 2015, Cambrige, états-Unis.In Yann Busnel (éds.), . , 2015.
      https://hal.science/hal-01535693
    • [48] A. Mostefaoui, M. Hamouna, M. Raynal. Signature-Free Asynchronous Byzantine Consensus with $t < n/3$ and $O(n^2)$ Messages. In ACM PODC, juillet 2014, Paris, France.
      https://inria.hal.science/hal-00944019v2
    • [49] M. Perrin, A. Mostefaoui, C. Jard. Brief Announcement: Update Consistency in Partitionable Systems. In DISC14 - 28th International Symposium on Distributed Computing, octobre 2014, Austin, états-Unis.
      https://hal.science/hal-01079112
    • [50] D. Kowalski, A. Mostefaoui. Synchronous byzantine agreement with nearly a cubic number of communication bits. In ACM symposium on Principles of distributed computing (PODC'13), juillet 2013, New-York, états-Unis.
      https://hal.science/hal-01151136
    • [51] B. Nédelec, P. Molli, A. Mostefaoui, E. Desmontils. Concurrency Effects Over Variable-size Identifiers in Distributed Collaborative Editing. In Document Changes: Modeling, Detection, Storage and Visualization, septembre 2013, Florence, Italie.
      https://hal.science/hal-00921655
    • [52] B. Nédelec, P. Molli, A. Mostefaoui, E. Desmontils. LSEQ: an Adaptive Structure for Sequences in Distributed Collaborative Editing. In 13th ACM Symposium on Document Engineering (DocEng), septembre 2013, Florence, Italie.
      https://hal.science/hal-00921633
    • [53] A. Mostefaoui, M. Raynal, J. Stainer. Chasing the Weakest Failure Detector for k-Set Agreement in Message-Passing Systems. In 11th IEEE International Symposium on Network Computing and Applications (NCA 2012), août 2012, Cambridge, états-Unis.
      https://hal.science/hal-01151291
    • [54] O. Baldellon, A. Mostefaoui, M. Raynal. A Necessary and Sufficient Synchrony Condition for Solving Byzantine Consensus in Symmetric Networks. In 12th International Conference on Distributed Computing and Networking (ICDCN'11), janvier 2011, Bangalore, Inde.In Marcos Aguilera et al. (éds.), . Springer Verlag, 2011.
      https://inria.hal.science/hal-00647764
    • [55] O. Baldellon, A. Mostefaoui, M. Raynal. A Symmetric Synchrony Condition for Solving Byzantine Consensus. In 12th International Conference on Distributed Computing and Networking (ICDCN 2011), janvier 2011, Bangalore, Inde.In M.K. Aguilera et al. (éds.), . Springer Verlag, 2011.
      https://inria.hal.science/inria-00544666
    • [56] A. Mostefaoui, M. Raynal. Looking for Efficient Implementations of Concurrent Objects. In 11th International Conference on Parallel Computing Technologies (PaCT'11), septembre 2011, Kazan, Russie.In Victor Malyshkin (éds.), . Springer Verlag, 2011.
      https://inria.hal.science/hal-00647775
    • [57] A. Mostefaoui, M. Raynal, J. Stainer. Relations Linking Failure Detectors Associated with k-Set Agreement in Message-Passing Systems. In 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2011), octobre 2011, Grenoble, France.In Xavier Défago et al. (éds.), . Springer Verlag, 2011.
      https://inria.hal.science/hal-00648465
    • [58] H. Moumen, A. Mostefaoui. Time-Free Authenticated Byzantine Consensus. In 10th IEEE International Symposium on Network Computing and Applications (NCA'11), juillet 2010, Cambridge, MA, états-Unis.In Franck Capello and Hans-Peter Schwefel (éds.), . IEEE, 2010.
      https://inria.hal.science/inria-00544518
    • [59] M. Bertier, A. Mostefaoui, G. Tredan. Low-Cost Secret-Sharing in Sensor Networks. In 12th IEEE International High Assurance Systems Engineering Symposium (HASE 2010), novembre 2010, San Jose, CA, états-Unis.In Sahra Sedigh (éds.), . IEEE, 2010.
      https://inria.hal.science/inria-00544585
    • [60] A. Mostefaoui, M. Raynal. Signature-Free Broadcast-Based Intrusion Tolerance. In 14th International Conference On Principles Of Distributed Systems (OPODIS 2010), décembre 2010, Tozeur, Tunisie.In Chenyang Lu and Toshimitsu Masuzawa and Mohamend Mosbah (éds.), . Springer Verlag, 2010.
      https://inria.hal.science/inria-00544650
    • [61] A. Kermarrec, A. Mostefaoui, M. Raynal, G. Trédan, A. Carneiro Viana. Large-scale networked systems: from anarchy to geometric self-structuring. In 10th International Conference on Distributed Computing and Networking (ICDCN), janvier 2009, Hyderabad, Inde.In Vijay K. Garg, Roger Wattenhofer, Kishore Kothapalli (éds.), . Springer, 2009.
      https://inria.hal.science/inria-00334355
    • [62] A. Mostefaoui. What Agreement Problems Owe Michel. In Distributed Computing, 23rd International Symposium, DISC 2009, septembre 2009, Elche, Espagne.In Idit Keidar (éds.), . Springer, 2009.
      https://hal.science/hal-00432956
    • [63] A. Kermarrec, A. Mostefaoui, M. Raynal, G. Trédan, A. Carneiro Viana. (BA) From Anarchy to Geometric Structuring: the Power of Virtual Coordinates. In Proceedings of ACM Sigact-Sigops Symposium on Principles of Distributed Computing (PODC), août 2008, Toronto, Canada.
      https://inria.hal.science/inria-00334356
    • [64] A. Mostefaoui, M. Raynal, C. Travers. Narrowing Power vs. Efficiency in Synchronous Set Agreement. In 9th International Conference on Distributed Computing and Networking, janvier 2008, Kolkata, Inde.In Shrisha Rao, Mainak Chatterjee and Prasad Jayanti and C. Siva Ram Murthy and Sanjoy Kumar Saha (éds.), . Springer Verlag, 2008.
      https://inria.hal.science/inria-00338093
    • [65] A. Mostefaoui, M. Raynal, C. Travers. From Renaming to Set Agreement. In 14th International Colloquium on Structural Information and Communication Complexity, juin 2007, Castiglioncello, Italie.In Giuseppe Prencipe and Shmuel Zaks (éds.), . Springer Verlag, 2007.
      https://inria.hal.science/inria-00338090
    • [66] A. Mostefaoui, G. Trédan. Towards the minimal synchrony for byzantine consensus. In 26th Annual ACM Symposium on Principles of Distributed Computing, août 2007, Portland, états-Unis.In Indranil Gupta and Roger Wattenhofer (éds.), . ACM, 2007.
      https://inria.hal.science/inria-00338092
    • [67] A. Mostefaoui. Towards a Computing Model for Open Distributed Systems. In Parallel Computing Technologies, 9th International Conference, septembre 2007, Pereslavl-Zalessky, Russie.In Victor E. Malyshkin (éds.), . Springer Verlag, 2007.
      https://inria.hal.science/inria-00338075
    • [68] H. Moumen, A. Mostefaoui, G. Trédan. Byzantine Consensus with Few Synchronous Links. In 11th International Conference On Principles Of Distributed Systems, décembre 2007, Guadeloupe, French West Indies, France.In Eduardo Tovar and Philippas Tsigas and Hacène Fouchal (éds.), . Springer Verlag, 2007.
      https://inria.hal.science/inria-00338059
    • [69] V. Gramoli, A. Kermarrec, A. Mostefaoui, M. Raynal, B. Sericola. Core Persistence in Peer-to-Peer Systems: Relating Size to Lifetime. In Proceedings of the Workshop on Reliability in Decentralized Distributed Systems, novembre 2006, Montpellier, France.
      https://inria.hal.science/inria-00201164

Conférences nationales avec comité de lecture et actes (COMM_NAT)

    • [70] V. Gramoli, A. Kermarrec, A. Mostefaoui, M. Raynal, B. Sericola. Persistance de noyau dans les systèmes dynamiques à grande échelle. In 9ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, mai 2007, Ile d'Oléron, France.
      https://inria.hal.science/inria-00176950

Autres publications (AUTRES)

    • [71] A. Mostefaoui, M. Perrin, J. Weibel. Randomized Consensus: Common Coins Are not the Holy Grail!. Rapport technique, 2024 ; LS2N-Nantes Université.
      https://hal.science/hal-04571212
    • [72] D. Imbs, A. Mostefaoui, M. Perrin, M. Raynal. Another Look at the Implementation of Read/write Registers in Crash-prone Asynchronous Message-Passing Systems (Extended Version). Rapport technique, 2017 ; IRISA, Inria Rennes, LS2N-University of Nantes, Technion - Israel Institute of Technology.
      https://hal.science/hal-01476201
    • [73] A. Mostefaoui, S. Weiss. A Probabilistic Causal Message Ordering Mechanism. Rapport technique, 2017 ; LS2N, Université de Nantes.
      https://hal.science/hal-01527110
    • [74] D. Imbs, A. Mostefaoui, M. Perrin, M. Raynal. Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits. Rapport technique, 2017 ; LIF, Université Aix-Marseille, LINA-University of Nantes, IMDEA Software InstituteInstitut Universitaire de FranceIRISA, Université de Rennes.
      https://hal.science/hal-01540010
    • [75] A. Mostefaoui, M. Raynal. Time-Efficient Read/Write Register in Crash-prone Asynchronous Message-Passing Systems. Rapport technique, 2016 ; IRISA.
      https://inria.hal.science/hal-01256067
    • [76] E. Anceaume, F. Castella, A. Mostefaoui, B. Sericola. Performance Evaluation of a Distributed Synchronization Protocol. Rapport technique, 2016 ; Inria, Irisa, LinaIrmar.
      https://inria.hal.science/hal-01283064
    • [77] D. Frey, A. Mostefaoui, M. Perrin, A. Kermarrec, C. Maddock, A. Mauthe, P. Roman, F. Taïani. D.1.3 – Protocols for emergent localities. Rapport technique, 2016 ; IRISA, LINA-University of Nantes, Inria Rennes Bretagne AtlantiqueLancaster University.
      https://hal.science/hal-01343348
    • [78] M. Perrin, M. Petrolia, A. Mostefaoui, C. Jard. On Composition and Implementation of Sequential Consistency (Extended Version). Rapport technique, 2016 ; LINA-University of Nantes.
      https://hal.science/hal-01346805v4
    • [79] M. Perrin, C. Jard, A. Mostefaoui. Proof of the Instrumented Semantics for Orc. Rapport technique, 2015 ; LINA-University of Nantes.
      https://hal.science/hal-01101340v2
    • [80] D. Frey, A. Mostefaoui, M. Perrin, F. Taïani. D.1.1 – Survey on Weak Consistency Approaches for Large-Scale Systems. Rapport technique, 2015 ; LINA-University of Nantes, IRISA, .
      https://hal.science/hal-01174203
    • [81] N. Rivetti, Y. Busnel, A. Mostefaoui. Efficiently Summarizing Distributed Data Streams over Sliding Windows. Rapport technique, 2015 ; LINA-University of Nantes, Centre de Recherche en Économie et Statistique, Inria Rennes Bretagne Atlantique.
      https://hal.science/hal-01073877v3
    • [82] B. Nédelec, J. Tanke, D. Frey, P. Molli, A. Mostefaoui. Spray: an Adaptive Random Peer Sampling Protocol. Rapport technique, 2015 ; LINA-University of Nantes, INRIA Rennes - Bretagne Atlantique, .
      https://hal.science/hal-01203363
    • [83] D. Frey, R. Friedman, A. Mostefaoui, M. Perrin, M. Raynal, F. Taïani. D.1.2 – Modular quasi-causal data structures. Rapport technique, 2015 ; LINA-University of Nantes, IRISA, .
      https://hal.science/hal-01223119
    • [84] M. Perrin, M. Petrolia, A. Mostefaoui, C. Jard. Consistent Shared Data Types: Beyond Memory. Rapport technique, 2014 ; Université de Nantes.
      https://hal.science/hal-01052437
    • [86] A. Mostefaoui, M. Raynal, J. Stainer. Relations Linking Failure Detectors Associated with k-Set Agreement in Message-Passing Systems. Rapport technique, 2011 ; .
      https://inria.hal.science/inria-00583301
    • [90] A. Mostefaoui, S. Rajsbaum, M. Raynal, C. Travers. The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement. Rapport technique, 2008 ; .
      https://inria.hal.science/inria-00294706
    • [91] A. Kermarrec, A. Mostefaoui, M. Raynal, G. Trédan, A. Viana. Large-scale networked systems: from anarchy to geometric self-structuring. Rapport technique, 2007 ; .
      https://inria.hal.science/inria-00196714v2
    • [93] A. Mostefaoui, M. Raynal, C. Travers. Exploring Gafni's reduction land: from $\Omega^k$ to wait-free adaptive $(2p-\lceil\frac{p}{k}\rceil)$-renaming via $k$-set agreement. Rapport technique, 2006 ; .
      https://inria.hal.science/inria-00001189
    • [94] A. Mostefaoui, S. Rajsbaum, M. Raynal, C. Travers. On the Computability Power and the Robustness of Set Agreement-oriented Failure Detector Classes. Rapport technique, 2006 ; .
      https://inria.hal.science/inria-00107220
    • [96] A. Mostefaoui, S. Rajsbaum, M. Raynal, C. Travers. From <>W to Omega: a Simple Bounded Quiescent Reliable broadcast-based Transformation. Rapport technique, 2005 ; .
      https://inria.hal.science/inria-00000663
    • [97] A. Mostefaoui, S. Rajsbaum, M. Raynal, C. Travers. Irreducibility and Additivity of Set Agreement-oriented Failure Detector Classes. Rapport technique, 2005 ; .
      https://inria.hal.science/inria-00000604
    • [98] J. Hélary, M. Hurfin, A. Mostefaoui, M. Raynal, F. Tronel. Computing Global Functions in Asynchronous Distributed Systems with Process Crashes. Rapport technique, 1999 ; INRIA.
      https://inria.hal.science/inria-00073017
    • [101] R. Baldoni, J. Hélary, A. Mostefaoui, M. Raynal. On Modeling Consistent Checkpoints and the Domino Effect in Distributed Systems. Rapport technique, 1995 ; INRIA.
      https://inria.hal.science/inria-00074112
    • [104] A. Mostefaoui, M. Raynal. Definition and implementation of a flexible communication primitive for distributed programming. Rapport technique, 1993 ; INRIA.
      https://inria.hal.science/inria-00074586
    • [106] J. Hélary, A. Mostefaoui. A O(log2n) fault-tolerant distributed mutual exclusion algorithm based on open-cube structure. Rapport technique, 1993 ; INRIA.
      https://inria.hal.science/inria-00074630
    • [107] J. Hélary, A. Mostefaoui, M. Raynal. A General scheme for token and tree based distributed mutual exclusion algorithms. Rapport technique, 1992 ; INRIA.
      https://inria.hal.science/inria-00076927
Copyright : LS2N 2017 - Mentions Légales - 
 -