3 citations · 4 across the 3 of their papers we have counts for
3 papers
cs.DS2017★ 3 cited
Data Delivery by Mobile Agents with Energy Constraints over a fixed path
Aristotelis Giannakos, Mhand Hifi, Gregory Karagiorgos
We consider mobile agents of limited energy that are initially located at vertices of an edge-weighted graph and have to collectively deliver data from a source vertex …
cs.DS2010★ 1 cited
Enhanced Random Walk with Choice: An Empirical Study
John Alexandris, Gregory Karagiorgos 'and' Ioannis Stavrakakis
The random walk with choice is a well known variation to the random walk that first selects a subset of neighbours nodes and then decides to move to the node which maximizes th…
cs.DS2008
Efficient algorithms for the basis of finite Abelian groups
Gregory Karagiorgos, Dimitrios Poulakis
Let be a finite abelian group with elements. In this paper we give a O(N) time algorithm for computing a basis of . Furthermore, we obtain an algorithm for computing…