research
∙
04/12/2023
Stand-Up Indulgent Gathering on Lines
We consider a variant of the crash-fault gathering problem called stand-...
share
research
∙
02/07/2023
Stand Up Indulgent Gathering
We consider a swarm of mobile robots evolving in a bidimensional Euclide...
research
∙
05/04/2022
Constrained Backward Time Travel Planning is in P
We consider transportation networks that are modeled by dynamic graphs, ...
research
∙
10/26/2021
Efficient and Secure TSA for the Tangle
The Tangle is the data structure used to store transactions in the IOTA ...
research
∙
10/18/2021
Deploying Near-Optimal Delay-Constrained Paths with Segment Routing in Massive-Scale Networks
With a growing demand for quasi-instantaneous communication services suc...
research
∙
01/22/2021
A Fast-Convergence Routing of the Hot-Potato
Interactions between the intra- and inter-domain routing protocols recei...
research
∙
11/10/2020
Computing Delay-Constrained Least-Cost Paths for Segment Routing is Easier Than You Think
With the growth of demands for quasi-instantaneous communication service...
research
∙
10/09/2020
Stand Up Indulgent Rendezvous
We consider two mobile oblivious robots that evolve in a continuous Eucl...
research
∙
06/19/2020
Stateless Distributed Ledgers
In public distributed ledger technologies (DLTs), such as Blockchains, n...
research
∙
05/26/2020
On the improvement of the in-place merge algorithm parallelization
In this paper, we present several improvements in the parallelization of...
research
∙
02/17/2020
Blockchain using Proof-of-Interaction
This paper we define a new Puzzle called Proof-of-Interaction and we sho...
research
∙
05/22/2019
