Seguir
quentin BRAMAS
Título
Citado por
Citado por
Año
The Stability and the Security of the Tangle
Q Bramas
462018
Wait-free gathering without chirality
Q Bramas, S Tixeuil
Structural Information and Communication Complexity: 22nd International …, 2015
382015
The complexity of data aggregation in static and dynamic wireless sensor networks
Q Bramas, S Tixeuil
Information and Computation 255, 369-383, 2017
302017
Infinite grid exploration by disoriented robots
Q Bramas, S Devismes, P Lafourcade
International Conference on Networked Systems, 129-145, 2020
272020
Brief Announcement: Probabilistic asynchronous arbitrary pattern formation
Q Bramas, S Tixeuil
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016
202016
Arbitrary pattern formation with four robots
Q Bramas, S Tixeuil
Stabilization, Safety, and Security of Distributed Systems: 20th …, 2018
182018
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
142021
How to choose its parents in the tangle
V Attias, Q Bramas
Networked Systems: 7th International Conference, NETYS 2019, Marrakech …, 2019
132019
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
122020
The random bit complexity of mobile robots scattering
Q Bramas, S Tixeuil
International Journal of Foundations of Computer Science 28 (02), 111-133, 2017
122017
Distributed online data aggregation in dynamic graphs
Q Bramas, T Masuzawa, S Tixeuil
2016 IEEE 36th International Conference on Distributed Computing Systems …, 2016
102016
Probabilistic asynchronous arbitrary pattern formation (short paper)
Q Bramas, S Tixeuil
Stabilization, Safety, and Security of Distributed Systems: 18th …, 2016
102016
Stand up indulgent gathering
Q Bramas, A Lamani, S Tixeuil
Theoretical Computer Science 939, 63-77, 2023
82023
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
82021
Efficient and secure tsa for the tangle
Q Bramas
International Conference on Networked Systems, 161-166, 2021
62021
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
62020
Stand up indulgent rendezvous
Q Bramas, A Lamani, S Tixeuil
Stabilization, Safety, and Security of Distributed Systems: 22nd …, 2020
62020
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
62015
Deploying near-optimal delay-constrained paths with Segment Routing in massive-scale networks
JR Luttringer, T Alfroy, P Mérindol, Q Bramas, F Clad, C Pelsser
Computer Networks 212, 109015, 2022
52022
Beedroids: How Luminous Autonomous Swarms of UAVs Can Save the World?
Q Bramas, S Devismes, A Durand, P Lafourcade, A Lamani
FUN 2022-11th International Conference on Fun with Algorithms, 2022
52022
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20