1 citations · 1 across the 2 of their papers we have counts for
Showing cs.DCShow all
2 papers · 1 filter
cs.DC2025
Perpetual exploration in anonymous synchronous networks with a Byzantine black hole
Adri Bhattacharya, Pritam Goswami, Evangelos Bampas +1
In this paper, we investigate: ``How can a group of initially co-located mobile agents perpetually explore an unknown graph, when one stationary node occasionally behaves malicious…
cs.DC2012★ 1 cited
Self-Stabilizing Balancing Algorithm for Containment-Based Trees
Evangelos Bampas, Anissa Lamani, Franck Petit +1
Containment-based trees encompass various handy structures such as B+-trees, R-trees and M-trees. They are widely used to build data indexes, range-queryable overlays, publish/subs…