Quentin Bramas

ORCID

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 64

Top Venues

Pierre and Marie Curie University, Paris, France (PHD)

Education History

Pierre and Marie Curie University, Paris, France

PHD

Publications

Quentin Bramas, Jean-Romain Luttringer, Pascal Mérindol
La ROUTOURNE va tourner. CoRR (2024)
Quentin Bramas, Sayaka Kamei, Anissa Lamani, Sébastien Tixeuil
Stand-Up Indulgent Gathering on Rings. CoRR (2024)
Quentin Bramas, Sayaka Kamei, Anissa Lamani, Sébastien Tixeuil
Stand-up indulgent gathering on lines. Theor. Comput. Sci. 1016 (2024)
Quentin Bramas, Hirotsugu Kakugawa, Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Masahiro Shibata, Sébastien Tixeuil
Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots. AINA (2) (2024)
Quentin Bramas, Sayaka Kamei, Anissa Lamani, Sébastien Tixeuil
Stand-Up Indulgent Gathering on Rings. SIROCCO (2024)
Quentin Bramas, Jean-Romain Luttringer, Sébastien Tixeuil
Online Space-Time Travel Planning in Dynamic Graphs. SAND (2024)
Quentin Bramas, Toshimitsu Masuzawa, Sébastien Tixeuil
Brief Announcement: Crash-Tolerant Exploration of Trees by Energy Sharing Mobile Agents. SAND (2024)
Quentin Bramas, Anissa Lamani, Sébastien Tixeuil
Stand up indulgent gathering. Theor. Comput. Sci. 939 (2023)
Quentin Bramas, Sayaka Kamei, Anissa Lamani, Sébastien Tixeuil
Stand-Up Indulgent Gathering on Lines. CoRR (2023)
Quentin Bramas
Computing the Heaviest Conflict-Free Sub-DAG in DAG-Based DLTs. BRAINS (2023)
Quentin Bramas, Anissa Lamani, Sébastien Tixeuil
The agreement power of disagreement. Theor. Comput. Sci. 954 (2023)
Quentin Bramas, Anissa Lamani, Sébastien Tixeuil
Stand Up Indulgent Gathering. CoRR (2023)
Eloise Stein, Quentin Bramas, Tommaso Colombo, Cristel Pelsser
Fault-adaptive Scheduling for Data Acquisition Networks. LCN (2023)
Quentin Bramas, Pascal Lafourcade, Stéphane Devismes
Optimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality. Theor. Comput. Sci. 977 (2023)
Quentin Bramas, Jean-Romain Luttringer, Pascal Mérindol
A Simple and General Operational Framework to Deploy Optimal Routes with Source Routing. CoRR (2023)
Quentin Bramas, Hirotsugu Kakugawa, Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Masahiro Shibata, Sébastien Tixeuil
Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots. CoRR (2023)
Omar Darwich, Ahmet-Sefa Ulucan, Quentin Bramas, Anissa Lamani, Anaïs Durand, Pascal Lafourcade
Perpetual torus exploration by myopic luminous robots. Theor. Comput. Sci. 976 (2023)
Quentin Bramas, Jean-Romain Luttringer, Sébastien Tixeuil
Offline Constrained Backward Time Travel Planning. SSS (2023)
Quentin Bramas, Sayaka Kamei, Anissa Lamani, Sébastien Tixeuil
Stand-Up Indulgent Gathering on Lines. SSS (2023)
Quentin Bramas, Toshimitsu Masuzawa, Sébastien Tixeuil
Brief Announcement: Crash-Tolerant Exploration by Energy Sharing Mobile Agents. SSS (2023)
Jean-Romain Luttringer, Thomas Alfroy, Pascal Mérindol, Quentin Bramas, François Clad, Cristel Pelsser
Deploying near-optimal delay-constrained paths with Segment Routing in massive-scale networks. Comput. Networks 212 (2022)
Jean-Philippe Abegg, Quentin Bramas, Thomas Noël
Secret-less secured payment system for inter-broker communications. WiOpt (2022)
Jean-Philippe Abegg, Quentin Bramas, Timothée Goubault de Brugière, Thomas Noël
Distributed Publish/Subscribe Protocol with Minimum Number of Encryption. ICDCN (2022)
Quentin Bramas, Jean-Romain Luttringer, Sébastien Tixeuil
Constrained Backward Time Travel Planning is in P. CoRR (2022)
Quentin Bramas, Stéphane Devismes, Anaïs Durand, Pascal Lafourcade, Anissa Lamani
Beedroids: How Luminous Autonomous Swarms of UAVs Can Save the World? FUN (2022)
Omar Darwich, Ahmet-Sefa Ulucan, Quentin Bramas, Anissa Lamani, Anaïs Durand, Pascal Lafourcade
Perpetual Torus Exploration by Myopic Luminous Robots. SSS (2022)
Jean-Romain Luttringer, Quentin Bramas, Cristel Pelsser, Pascal Mérindol
A Fast-Convergence Routing of the Hot-Potato. INFOCOM (2021)
Jean-Romain Luttringer, Thomas Alfroy, Pascal Mérindol, Quentin Bramas, François Clad, Cristel Pelsser
Deploying Near-Optimal Delay-Constrained Paths with Segment Routing in Massive-Scale Networks. CoRR (2021)
Jean-Romain Luttringer, Quentin Bramas, Cristel Pelsser, Pascal Mérindol
A Fast-Convergence Routing of the Hot-Potato. CoRR (2021)
Quentin Bramas, Pascal Lafourcade, Stéphane Devismes
Optimal Exclusive Perpetual Grid Exploration by Luminous Myopic Opaque Robots with Common Chirality. ICDCN (2021)
Jean-Philippe Abegg, Quentin Bramas, Thomas Noël
Blockchain Using Proof-of-Interaction. NETYS (2021)
Quentin Bramas
Efficient and Secure TSA for the Tangle. CoRR (2021)
Arthur Rauch, Quentin Bramas, Stéphane Devismes, Pascal Lafourcade, Anissa Lamani
Optimal Exclusive Perpetual Grid Exploration by Luminous Myopic Robots Without Common Chirality. NETYS (2021)
Quentin Bramas, Anissa Lamani, Sébastien Tixeuil
The Agreement Power of Disagreement. SSS (2021)
Quentin Bramas
Efficient and Secure TSA for the Tangle. NETYS (2021)
Quentin Bramas, Pascal Lafourcade, Stéphane Devismes
Finding Water on Poleless Using Melomaniac Myopic Chameleon Robots. FUN (2021)
Quentin Bramas, Anissa Lamani, Sébastien Tixeuil
Stand up Indulgent Gathering. ALGOSENSORS (2021)
Jean-Philippe Abegg, Quentin Bramas, Timothée Goubault de Brugière, Thomas Noël
SUPRA, a distributed publish/subscribe protocol with blockchain as a conflict resolver. BRAINS (2021)
François Bonnet, Quentin Bramas, Xavier Défago
Stateless Distributed Ledgers. NETYS (2020)
Quentin Bramas, Anissa Lamani, Sébastien Tixeuil
Stand Up Indulgent Rendezvous. CoRR (2020)
Quentin Bramas, Anissa Lamani, Sébastien Tixeuil
Stand Up Indulgent Rendezvous. SSS (2020)
François Bonnet, Quentin Bramas, Xavier Défago
Stateless Distributed Ledgers. CoRR (2020)
Jean-Philippe Abegg, Quentin Bramas, Thomas Noël
Blockchain using Proof-of-Interaction. CoRR (2020)
Jean-Romain Luttringer, Thomas Alfroy, Pascal Mérindol, Quentin Bramas, François Clad, Cristel Pelsser
Computing Delay-Constrained Least-Cost Paths for Segment Routing is Easier Than You Think. NCA (2020)
Quentin Bramas, Stéphane Devismes, Pascal Lafourcade
Infinite Grid Exploration by Disoriented Robots. NETYS (2020)
Bérenger Bramas, Quentin Bramas
On the improvement of the in-place merge algorithm parallelization. CoRR (2020)
Jean-Romain Luttringer, Thomas Alfroy, Pascal Mérindol, Quentin Bramas, François Clad, Cristel Pelsser
Computing Delay-Constrained Least-Cost Paths for Segment Routing is Easier Than You Think. CoRR (2020)
Vidal Attias, Quentin Bramas
How to Choose Its Parents in the Tangle. NETYS (2019)
Quentin Bramas, Toshimitsu Masuzawa, Sébastien Tixeuil
Distributed Online Data Aggregation in Dynamic Graphs. NETYS (2019)
Quentin Bramas
The Stability and the Security of the Tangle. Tokenomics (2019)
Quentin Bramas, Stéphane Devismes, Pascal Lafourcade
Infinite Grid Exploration by Disoriented Robots. SIROCCO (2019)
Rodrigo Teles Hermeto, Quentin Bramas, Antoine Gallais, Fabrice Théoleyre
Analysis of the Network Attachment Delay of Mobile Devices in the Industrial Internet of Things. ADHOC-NOW (2019)
Quentin Bramas, Stéphane Devismes, Pascal Lafourcade
Infinite Grid Exploration by Disoriented Robots. CoRR (2019)
Quentin Bramas, Dianne Foreback, Mikhail Nesterenko, Sébastien Tixeuil
Packet Efficient Implementation of the Omega Failure Detector. Theory Comput. Syst. 63 (2) (2019)
Quentin Bramas, Sébastien Tixeuil
Arbitrary Pattern Formation with Four Robots. SSS (2018)
François Bonnet, Quentin Bramas, Xavier Défago, Thanh Dang Nguyen
Killing Nodes as a Countermeasure to Virus Expansion. SIROCCO (2017)
Quentin Bramas, Sébastien Tixeuil
The complexity of data aggregation in static and dynamic wireless sensor networks. Inf. Comput. 255 (2017)
Quentin Bramas, Sébastien Tixeuil
The Random Bit Complexity of Mobile Robots Scattering. Int. J. Found. Comput. Sci. 28 (2) (2017)
Quentin Bramas, Toshimitsu Masuzawa, Sébastien Tixeuil
Distributed Online Data Aggregation in Dynamic Graphs. CoRR (2016)
Quentin Bramas, Sébastien Tixeuil
Brief Announcement: Probabilistic Asynchronous Arbitrary Pattern Formation. PODC (2016)
Quentin Bramas, Toshimitsu Masuzawa, Sébastien Tixeuil
Distributed Online Data Aggregation in Dynamic Graphs. ICDCS (2016)
Quentin Bramas, Sébastien Tixeuil
Benchmarking Energy-Centric Broadcast Protocols in Wireless Sensor Networks. NETYS (2016)
Quentin Bramas, Dianne Foreback, Mikhail Nesterenko, Sébastien Tixeuil
Packet Efficient Implementation of the Omega Failure Detector. SSS (2016)
Quentin Bramas, Sébastien Tixeuil
Probabilistic Asynchronous Arbitrary Pattern Formation (Short Paper). SSS (2016)
Quentin Bramas, Sébastien Tixeuil
Wait-Free Gathering Without Chirality. SIROCCO (2015)
Quentin Bramas, Dianne Foreback, Mikhail Nesterenko, Sébastien Tixeuil
Packet Efficient Implementation of the Omega Failure Detector. CoRR (2015)
Quentin Bramas, Wilfried Dron, Mariem Ben Fadhl, Khalil Hachicha, Patrick Garda, Sébastien Tixeuil
WiSeBat: accurate energy benchmarking of wireless sensor networks. FDL (2015)
Quentin Bramas, Sébastien Tixeuil
The Complexity of Data Aggregation in Static and Dynamic Wireless Sensor Networks. SSS (2015)
Quentin Bramas, Sébastien Tixeuil
The Random Bit Complexity of Mobile Robots Scattering. ADHOC-NOW (2015)
Quentin Bramas, Sébastien Tixeuil
Asynchronous Pattern Formation without Chirality. CoRR (2015)
Quentin Bramas, Sébastien Tixeuil
The Random Bit Complexity of Mobile Robots Scattering. CoRR (2013)

Quentin Bramas.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Quentin Bramas