Selected papers:
-
Statistical and computational thresholds for the planted k-densest sub-hypergraph problem.
Luca Corinzia, Paolo Penna, Wojciech Szpankowski, Joachim M. Buhmann.
AISTATS 2022.
-
Optimal Sorting with Persistent Comparison Errors.
Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna.
ESA 2019.
-
No truthful mechanism can be better than n approximate for two natural problems.
Stefano Leucci, Akaki Mamageishvili, Paolo Penna.
Games and Economic Behavior (Vol. 111, 2018).
-
The price of anarchy and stability in general noisy best-response dynamics.
Paolo Penna.
International Journal of Game Theory (Vol. 47, 2018).
-
Optimal collusion-resistant mechanisms with verification.
Paolo Penna and Carmine Ventre.
Games and Economic Behavior 86: 491-509 (2014).
Documents:
slides ppt
meta bibtex.
-
On-line load balancing made simple: Greedy strikes back.
Pilu Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, and Walter Unger.
Journal of Discrete Algorithms 5:162-175, 2007.
Documents:
slides pdf
meta bibtex.
-
XOR-based schemes for fast parallel IP lookups.
Giancarlo Bongiovanni and Paolo Penna.
Theory of Computing Systems 38(4): 481-501, 2005.
Documents:
meta bibtex.
-
On the Power Assignment Problem in Radio Networks.
Andrea Clementi, Paolo Penna, and Riccardo Silvestri.
Mobile Networks and Applications, 9(2): 125-140, 2004.
Journal version combining the results in APPROX 1999 and STACS 2000 papers.
Documents:
paper pdf
meta bibtex.
-
Strictly-upward drawings of ordered search trees.
Pierluigi Crescenzi and Paolo Penna.
Theoretical Computer Science, 203(1): 51-67, 1998.
Documents:
meta bibtex.