| The Stability and the Security of the Tangle Q Bramas | 47 | 2018 |
| Wait-free gathering without chirality Q Bramas, S Tixeuil Structural Information and Communication Complexity: 22nd International …, 2015 | 42 | 2015 |
| The complexity of data aggregation in static and dynamic wireless sensor networks Q Bramas, S Tixeuil Information and Computation 255, 369-383, 2017 | 30 | 2017 |
| Brief Announcement: Probabilistic asynchronous arbitrary pattern formation Q Bramas, S Tixeuil Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016 | 21 | 2016 |
| Optimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality Q Bramas, P Lafourcade, S Devismes Proceedings of the 22nd International Conference on Distributed Computing …, 2021 | 18 | 2021 |
| Infinite grid exploration by disoriented robots Q Bramas, S Devismes, P Lafourcade International Conference on Networked Systems, 129-145, 2020 | 18 | 2020 |
| Multi-threshold asynchronous reliable broadcast and consensus M Hirt, A Kastrati, CD Liu-Zhang Cryptology ePrint Archive, 2020 | 18 | 2020 |
| Infinite grid exploration by disoriented robots Q Bramas, S Devismes, P Lafourcade Structural Information and Communication Complexity: 26th International …, 2019 | 18 | 2019 |
| Arbitrary pattern formation with four robots Q Bramas, S Tixeuil International Symposium on Stabilizing, Safety, and Security of Distributed …, 2018 | 18 | 2018 |
| How to choose its parents in the tangle V Attias, Q Bramas Networked Systems: 7th International Conference, NETYS 2019, Marrakech …, 2019 | 15 | 2019 |
| Finding water on poleless using melomaniac myopic chameleon robots Q Bramas, P Lafourcade, S Devismes 10th International Conference on Fun with Algorithms (FUN 2021)(2020), 6: 1 …, 2020 | 12 | 2020 |
| Probabilistic asynchronous arbitrary pattern formation (short paper) Q Bramas, S Tixeuil Stabilization, Safety, and Security of Distributed Systems: 18th …, 2016 | 12 | 2016 |
| Optimal exclusive perpetual grid exploration by luminous myopic robots without common chirality A Rauch, Q Bramas, S Devismes, P Lafourcade, A Lamani International Conference on Networked Systems, 95-110, 2021 | 11 | 2021 |
| The random bit complexity of mobile robots scattering Q Bramas, S Tixeuil International Journal of Foundations of Computer Science 28 (02), 111-133, 2017 | 11 | 2017 |
| Distributed online data aggregation in dynamic graphs Q Bramas, T Masuzawa, S Tixeuil 2016 IEEE 36th International Conference on Distributed Computing Systems …, 2016 | 10 | 2016 |
| Stand up indulgent gathering Q Bramas, A Lamani, S Tixeuil Theoretical Computer Science 939, 63-77, 2023 | 8 | 2023 |
| Computing delay-constrained least-cost paths for segment routing is easier than you think JR Luttringer, T Alfroy, P Mérindol, Q Bramas, F Clad, C Pelsser 2020 IEEE 19th International Symposium on Network Computing and Applications …, 2020 | 8 | 2020 |
| Efficient and secure TSA for the tangle Q Bramas International Conference on Networked Systems, 161-166, 2021 | 7 | 2021 |
| WiSeBat: accurate energy benchmarking of wireless sensor networks Q Bramas, W Dron, MB Fadhl, K Hachicha, P Garda, S Tixeuil 2015 Forum on Specification and Design Languages (FDL), 1-8, 2015 | 7 | 2015 |
| Stand-up indulgent gathering on rings Q Bramas, S Kamei, A Lamani, S Tixeuil International Colloquium on Structural Information and Communication …, 2024 | 6 | 2024 |
Sebastien TixeuilProfessor of Computer Science, Sorbonne Université, LIP6 & IUFVerified email at lip6.fr
