Papers

Please read the copyright notice

A. Clementi, A. Monti, and R. Silvestri. Round Robin is Optimal for Fault-Tolerant Broadcasting on Wireless Networks. In 9th European Symposium on Algorithms (ESA'01), September 2001.

A. Clementi, P. Crescenzi, A. Monti, P. Penna, and R. Silvestri. On Computing Ad-Hoc Selective Families. 5th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM'01), August 2001.

A. Clementi, A. Monti, and R. Silvestri. Distributed Multi-Broadcast in Unknown Radio Networks. 20th ACM Symposium on Principles of Distributed Computing (PODC'01), August 2001.

A. Clementi, A. Monti, and R. Silvestri. Selective Families, Superimposed Codes, and Broadcasting in Unknown Radio Networks. In. 12th ACM-SIAM Symposium On Discrete Algorithms (SODA'01), 709--718 (2001).

A. Clementi, P. Crescenzi, P. Penna, G. Rossi and P. Vocca. On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. In. Proc. of STACS`01, 18th Annual Symposium on Theoretical Aspects of Computer Science, LNCS 2010, 2001.

A. Clementi, P. Crescenzi, P. Penna, G. Rossi and P. Vocca. A Worse-case Analysis of a MST-based Heuristic to Construct Energy-efficient Broadcast Subtrees in WIreless Networks. In. Technical Report 010 of the Univ. of Rome "Tor Vergata", 2001.

A. Clementi, A. Ferreira, P. Penna, S. Perennes and R. Silvestri. The Minimum Range Assignment Problem on Linear Radio Networks. In Proc. ESA'00; 8th Annual European Symposium on Algorithms, LNCS 1879, pag. 143-154, 2000.

A. Clementi, G. Bongiovanni and P. Penna. A Note on Parallel Read Operations on Large Public Databases. In Proc of ARACNE'00, International Workshop on Approximation and Randomized Algorithms in Communication Networks, Carleton Scientific Press, pag.123-133, 2000.

A. Clementi, P. Penna and R. Silvestri. The Power Range Assignment Problem in Radio Networks on the Plane. In Proc. of STACS`00, 17th Annual Symposium on Theoretical Aspects of Computer Science, LNCS 1770, pag. 651-660, 2000.

A. Andreev, A. Clementi, P. Penna and J. Rolim. Parallel Read Operations Without Memory Contention. In. Technical Report TR00-053 of the ECCC, 2000.

A. Clementi, P. Penna and R. Silvestri. On The Power Range Assignment Problem on Radio Networks. In. Technical Report TR00-054 of the ECCC, 2000.

A. Clementi, P. Penna and R. Silvestri. Hardness Results for The Power Range Assignment Problem in Packet Radio Networks. In Proc. of RANDOM-APPROX`99, Randomization, Approximation and Combinatorial Optimization, LNCS 1671, pag. 197-208, 1999.

A. Clementi, P. Crescenzi, and G. Rossi. On the Complexity of Approximating Colored-Graph Problems. In. IV Annual International Computing and Combinatorics Conference (COCOON'99), LNCS, 1627, Springer-Verlag (1999).

A. Andreev, A. Clementi, P. Penna and J. Rolim. Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines. In Proc. of STACS`99, 16th Annual Symposium on Theoretical Aspects of Computer Science, LNCS 1563, pag. 68-77, 1999.