4 citations · 5 across the 4 of their papers we have counts for
4 papers
Minimum Certificate Dispersal with Tree Structures
Taisuke Izumi, Tomoko Izumi, Hirotaka Ono +1
Given an n-vertex graph G=(V,E) and a set R \subseteq {{x,y} | x,y \in V} of requests, we consider to assign a set of edges to each vertex in G so that for every request {u, v} in…
The BG-simulation for Byzantine Mobile Robots
Taisuke Izumi, Zohir Bouzid, Sébastien Tixeuil +1
This paper investigates the task solvability of mobile robot systems subject to Byzantine faults. We first consider the gathering problem, which requires all robots to meet in fini…
Emergent velocity agreement in robot networks
Davide Canepa, Xavier Défago, Taisuke Izumi +1
In this paper we propose and prove correct a new self-stabilizing velocity agreement (flocking) algorithm for oblivious and asynchronous robot networks. Our algorithm allows a floc…
Physical expander in Virtual Tree Overlay
Taisuke Izumi, Maria Potop-Butucaru, Mathieu Valero
In this paper, we propose a new construction of constantdegree expanders motivated by their application in P2P overlay networks and in particular in the design of robust trees over…