activity
20192021
most citedOn the improvement of the in-place merge algorithm parallelization

1 citations · 1 across the 4 of their papers we have counts for

collaborators

8 papers

cs.CR2021

Efficient and Secure TSA for the Tangle

Quentin Bramas

The Tangle is the data structure used to store transactions in the IOTA cryptocurrency. In the Tangle, each block has two parents. As a result, the blocks do not form a chain, but…

cs.NI2021

A Fast-Convergence Routing of the Hot-Potato

Jean-Romain Luttringer, Quentin Bramas, Cristel Pelsser +1

Interactions between the intra- and inter-domain routing protocols received little attention despite playing an important role in forwarding transit traffic. More precisely, by def…

cs.NI2020

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…

cs.DC2020

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…

cs.CR2020

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…

cs.DC20201 cited

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…