( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Computing Delay-Constrained Least-Cost Paths for Segment Routing is Easier Than You Think.

, , , , , и . NCA, стр. 1-8. IEEE, (2020)

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.

Quentin Bramas

Bérenger Bramas

Albrecht Quentin

Sabine Quentin

Quentin Alamélou

 

Другие публикации лиц с тем же именем

Packet Efficient Implementation of the Omega Failure Detector., , , и . Theory Comput. Syst., 63 (2): 237-260 (2019)Deploying Near-Optimal Delay-Constrained Paths with Segment Routing in Massive-Scale Networks., , , , , и . CoRR, (2021)Stand-Up Indulgent Gathering on Rings., , , и . CoRR, (2024)How to Choose Its Parents in the Tangle., и . NETYS, том 11704 из Lecture Notes in Computer Science, стр. 275-280. Springer, (2019)A Fast-Convergence Routing of the Hot-Potato., , , и . INFOCOM, стр. 1-10. IEEE, (2021)Secret-less secured payment system for inter-broker communications., , и . WiOpt, стр. 225-232. IEEE, (2022)Deploying near-optimal delay-constrained paths with Segment Routing in massive-scale networks., , , , , и . Comput. Networks, (2022)The Agreement Power of Disagreement., , и . SSS, том 13046 из Lecture Notes in Computer Science, стр. 273-288. Springer, (2021)Stand-Up Indulgent Gathering on Lines., , , и . SSS, том 14310 из Lecture Notes in Computer Science, стр. 451-465. Springer, (2023)The Stability and the Security of the Tangle.. Tokenomics, том 71 из OASIcs, стр. 8:1-8:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)