A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
In this paper we summarize the experiences we made with the implementation of a table tennis application. After describing the hardware necessities of our system we give insight i...
In this paper, we analyze attacks on existing time synchronization protocols for wireless sensor networks. We propose a secure time synchronization toolbox to counter these attack...
We propose a technique for the automated synthesis of new comeb services. Given a set of abstract BPEL4WS descriptions of component services, and a composition requirement, we aut...
Marco Pistore, Paolo Traverso, Piergiorgio Bertoli...