Biographical sketch:
 

• 1972: Born in Rome, Italy.
• 1996: Degree in Computer Science at the University of Rome ``La Sapienza''.
• Since Nov 1996:  PhD student in Computer Science at the University of Rome ``La Sapienza'' jointly  with the University of Rome ``Tor Vergata'',  advised by Giorgio Gambosi (University of Rome ``Tor Vergata'', Math Department).
• Since Apr 1999: Visiting the research center of INRIA (Institut National de Recherche en Informatique et Automatique) in Sophia Antipolis (SLOOP project) advised by Afonso Ferreira.

List of publications [Copyright Notice]:
 

• A. Clementi, A. Ferreira, P. Penna, S. Perennes and R. Silvestri. The Minimum Range Assignment Problem on Linear Radio Networks. In Proc. ESA'00, LNCS, pag. 143-154, 2000.

• P. Crescenzi, G. Gambosi and P. Penna. On-line Algorithms for the Channel Assignment Problem in Cellular Networks. In Proc. ACM DIALM'00, International Workshop on Discrete Algorithms and Methods for Mobile Computing, pag. 1-7, 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.

• P. Penna. Succinct Representations of Model Based Belief Revision. In Proc. of STACS`00, 17th Annual Symposium on Theoretical Aspects of Computer Science, LNCS 1770, pag. 205-216, 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.

•  P. Crescenzi, G. Gambosi and P. Penna. On-line load balancing with restricted task types. In Proc. of WSDAAL`99, Workshop su Sistemi Distribuiti: Algoritmi, Architetture e Linguaggi.

• 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. 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.

• P. Crescenzi and P. Penna. Strictly-upward drawings of ordered search trees. Theoretical Computer Science,  Vol. 203, No. 1, pag. 51-67, 1998.

• P. Crescenzi, P. Penna and A. Piperno. Linear Area Upward Drawings of AVL Trees. Computational Geometry: Theory and Application, Vol. 9, No. 1-2, pag. 25-42, 1998.

• P. Penna and P. Vocca. Polynomial Area Proximity Drawings of Binary Trees. In Proc. of CCCG`98, Canadian Conference on Computational Geometry.

• P. Penna and P. Vocca. Proximity Drawings: Three Dimensions are Better than Two. In Proc. of GD`98, Graph Drawing, LNCS 1547, pag. 275-287.

• P. Crescenzi and P. Penna. Minimum-Area h-v Drawings of Complete Binary Trees. In Proc. of GD`97, Graph Drawing,  LNCS 1353, pag. 371-382, 1997.

• P. Crescenzi and P. Penna. Upward Drawings of Search Trees. In. Proc of WG `96, Workshop on Graph Theoretic Concepts in Computer Science, LNCS  1197, pag. 114-125, 1997.

• P. Penna and P. Vocca. Proximity Drawings in Polynomial Area and Volume. Submitted to international journal.
• A. Andreev, A. Clementi, P. Penna and J. Rolim. Parallel Read Operations Without Memory Contention. Submitted to international journal.
• A. Clementi, P. Penna and R. Silvestri. On The Power Range Assignment Problem on Radio Networks. Submitted to international journal.

How to Contact:

Phone:           +33 (0)4 92 38 76 73

Fax:               +33 (0)4 92 38 79 71

Email:           penna@mat.uniroma2.it

Snail mail :

    Paolo Penna
    INRIA Sophia Antipolis
    2004, route des lucioles, BP. 93
    FR-06902 Sophia Antipolis Cedex
    France