Search For:

Displaying 1-5 out of 5 total
The Power of Lights: Synchronizing Asynchronous Robots Using Visible Bits
Found in: 2012 IEEE 32nd International Conference on Distributed Computing Systems (ICDCS)
By Shantanu Das,Paola Flocchini,Giuseppe Prencipe,Nicola Santoro,Masafumi Yamashita
Issue Date:June 2012
pp. 506-515
In this paper we study the power of using lights, i.e. visible external memory, for distributed computation by autonomous robots moving in Look-Compute-Move (LCM) cycles. With respect to the LCM cycles, the most common models studied in the literature are ...
 
Guest Editors' Introduction: Algorithms and Today's Practitioner
Found in: IEEE Software
By Giuseppe Prencipe,Cesare Zavattari,Alessandro Tommasi,John Favaro
Issue Date:January 2012
pp. 61-63
Enormous advances in computing power and programming environments have obscured the importance of algorithms, one of the foundational pillars of software engineering. Today, even university curricula too often pay only lip service to the teaching of algori...
 
Distributed Minimum Spanning Tree Maintenance for Transient Node Failures
Found in: IEEE Transactions on Computers
By Paola Flocchini,T. Mesa Enriquez,Linda Pagli,Giuseppe Prencipe,Nicola Santoro
Issue Date:March 2012
pp. 408-414
In many network applications, the computation takes place on the minimum-cost spanning tree (MST) of the network G; unfortunately, a single link or node failure disconnects the tree. The ALL NODES REPLACEMENT (ANR) problem is the problem of precomputing, f...
 
Distribution Sweeping on Clustered Machines with Hierarchical Memories
Found in: Parallel and Distributed Processing Symposium, International
By Frank Dehne, Stefano Mardegan, Andrea Pietracaprina, Giuseppe Prencipe
Issue Date:April 2002
pp. 0031b
This paper investigates the design of parallel algorithmic strategies that address the efficient use of both, memory hierarchies within each processor and a multilevel clustered structure of the interconnection between processors. In the past, these phenom...
 
Searching for a black hole in arbitrary networks: optimal mobile agent protocols
Found in: Proceedings of the twenty-first annual symposium on Principles of distributed computing (PODC '02)
By Giuseppe Prencipe, Nicola Santoro, Paola Flocchini, Stefan Dobrev
Issue Date:July 2002
pp. 153-162
Protecting agents from host attacks is a pressing security concern in networked environments supporting mobile agents. In this paper, we consider a black hole: a highly harmful host that disposes of visiting agents upon their arrival, leaving no observable...
     
 1