( en | de | ru )

 

Disambiguation of "Bramas, Quentin"

Author of the publication

copydeleteadd this publication to your clipboard
Computing the Heaviest Conflict-Free Sub-DAG in DAG-Based DLTs.

. BRAINS, page 1-8. IEEE, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Quentin Bramas

Bérenger Bramas

Albrecht Quentin

Sabine Quentin

Quentin Alamélou

 

Other publications of authors with the same name

Deploying near-optimal delay-constrained paths with Segment Routing in massive-scale networks., , , , , and . Comput. Networks, (2022)Optimal Exclusive Perpetual Grid Exploration by Luminous Myopic Opaque Robots with Common Chirality., , and . ICDCN, page 76-85. ACM, (2021)Distributed Publish/Subscribe Protocol with Minimum Number of Encryption., , , and . ICDCN, page 117-123. ACM, (2022)The Stability and the Security of the Tangle.. Tokenomics, volume 71 of OASIcs, page 8:1-8:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)The Agreement Power of Disagreement., , and . SSS, volume 13046 of Lecture Notes in Computer Science, page 273-288. Springer, (2021)Stand-Up Indulgent Gathering on Lines., , , and . SSS, volume 14310 of Lecture Notes in Computer Science, page 451-465. Springer, (2023)Packet Efficient Implementation of the Omega Failure Detector., , , and . Theory Comput. Syst., 63 (2): 237-260 (2019)Stand-Up Indulgent Gathering on Rings., , , and . CoRR, (2024)Deploying Near-Optimal Delay-Constrained Paths with Segment Routing in Massive-Scale Networks., , , , , and . CoRR, (2021)A Fast-Convergence Routing of the Hot-Potato., , , and . INFOCOM, page 1-10. IEEE, (2021)