Matthieu Perrin
Présentation
Matthieu Perrin is an assistant professor at University of Nantes (France). He is involved in the GDD team (distributed data management) at LS2N (Laboratoire des Sciences du Numérique de Nantes). His scientific interests focus on distributed computing, and in particular modeling weakly consistent shared objects in distributed systems.
Publications
Publications
Invited Paper: On the Equivalence of Snapshot/Append Objects and Broadcast Abstractions under Byzantine Failures27th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2025), Nov 2025, Kathmandu, Nepal. pp.343-358, ⟨10.1007/978-3-032-11127-2_27⟩ |
|
|
|
No Symmetric Broadcast Abstraction Characterizes k-Set-Agreement in Message-Passing Systems28th International Conference on Principles of Distributed Systems (OPODIS 2024), Leibniz International Proceedings in Informatics (LIPIcs), Dec 2024, Lucca, Italy. ⟨10.4230/lipics.opodis.2024.21⟩ |
|
|
Byzantine-Tolerant Privacy-Preserving Atomic RegisterICDCN 2025: 26th International Conference on Distributed Computing and Networking, Jan 2025, Hyderabad India, France. pp.201-210, ⟨10.1145/3700838.3700867⟩ |
|
|
SHARP : A Hybrid Approach for SPARQL Query Relaxation21st International Conference on Semantic Systems (SEMANTiCS), Aug 2025, Vienna, Austria. pp.194 - 216, ⟨10.3233/SSW250020⟩ |
|
|
Invited Paper: Causal Mutual Byzantine BroadcastApPLIED'24: 2024 Workshop on Advanced Tools, Programming Languages, and PLatforms for Implementing and Evaluating algorithms for Distributed systems, Jun 2025, Nantes France, France. pp.1-8, ⟨10.1145/3663338.3663679⟩ |
|
|
Quelles Relations entre Lire/Ecrire et Envoyer/Recevoir dans les Systèmes Asynchrones avec Crashs de Processus ?AlgoTel 2024 – 26èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2024, Saint-Briac-sur-Mer, France. pp.1-4 |
Brief Announcement: No Broadcast Abstraction Characterizes k-Set-Agreement in Message-Passing SystemsPODC '24: 43rd ACM Symposium on Principles of Distributed Computing, Jun 2024, Nantes France, France. pp.343-346, ⟨10.1145/3662158.3662818⟩ |
|
|
|
Atomic Register Abstractions for Byzantine-Prone Distributed Systems27th International Conference on Principles of Distributed Systems (OPODIS 2023), Leibniz International Proceedings in Informatics (LIPIcs), Dec 2023, Tokyo (Japan), Japan. ⟨10.4230/lipics.opodis.2023.35⟩ |
|
|
Une Implémentation Optimale pour SCD-Broadcast ByzantinAlgoTel 2024 – 26èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2024, Saint-Briac-sur-Mer, France |
Send/Receive Patterns Versus Read/Write Patterns in Crash-Prone Asynchronous Distributed Systems37th International Symposium on Distributed Computing, DISC 2023, Oct 2023, L'Aquila, Italy. pp.16:1-16:24, ⟨10.4230/LIPICS.DISC.2023.16⟩ |
|
|
|
Brief Announcement: The MBroadcast AbstractionACM PODC 2023 - 42th ACM Symposium on Principles of Distributed Computing, Jun 2023, Orlando (FL), United States. pp.282-285, ⟨10.1145/3583668.3594569⟩ |
|
|
Wait-Free CAS-Based Algorithms: The Burden of the PastInternational Symposium on Distributed Computing (DISC), Oct 2021, Freiburg (Allemagne) - virtual conference, Germany. pp. 11:1-11:15, ⟨10.4230/LIPIcs.DISC.2021.11⟩ |
|
|
Extension de la Hiérarchie de Herlihy aux Systèmes Multi-threadsALGOTEL 2021 — 23èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2021, La Rochelle, France |
|
|
Extending the Wait-free Hierarchy to Multi-Threaded SystemsPODC '20: ACM Symposium on Principles of Distributed Computing, Aug 2020, Virtual Event Italy, France. pp.21-30, ⟨10.1145/3382734.3405723⟩ |
|
|
Modéliser la Compatibilité Entre les Licences31es Journées francophones d'Ingénierie des Connaissances (IC), Sébastien Ferré, Jun 2020, Angers, France |
|
|
State-machine replication for planet-scale systemsThe Fifteenth European Conference on Computer Systems (EuroSys), Apr 2020, Heraklion, Greece. pp.1-15, ⟨10.1145/3342195.3387543⟩ |
|
|
A License-Based Search Engine16th Extended Semantic Web Conference (ESWC2019), Jun 2019, Portoroz, Slovenia. ⟨10.1007/978-3-030-32327-1_26⟩ |
|
|
A New Insight into Local Coin-Based Randomized ConsensusPRDC 2019 - 24th IEEE Pacific Rim International Symposium on Dependable Computing, Dec 2019, Kyoto, Japan. pp.207-216, ⟨10.1109/PRDC47002.2019.00051⟩ |
|
|
Does the operational model capture partition tolerance in distributed systems?15th International Conference on Parallel Computing Technologies, Aug 2019, Astana, Kazakhstan. ⟨10.1007/978-3-030-25636-4_31⟩ |
|
|
Brief Announcement: Wait-Free Universality of Consensus in the Infinite Arrival ModelInternational Symposium on Distributed Computing (DISC) 2019, Oct 2019, Budapest, Hungary |
|
|
Modelling the Compatibility of Licenses16th Extended Semantic Web Conference (ESWC2019), Jun 2019, Portorož, Slovenia. ⟨10.1007/978-3-030-21348-0_17⟩ |
|
|
Separating Lock-Freedom from Wait-FreedomThe 37th ACM Symposium on Principles of Distributed Computing, Jul 2018, Egham, United Kingdom. pp.41-50, ⟨10.1145/3212734.3212739⟩ |
|
|
Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability LimitsICDCN '18 - 19th International Conference on Distributed Computing and Networking, Jan 2018, Varanasi, India. pp.1-10, ⟨10.1145/3154273.3154296⟩ |
|
|
Which Broadcast Abstraction Captures k-Set Agreement?31st International Symposium on Distributed Computing (DISC 2017), Oct 2017, Vienna, Austria. pp.1-16, ⟨10.4230/LIPIcs.DISC.2017.27⟩ |
|
|
Speed for the elite, consistency for the masses: differentiating eventual consistency in large-scale distributed systemsProceedings of the 2016 IEEE 35th Symposium on Reliable Distributed Systems (SRDS 2016), Sep 2016, Budapest, Hungary. pp.197-206, ⟨10.1109/SRDS.2016.032⟩ |
|
|
On Composition and Implementation of Sequential Consistency30th International Symposium on Distributed Computing, Sep 2016, Paris, France |
|
|
Causal Consistency: Beyond Memory21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Mar 2016, Barcelone, Spain. ⟨10.1145/2851141.2851170⟩ |
|
|
Tracking Causal Dependencies in Web Services Orchestrations Defined in ORCNETYS - 3rd International Conference on NETwork sYStems, May 2015, Agadir, Morocco |
|
|
Update Consistency for Wait-free Concurrent ObjectsIPDPS - IEEE International Parallel & Distributed Processing Symposium, May 2015, Hyderabad, India |
|
|
Brief Announcement: Update Consistency in Partitionable SystemsDISC14 - 28th International Symposium on Distributed Computing, Oct 2014, Austin, United States |
Distributed SystemsISTE Press - Elsevier, 2017, 9781785482267 |
|
Concurrence et cohérence dans les systèmes répartisISTE Press, 2017, 978-1-78405-295-9 |
|
|
Collaborative SPARQL Query Processing for Decentralized Semantic DataDatabase and Expert Systems Applications - 31st International Conference, {DEXA} 2020, Bratislava, Slovakia, September 14-17, 2020, Proceedings, Part {I}, pp.320-335, 2020, ⟨10.1007/978-3-030-59003-1_21⟩ |
|
|
No Broadcast Abstraction Characterizes k-Set-Agreement in Message-Passing Systems (Extended Version)2024 |
|
|
Send/Receive Patterns versus Read/Write Patterns: the MB-Broadcast Abstraction (Extended Version)2023 |
|
|
Registre atomique préservant la vie privée tolérant aux byzantins2023 |
|
|
Causal Mutual Byzantine Broadcast2023 |
|
|
Complexity of Update Consistent Universal Constructions2022 |
|
|
Does the operational model capture partition tolerance in distributed systems? (Extended Version)2019 |
Randomized Consensus: Common Coins Are not the Holy Grail!LS2N-Nantes Université. 2024 |
|
|
|
Another Look at the Implementation of Read/write Registers in Crash-prone Asynchronous Message-Passing Systems (Extended Version)[Research Report] IRISA, Inria Rennes; LS2N-University of Nantes; Technion - Israel Institute of Technology. 2017 |
|
|
Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits[Research Report] LIF, Université Aix-Marseille; LINA-University of Nantes; IMDEA Software Institute; Institut Universitaire de France; IRISA, Université de Rennes. 2017 |
|
|
D.1.3 – Protocols for emergent localities[Technical Report] D1.3, IRISA; LINA-University of Nantes; Inria Rennes Bretagne Atlantique; Lancaster University. 2016 |
|
|
D.1.2 – Modular quasi-causal data structures[Research Report] D1.2, LINA-University of Nantes; IRISA. 2015 |
|
|
D.1.1 – Survey on Weak Consistency Approaches for Large-Scale Systems[Technical Report] D1.1, LINA-University of Nantes; IRISA. 2015 |
|
|
Proof of the Instrumented Semantics for Orc[Research Report] LINA-University of Nantes. 2015 |
|
|
Consistent Shared Data Types: Beyond Memory[Research Report] Université de Nantes. 2014 |
|
|
On the Complexity of Concurrent Multiset Rewriting[Research Report] RR-8408, INRIA. 2013, pp.17 |
Compression de séquences d'A.D.N. à base de grammaires minimales[Stage] 2010, pp.14 |
|
|
Spécification des objets partagés dans les systèmes répartis sans-attenteCalcul parallèle, distribué et partagé [cs.DC]. Université de Nantes (Unam), 2016. Français. ⟨NNT : ⟩ |