| Current teams : | ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL |
| Publications NPA | 2023 | 2024 | 2025 | Total |
|---|---|---|---|---|
| Books | 0 | 0 | 0 | 0 |
| Edited books | 0 | 0 | 0 | 0 |
| Journal articles | 12 | 4 | 0 | 16 |
| Book chapters | 0 | 0 | 0 | 0 |
| Conference papers | 23 | 21 | 0 | 44 |
| Habilitations | 0 | 0 | 0 | 0 |
| Thesis | 5 | 0 | 0 | 5 |
- J. Augé, T. Friedman : “The Open Slice-based Facility Architecture (Open SFA)”, [Augé 2012]
- L. Blin, J. Burman, N. Nisse : “Perpetual Graph Searching”, [Blin 2012c]
- Z. Bouzid, C. Travers : “Anonymity, Failures, Detectors and Consensus”, [Bouzid 2012a]
- Z. Bouzid, C. Travers : “Simultaneous Consensus is Harder than Set Agreement in Message Passing”, [Bouzid 2012b]
- J. Clement, X. Défago, M. Gradinariu Potop‑Butucaru, S. Messika, Ph. Raipin‑Parvedy : “Fault and Byzantine Tolerant Self-stabilizing Mobile Robots Gathering”, [Clement 2012]
- S. Dubois, S. Tixeuil, N. Zhu : “The Byzantine Brides Problem”, [Dubois 2012c]
- S. Kamei, A. Lamani, F. Ooshita, S. Tixeuil : “Gathering an even number of robots in an odd ring without global multiplicity detection”, [Kamei 2012a]
- A. Maurer, S. Tixeuil : “Parameterizable Byzantine Broadcast in Loosely Connected Networks”, [Maurer 2012d]