6 citations · 6 across the 3 of their papers we have counts for
4 papers
A lightweight BFT consensus protocol for blockchains
Jan Hackfeld
We present a general consensus framework that allows to easily introduce a customizable Byzantine fault tolerant consensus algorithm to an existing (Delegated) Proof-of-Stake block…
Tight bounds for undirected graph exploration with pebbles and multiple agents
Yann Disser, Jan Hackfeld, Max Klimm
We study the problem of deterministically exploring an undirected and initially unknown graph with vertices either by a single agent equipped with a set of pebbles, or by a set…
Maximal Exploration of Trees with Energy-Constrained Agents
Evangelos Bampas, Jérémie Chalopin, Shantanu Das +2
We consider the problem of exploring an unknown tree with a team of initially colocated mobile agents. Each agent has limited energy and cannot, as a result, traverse more than…
Energy-efficient Delivery by Heterogeneous Mobile Agents
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das +4
We consider the problem of delivering messages between specified source-target pairs in a weighted undirected graph, by mobile agents initially located at distinct nodes of…