Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Bramas, Quentin
109  Ergebnisse:
englisch X
Personensuche X
?
1

Stand-Up Indulgent Gathering on Lines for Myopic Luminous R..:

, In: Advanced Information Networking and Applications; Lecture Notes on Data Engineering and Communications Technologies,
Bramas, Quentin ; Kakugawa, Hirotsugu ; Kamei, Sayaka... - p. 110-121 , 2024
Link: https://doi.org/10.1007/..
 
?
2

Stand-Up Indulgent Gathering on Rings:

, In: Structural Information and Communication Complexity; Lecture Notes in Computer Science,
Bramas, Quentin ; Kamei, Sayaka ; Lamani, Anissa. - p. 119-137 , 2024
Link: https://doi.org/10.1007/..
 
?
3

Computing the Heaviest Conflict-Free Sub-DAG in DAG-Based D..:

, In: 2023 5th Conference on Blockchain Research & Applications for Innovative Networks and Services (BRAINS),
Bramas, Quentin - p. 1-8 , 2023
Link: https://doi.org/10.1109/..
 
?
4

The agreement power of disagreement:

Bramas, Quentin ; Lamani, Anissa ; Tixeuil, Sébastien
Theoretical Computer Science.  954 (2023)  - p. 113772 , 2023
Link: https://doi.org/10.1016/..
 
?
5

Optimal exclusive perpetual grid exploration by luminous my..:

Bramas, Quentin ; Lafourcade, Pascal ; Devismes, Stéphane
Theoretical Computer Science.  977 (2023)  - p. 114162 , 2023
Link: https://doi.org/10.1016/..
 
?
6

Stand up indulgent gathering:

Bramas, Quentin ; Lamani, Anissa ; Tixeuil, Sébastien
Theoretical Computer Science.  939 (2023)  - p. 63-77 , 2023
Link: https://doi.org/10.1016/..
 
?
7

Perpetual torus exploration by myopic luminous robots:

Darwich, Omar ; Ulucan, Ahmet-Sefa ; Bramas, Quentin...
Theoretical Computer Science.  976 (2023)  - p. 114143 , 2023
Link: https://doi.org/10.1016/..
 
?
8

Deploying near-optimal delay-constrained paths with Segment..:

Luttringer, Jean-Romain ; Alfroy, Thomas ; Mérindol, Pascal...
Computer Networks.  212 (2022)  - p. 109015 , 2022
Link: https://doi.org/10.1016/..
 
?
9

Distributed Publish/Subscribe Protocol with Minimum Number ..:

, In: 23rd International Conference on Distributed Computing and Networking,
Abegg, Jean-Philippe ; Bramas, Quentin ; Brugière, Timothée. - p. 117-123 , 2022
Link: https://dl.acm.org/doi/1..
 
?
10

Secret-less secured payment system for inter-broker communi..:

, In: 2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt),
Abegg, Jean-Philippe ; Bramas, Quentin ; Noel, Thomas - p. 225-232 , 2022
Link: https://doi.org/10.23919..
 
?
11

Optimal Exclusive Perpetual Grid Exploration by Luminous My..:

, In: International Conference on Distributed Computing and Networking 2021,
Bramas, Quentin ; Lafourcade, Pascal ; Devismes, Stéphane - p. 76-85 , 2021
Link: https://dl.acm.org/doi/1..
 
?
12

Computing Delay-Constrained Least-Cost Paths for Segment Ro..:

, In: 2020 IEEE 19th International Symposium on Network Computing and Applications (NCA),
Luttringer, Jean-Romain ; Alfroy, Thomas ; Merindol, Pascal... - p. 1-8 , 2020
Link: https://doi.org/10.1109/..
 
?
13

Packet Efficient Implementation of the Omega Failure Detect..:

Bramas, Quentin ; Foreback, Dianne ; Nesterenko, Mikhail.
Theory of Computing Systems.  63 (2018)  2 - p. 237-260 , 2018
Link: https://doi.org/10.1007/..
 
?
14

The complexity of data aggregation in static and dynamic wi..:

Bramas, Quentin ; Tixeuil, Sébastien
Information and Computation.  255 (2017)  - p. 369-383 , 2017
Link: https://doi.org/10.1016/..
 
?
15

Brief Announcement : Probabilistic Asynchronous Arbitrar..:

, In: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing,
Bramas, Quentin ; Tixeuil, Sébastien - p. 443-445 , 2016
Link: https://dl.acm.org/doi/1..
 
1-15