This paper proposes a general definition of self-stabilizing wait-free shared memory objects. The definition ensures that, even in the face of processor failures, every executio...
We present lock-free and wait-free universal constructions for implementing large shared objects. Most previous universal constructions require processes to copy the entire object...
We consider the problem of obtaining “nice” quadrangulations of planar sets of points. For many applications “nice” means that the quadrilaterals obtained are convex if po...
We examine the problem of transmitting in minimum time a given amount of data between a source and a destination in a network with finite channel capacities and non–zero propaga...
Dimitrios Kagaris, Spyros Tragoudas, Grammati E. P...