So what is all this DTN research about anyway? Sceptics ask: "Why are there no DTN applications?", or "Why is DTN performance so miserable?" This article attem...
Jon Crowcroft, Eiko Yoneki, Pan Hui, Tristan Hende...
: Following Etherington, Hoge and Parkes, we consider a network consisting of (approximately) N transceivers in the plane R2 distributed randomly with density given by a Gaussian d...
ABSTRACT. In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least dist...
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...
Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Ko...
In this paper, a structural theorem about toroidal graphs is given that strengthens a result of Borodin on plane graphs. As a consequence, it is proved that every toroidal graph w...