Montgomery’s algorithm [8], hereafter denoted Mn(·, ·), is a process for computing Mn(A, B) = ABN mod n where N is a constant factor depending only on n. Usually, AB mod n is o...
Because of their severe resource-restrictions and limited user interfaces, smart everyday objects must often rely on remote resources to realize their services. This paper shows ho...
Given the dizzying pace of change in computer science, trying to look too far into the future of software engineering is hard. However, it might be possible to predict the future ...
This paper presents "Self-Chord," a peer-to-peer (P2P) system that inherits the ability of Chord-like structured systems for the construction and maintenance of an overla...
Agostino Forestiero, Emilio Leonardi, Carlo Mastro...
Abstract: File-sharing in mobile networks has differing demands to a P2P architecture. Resource access and mediation techniques must follow constraints given in 2.5G/3G networks. E...
Frank-Uwe Andersen, Hermann de Meer, Ivan Dedinski...