default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDQuentin Bramas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Quentin Bramas
, Sayaka Kamei, Anissa Lamani, Sébastien Tixeuil:
Stand-up indulgent gathering on lines. Theor. Comput. Sci. 1016: 114796 (2024)- [c43]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: 110-121 - [c42]Quentin Bramas, Jean-Romain Luttringer, Sébastien Tixeuil:
Online Space-Time Travel Planning in Dynamic Graphs. SAND 2024: 7:1-7:14 - [c41]Quentin Bramas, Toshimitsu Masuzawa, Sébastien Tixeuil:
Brief Announcement: Crash-Tolerant Exploration of Trees by Energy Sharing Mobile Agents. SAND 2024: 25:1-25:5 - [c40]Quentin Bramas, Sayaka Kamei, Anissa Lamani, Sébastien Tixeuil:
Stand-Up Indulgent Gathering on Rings. SIROCCO 2024: 119-137 - [c39]Quentin Bramas, Stéphane Devismes, Anaïs Durand, Pascal Lafourcade, Anissa Lamani:
Optimal Asynchronous Perpetual Grid Exploration. SSS 2024: 89-105 - [i20]Quentin Bramas, Sayaka Kamei, Anissa Lamani, Sébastien Tixeuil:
Stand-Up Indulgent Gathering on Rings. CoRR abs/2402.14233 (2024) - [i19]Quentin Bramas, Jean-Romain Luttringer, Pascal Mérindol:
La ROUTOURNE va tourner. CoRR abs/2405.07584 (2024) - 2023
- [j8]Quentin Bramas, Anissa Lamani, Sébastien Tixeuil:
Stand up indulgent gathering. Theor. Comput. Sci. 939: 63-77 (2023) - [j7]Quentin Bramas, Anissa Lamani, Sébastien Tixeuil:
The agreement power of disagreement. Theor. Comput. Sci. 954: 113772 (2023) - [j6]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: 114143 (2023) - [j5]Quentin Bramas, Pascal Lafourcade, Stéphane Devismes:
Optimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality. Theor. Comput. Sci. 977: 114162 (2023) - [c38]Quentin Bramas:
Computing the Heaviest Conflict-Free Sub-DAG in DAG-Based DLTs. BRAINS 2023: 1-8 - [c37]Eloise Stein, Quentin Bramas, Tommaso Colombo, Cristel Pelsser:
Fault-adaptive Scheduling for Data Acquisition Networks. LCN 2023: 1-4 - [c36]Quentin Bramas, Toshimitsu Masuzawa, Sébastien Tixeuil:
Brief Announcement: Crash-Tolerant Exploration by Energy Sharing Mobile Agents. SSS 2023: 380-384 - [c35]Quentin Bramas, Sayaka Kamei, Anissa Lamani, Sébastien Tixeuil:
Stand-Up Indulgent Gathering on Lines. SSS 2023: 451-465 - [c34]Quentin Bramas, Jean-Romain Luttringer, Sébastien Tixeuil:
Offline Constrained Backward Time Travel Planning. SSS 2023: 466-480 - [i18]Quentin Bramas, Anissa Lamani, Sébastien Tixeuil:
Stand Up Indulgent Gathering. CoRR abs/2302.03466 (2023) - [i17]Quentin Bramas, Sayaka Kamei, Anissa Lamani, Sébastien Tixeuil:
Stand-Up Indulgent Gathering on Lines. CoRR abs/2304.05722 (2023) - [i16]Quentin Bramas, Jean-Romain Luttringer, Pascal Mérindol:
A Simple and General Operational Framework to Deploy Optimal Routes with Source Routing. CoRR abs/2311.17769 (2023) - [i15]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 abs/2312.12698 (2023) - 2022
- [j4]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: 109015 (2022) - [c33]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: 7:1-7:21 - [c32]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: 117-123 - [c31]Omar Darwich, Ahmet-Sefa Ulucan, Quentin Bramas, Anissa Lamani, Anaïs Durand, Pascal Lafourcade:
Perpetual Torus Exploration by Myopic Luminous Robots. SSS 2022: 164-177 - [c30]Jean-Philippe Abegg, Quentin Bramas, Thomas Noël:
Secret-less secured payment system for inter-broker communications. WiOpt 2022: 225-232 - [e3]Quentin Bramas, Vincent Gramoli, Alessia Milani:
25th International Conference on Principles of Distributed Systems, OPODIS 2021, December 13-15, 2021, Strasbourg, France. LIPIcs 217, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-219-8 [contents] - [d2]Omar Darwich, Ahmet-Sefa Ulucan, Quentin Bramas, Anissa Lamani, Anaïs Durand, Pascal Lafourcade:
Perpetual Torus Exploration by Myopic Luminous Robots: The Animations. Zenodo, 2022
- [i14]Quentin Bramas, Jean-Romain Luttringer, Sébastien Tixeuil:
Constrained Backward Time Travel Planning is in P. CoRR abs/2205.03372 (2022) - 2021
- [c29]Quentin Bramas, Anissa Lamani, Sébastien Tixeuil:
Stand up Indulgent Gathering. ALGOSENSORS 2021: 17-28 - [c28]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: 41-42 - [c27]Quentin Bramas, Pascal Lafourcade, Stéphane Devismes:
Finding Water on Poleless Using Melomaniac Myopic Chameleon Robots. FUN 2021: 6:1-6:19 - [c26]Quentin Bramas, Pascal Lafourcade, Stéphane Devismes:
Optimal Exclusive Perpetual Grid Exploration by Luminous Myopic Opaque Robots with Common Chirality. ICDCN 2021: 76-85 - [c25]Jean-Romain Luttringer, Quentin Bramas, Cristel Pelsser, Pascal Mérindol:
A Fast-Convergence Routing of the Hot-Potato. INFOCOM 2021: 1-10 - [c24]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: 95-110 - [c23]Jean-Philippe Abegg, Quentin Bramas, Thomas Noël:
Blockchain Using Proof-of-Interaction. NETYS 2021: 129-143 - [c22]Quentin Bramas:
Efficient and Secure TSA for the Tangle. NETYS 2021: 161-166 - [c21]Quentin Bramas, Anissa Lamani, Sébastien Tixeuil:
The Agreement Power of Disagreement. SSS 2021: 273-288 - [e2]Quentin Bramas, Rotem Oshman, Paolo Romano:
24th International Conference on Principles of Distributed Systems, OPODIS 2020, December 14-16, 2020, Strasbourg, France (Virtual Conference). LIPIcs 184, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-176-4 [contents] - [e1]Emmanuelle Anceaume, Christophe Bisière, Matthieu Bouvard, Quentin Bramas, Catherine Casamatta:
2nd International Conference on Blockchain Economics, Security and Protocols, Tokenomics 2020, October 26-27, 2020, Toulouse, France. OASIcs 82, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-157-3 [contents] - [d1]Quentin Bramas, Anissa Lamani, Sébastien Tixeuil:
The agreement power of disagreement: graph generation. Zenodo, 2021 - [i13]Jean-Romain Luttringer, Quentin Bramas, Cristel Pelsser, Pascal Mérindol:
A Fast-Convergence Routing of the Hot-Potato. CoRR abs/2101.09002 (2021) - [i12]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 abs/2110.09320 (2021) - [i11]Quentin Bramas:
Efficient and Secure TSA for the Tangle. CoRR abs/2110.14596 (2021) - 2020
- [c20]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: 1-8 - [c19]Quentin Bramas, Stéphane Devismes, Pascal Lafourcade:
Infinite Grid Exploration by Disoriented Robots. NETYS 2020: 129-145 - [c18]François Bonnet, Quentin Bramas, Xavier Défago:
Stateless Distributed Ledgers. NETYS 2020: 349-354 - [c17]Quentin Bramas, Anissa Lamani, Sébastien Tixeuil:
Stand Up Indulgent Rendezvous. SSS 2020: 45-59 - [i10]Jean-Philippe Abegg, Quentin Bramas, Thomas Noël:
Blockchain using Proof-of-Interaction. CoRR abs/2002.07763 (2020) - [i9]Bérenger Bramas, Quentin Bramas:
On the improvement of the in-place merge algorithm parallelization. CoRR abs/2005.12648 (2020) - [i8]François Bonnet, Quentin Bramas, Xavier Défago:
Stateless Distributed Ledgers. CoRR abs/2006.10985 (2020) - [i7]Quentin Bramas, Anissa Lamani, Sébastien Tixeuil:
Stand Up Indulgent Rendezvous. CoRR abs/2010.04400 (2020) - [i6]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 abs/2011.05191 (2020)
2010 – 2019
- 2019
- [j3]Quentin Bramas, Dianne Foreback, Mikhail Nesterenko, Sébastien Tixeuil:
Packet Efficient Implementation of the Omega Failure Detector. Theory Comput. Syst. 63(2): 237-260 (2019) - [c16]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: 90-101 - [c15]Vidal Attias, Quentin Bramas:
How to Choose Its Parents in the Tangle. NETYS 2019: 275-280 - [c14]Quentin Bramas, Toshimitsu Masuzawa, Sébastien Tixeuil:
Distributed Online Data Aggregation in Dynamic Graphs. NETYS 2019: 365-380 - [c13]Quentin Bramas, Stéphane Devismes, Pascal Lafourcade:
Infinite Grid Exploration by Disoriented Robots. SIROCCO 2019: 340-344 - [c12]Quentin Bramas:
The Stability and the Security of the Tangle. Tokenomics 2019: 8:1-8:15 - [i5]Quentin Bramas, Stéphane Devismes, Pascal Lafourcade:
Infinite Grid Exploration by Disoriented Robots. CoRR abs/1905.09271 (2019) - 2018
- [c11]Quentin Bramas, Sébastien Tixeuil:
Arbitrary Pattern Formation with Four Robots. SSS 2018: 333-348 - 2017
- [j2]Quentin Bramas, Sébastien Tixeuil:
The complexity of data aggregation in static and dynamic wireless sensor networks. Inf. Comput. 255: 369-383 (2017) - [j1]Quentin Bramas, Sébastien Tixeuil:
The Random Bit Complexity of Mobile Robots Scattering. Int. J. Found. Comput. Sci. 28(2): 111-134 (2017) - [c10]François Bonnet, Quentin Bramas, Xavier Défago, Thanh Dang Nguyen:
Killing Nodes as a Countermeasure to Virus Expansion. SIROCCO 2017: 227-243 - 2016
- [b1]Quentin Bramas:
Energy-Centric Wireless Sensor Networks. (Réseaux de capteurs sans fil efficaces en énergie). Pierre and Marie Curie University, Paris, France, 2016 - [c9]Quentin Bramas, Toshimitsu Masuzawa, Sébastien Tixeuil:
Distributed Online Data Aggregation in Dynamic Graphs. ICDCS 2016: 747-748 - [c8]Quentin Bramas, Sébastien Tixeuil:
Benchmarking Energy-Centric Broadcast Protocols in Wireless Sensor Networks. NETYS 2016: 87-101 - [c7]Quentin Bramas, Sébastien Tixeuil:
Brief Announcement: Probabilistic Asynchronous Arbitrary Pattern Formation. PODC 2016: 443-445 - [c6]Quentin Bramas, Dianne Foreback, Mikhail Nesterenko, Sébastien Tixeuil:
Packet Efficient Implementation of the Omega Failure Detector. SSS 2016: 70-87 - [c5]Quentin Bramas, Sébastien Tixeuil:
Probabilistic Asynchronous Arbitrary Pattern Formation (Short Paper). SSS 2016: 88-93 - [i4]Quentin Bramas, Toshimitsu Masuzawa, Sébastien Tixeuil:
Distributed Online Data Aggregation in Dynamic Graphs. CoRR abs/1602.01065 (2016) - 2015
- [c4]Quentin Bramas, Sébastien Tixeuil:
The Random Bit Complexity of Mobile Robots Scattering. ADHOC-NOW 2015: 210-224 - [c3]Quentin Bramas, Wilfried Dron, Mariem Ben Fadhl, Khalil Hachicha, Patrick Garda, Sébastien Tixeuil:
WiSeBat: accurate energy benchmarking of wireless sensor networks. FDL 2015: 40-47 - [c2]Quentin Bramas, Sébastien Tixeuil:
Wait-Free Gathering Without Chirality. SIROCCO 2015: 313-327 - [c1]Quentin Bramas, Sébastien Tixeuil:
The Complexity of Data Aggregation in Static and Dynamic Wireless Sensor Networks. SSS 2015: 36-50 - [i3]Quentin Bramas, Dianne Foreback, Mikhail Nesterenko, Sébastien Tixeuil:
Packet Efficient Implementation of the Omega Failure Detector. CoRR abs/1505.05025 (2015) - [i2]Quentin Bramas, Sébastien Tixeuil:
Asynchronous Pattern Formation without Chirality. CoRR abs/1508.03714 (2015) - 2013
- [i1]Quentin Bramas, Sébastien Tixeuil:
The Random Bit Complexity of Mobile Robots Scattering. CoRR abs/1309.6603 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-31 21:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
