5 citations · 6 across the 14 of their papers we have counts for
5 papers · 1 filter
Computing Delay-Constrained Least-Cost Paths for Segment Routing is Easier Than You Think
Jean-Romain Luttringer, Thomas Alfroy, Pascal Mérindol +3
With the growth of demands for quasi-instantaneous communication services such as real-time video streaming, cloud gaming, and industry 4.0 applications, multi-constraint Traffic E…
Stand Up Indulgent Rendezvous
Quentin Bramas, Anissa Lamani, Sébastien Tixeuil
We consider two mobile oblivious robots that evolve in a continuous Euclidean space. We require the two robots to solve the rendezvous problem (meeting in finite time at the same l…
Stateless Distributed Ledgers
François Bonnet, Quentin Bramas, Xavier Défago
In public distributed ledger technologies (DLTs), such as Blockchains, nodes can join and leave the network at any time. A major challenge occurs when a new node joining the networ…
On the improvement of the in-place merge algorithm parallelization
Berenger Bramas, Quentin Bramas
In this paper, we present several improvements in the parallelization of the in-place merge algorithm, which merges two contiguous sorted arrays into one with an O(T) space complex…
Blockchain using Proof-of-Interaction
Jean-Philippe Abegg, Quentin Bramas, Thomas Noel
This paper we define a new Puzzle called Proof-of-Interaction and we show how it can replace, in the Bitcoin protocol, the Proof-of-Work algorithm.