Quentin Bramas

Orcid: 0000-0003-0612-5616

According to our database1, Quentin Bramas authored at least 44 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Stand-Up Indulgent Gathering on Rings.
CoRR, 2024

Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots.
Proceedings of the Advanced Information Networking and Applications, 2024

2023
Perpetual torus exploration by myopic luminous robots.
Theor. Comput. Sci., October, 2023

Optimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality.
Theor. Comput. Sci., October, 2023

The agreement power of disagreement.
Theor. Comput. Sci., 2023

Stand up indulgent gathering.
Theor. Comput. Sci., 2023

A Simple and General Operational Framework to Deploy Optimal Routes with Source Routing.
CoRR, 2023

Brief Announcement: Crash-Tolerant Exploration by Energy Sharing Mobile Agents.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2023

Offline Constrained Backward Time Travel Planning.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2023

Stand-Up Indulgent Gathering on Lines.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2023

Fault-adaptive Scheduling for Data Acquisition Networks.
Proceedings of the 48th IEEE Conference on Local Computer Networks, 2023

Computing the Heaviest Conflict-Free Sub-DAG in DAG-Based DLTs.
Proceedings of the 5th Conference on Blockchain Research & Applications for Innovative Networks and Services, 2023

2022
Constrained Backward Time Travel Planning is in P.
CoRR, 2022

Deploying near-optimal delay-constrained paths with Segment Routing in massive-scale networks.
Comput. Networks, 2022

Secret-less secured payment system for inter-broker communications.
Proceedings of the 20th International Symposium on Modeling and Optimization in Mobile, 2022

Distributed Publish/Subscribe Protocol with Minimum Number of Encryption.
Proceedings of the ICDCN '22: 23rd International Conference on Distributed Computing and Networking, Delhi, AA, India, January 4, 2022

Beedroids: How Luminous Autonomous Swarms of UAVs Can Save the World?
Proceedings of the 11th International Conference on Fun with Algorithms, 2022

2021
Optimal Exclusive Perpetual Grid Exploration by Luminous Myopic Robots Without Common Chirality.
Proceedings of the Networked Systems - 9th International Conference, 2021

Efficient and Secure TSA for the Tangle.
Proceedings of the Networked Systems - 9th International Conference, 2021

Blockchain Using Proof-of-Interaction.
Proceedings of the Networked Systems - 9th International Conference, 2021

A Fast-Convergence Routing of the Hot-Potato.
Proceedings of the 40th IEEE Conference on Computer Communications, 2021

Finding Water on Poleless Using Melomaniac Myopic Chameleon Robots.
Proceedings of the 10th International Conference on Fun with Algorithms, 2021

SUPRA, a distributed publish/subscribe protocol with blockchain as a conflict resolver.
Proceedings of the 3rd Conference on Blockchain Research & Applications for Innovative Networks and Services, 2021

2020
On the improvement of the in-place merge algorithm parallelization.
CoRR, 2020

Stand Up Indulgent Rendezvous.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2020

Infinite Grid Exploration by Disoriented Robots.
Proceedings of the Networked Systems - 8th International Conference, 2020

Stateless Distributed Ledgers.
Proceedings of the Networked Systems - 8th International Conference, 2020

Computing Delay-Constrained Least-Cost Paths for Segment Routing is Easier Than You Think.
Proceedings of the 19th IEEE International Symposium on Network Computing and Applications, 2020

2019
Packet Efficient Implementation of the Omega Failure Detector.
Theory Comput. Syst., 2019

The Stability and the Security of the Tangle.
Proceedings of the International Conference on Blockchain Economics, 2019

Distributed Online Data Aggregation in Dynamic Graphs.
Proceedings of the Networked Systems - 7th International Conference, 2019

How to Choose Its Parents in the Tangle.
Proceedings of the Networked Systems - 7th International Conference, 2019

Analysis of the Network Attachment Delay of Mobile Devices in the Industrial Internet of Things.
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, 2019

2018
Arbitrary Pattern Formation with Four Robots.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2018

2017
The Random Bit Complexity of Mobile Robots Scattering.
Int. J. Found. Comput. Sci., 2017

The complexity of data aggregation in static and dynamic wireless sensor networks.
Inf. Comput., 2017

Killing Nodes as a Countermeasure to Virus Expansion.
Proceedings of the Structural Information and Communication Complexity, 2017

2016
Energy-Centric Wireless Sensor Networks. (Réseaux de capteurs sans fil efficaces en énergie).
PhD thesis, 2016

Probabilistic Asynchronous Arbitrary Pattern Formation (Short Paper).
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2016

Brief Announcement: Probabilistic Asynchronous Arbitrary Pattern Formation.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Benchmarking Energy-Centric Broadcast Protocols in Wireless Sensor Networks.
Proceedings of the Networked Systems - 4th International Conference, 2016

2015
Asynchronous Pattern Formation without Chirality.
CoRR, 2015

Wait-Free Gathering Without Chirality.
Proceedings of the Structural Information and Communication Complexity, 2015

WiSeBat: accurate energy benchmarking of wireless sensor networks.
Proceedings of the 2015 Forum on Specification and Design Languages, 2015


  Loading...