Paolo Penna - RankMe

144 papers A* 4A 18B 24C 8Journal 68Unranked 21

Year	Rank	Type	Title / Venue / Authors
2025	A*	`conf`	Airdrop Games. IJCAI Sotiris Georganas, Aggelos Kiayias, Paolo Penna
2025	J	`jnl`	Airdrop Games. CoRR Sotiris Georganas, Aggelos Kiayias, Paolo Penna
2025	J	`jnl`	Algorithmic Monetary Policies for Blockchain Participation Games. CoRR Diodato Ferraioli, Paolo Penna, Manvir Schneider, Carmine Ventre
2025	J	`jnl`	An Optimal Sorting Algorithm for Persistent Random Comparison Faults. CoRR Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
2025	J	`jnl`	On Sybil-proofness in Restaking Networks. CoRR Tarun Chitra, Paolo Penna, Manvir Schneider
2025	—	`conf`	Reward Schemes and Committee Sizes in Proof of Stake Governance. FC (2) Georgios Birmpas, Philip Lazos, Evangelos Markakis, Paolo Penna
2025	A	`conf`	Serial Monopoly on Blockchains with Quasi-patient Users. FC Paolo Penna, Manvir Schneider
2025	B	`conf`	Single-Token vs Two-Token Blockchain Tokenomics. AFT Aggelos Kiayias, Philip Lazos, Paolo Penna
2025	J	`jnl`	Two-way Greedy: Algorithms for Imperfect Rationality. ACM Trans. Economics and Comput. Diodato Ferraioli, Paolo Penna, Carmine Ventre
2024	J	`jnl`	Reward Schemes and Committee Sizes in Proof of Stake Governance. CoRR Georgios Birmpas, Philip Lazos, Evangelos Markakis, Paolo Penna
2024	J	`jnl`	Sequential solutions in machine scheduling games. J. Sched. Cong Chen, Paul Giessler, Akaki Mamageishvili, Matús Mihalák, Paolo Penna
2024	J	`jnl`	Serial Monopoly on Blockchains with Quasi-patient Users. CoRR Paolo Penna, Manvir Schneider
2024	J	`jnl`	Single-token vs Two-token Blockchain Tokenomics. CoRR Aggelos Kiayias, Philip Lazos, Paolo Penna
2023	J	`jnl`	Improving Explainability of Disentangled Representations using Multipath-Attribution Mappings. CoRR Lukas Klein, João B. S. Carvalho, Mennatallah El-Assady, Paolo Penna, Joachim M. Buhmann, Paul F. Jaeger
2023	J	`jnl`	New Constructions of Obviously Strategyproof Mechanisms. Math. Oper. Res. Diodato Ferraioli, Adrian Meier, Paolo Penna, Carmine Ventre
2022	—	`conf`	Improving Explainability of Disentangled Representations using Multipath-Attribution Mappings. MIDL Lukas Klein, João B. S. Carvalho, Mennatallah El-Assady, Paolo Penna, Joachim M. Buhmann, Paul F. Jaeger
2022	A	`conf`	Statistical and computational thresholds for the planted k-densest sub-hypergraph problem. AISTATS Luca Corinzia, Paolo Penna, Wojciech Szpankowski, Joachim M. Buhmann
2021	B	`conf`	On maximum-likelihood estimation in the all-or-nothing regime. ISIT Luca Corinzia, Paolo Penna, Wojciech Szpankowski, Joachim M. Buhmann
2021	J	`jnl`	On maximum-likelihood estimation in the all-or-nothing regime. CoRR Luca Corinzia, Paolo Penna, Wojciech Szpankowski, Joachim M. Buhmann
2021	J	`jnl`	Optimal Clustering in Stable Instances Using Combinations of Exact and Noisy Ordinal Queries. Algorithms Enrico Bianchi, Paolo Penna
2021	—	`conf`	Two-Way Greedy: Algorithms for Imperfect Rationality. WINE Diodato Ferraioli, Paolo Penna, Carmine Ventre
2020	J	`jnl`	A Robust Framework for Analyzing Gradient-Based Dynamics in Bilinear Games. CoRR Ioannis Anagnostides, Paolo Penna
2020	—	`conf`	Novel Paradigm for the design of Obviously Strategyproof Mechanisms. ICTCS Diodato Ferraioli, Adrian Meier, Paolo Penna, Carmine Ventre
2020	J	`jnl`	Online scheduling of jobs with favorite machines. Comput. Oper. Res. Cong Chen, Paolo Penna, Yinfeng Xu
2020	J	`jnl`	Optimal Dislocation with Persistent Errors in Subquadratic Time. Theory Comput. Syst. Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
2020	—	`conf`	Sequential Solutions in Machine Scheduling Games. WINE Cong Chen, Paul Giessler, Akaki Mamageishvili, Matús Mihalák, Paolo Penna
2020	J	`jnl`	Solving Zero-Sum Games through Alternating Projections. CoRR Ioannis Anagnostides, Paolo Penna
2020	J	`jnl`	Statistical and computational thresholds for the planted k-densest sub-hypergraph problem. CoRR Luca Corinzia, Paolo Penna, Wojciech Szpankowski, Joachim M. Buhmann
2020	J	`jnl`	Two-way Greedy: Algorithms for Imperfect Rationality. CoRR Diodato Ferraioli, Paolo Penna, Carmine Ventre
2019	—	`conf`	Automated Optimal OSP Mechanisms for Set Systems - The Case of Small Domains. WINE Diodato Ferraioli, Adrian Meier, Paolo Penna, Carmine Ventre
2019	B	`conf`	Dual-Mode Greedy Algorithms Can Save Energy. ISAAC Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna, Guido Proietti
2019	B	`conf`	Exact Recovery for a Family of Community-Detection Generative Models. ISIT Luca Corinzia, Paolo Penna, Luca Mondada, Joachim M. Buhmann
2019	J	`jnl`	Exact Recovery for a Family of Community-Detection Generative Models. CoRR Luca Corinzia, Paolo Penna, Luca Mondada, Joachim M. Buhmann
2019	C	`conf`	Independent Lazy Better-Response Dynamics on Network Games. CIAC Paolo Penna, Laurent Viennot
2019	A	`conf`	Obviously Strategyproof Mechanisms for Machine Scheduling. ESA Diodato Ferraioli, Adrian Meier, Paolo Penna, Carmine Ventre
2019	A	`conf`	Optimal Sorting with Persistent Comparison Errors. ESA Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
2018	B	`conf`	Equilibria of Games in Networks for Local Tasks. OPODIS Simon Collet, Pierre Fraigniaud, Paolo Penna
2018	B	`conf`	Inversions from Sorting with Distance-Based Errors. SOFSEM Barbara Geissmann, Paolo Penna
2018	J	`jnl`	No truthful mechanism can be better than Games Econ. Behav. Stefano Leucci, Akaki Mamageishvili, Paolo Penna
2018	J	`jnl`	On the approximation guarantee of obviously strategyproof mechanisms. CoRR Diodato Ferraioli, Adrian Meier, Paolo Penna, Carmine Ventre
2018	J	`jnl`	Online scheduling of jobs with favorite machines. CoRR Cong Chen, Paolo Penna, Yinfeng Xu
2018	A	`conf`	Optimal Dislocation with Persistent Errors in Subquadratic Time. STACS Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
2018	J	`jnl`	Optimal Sorting with Persistent Comparison Errors. CoRR Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
2018	J	`jnl`	The price of anarchy and stability in general noisy best-response dynamics. Int. J. Game Theory Paolo Penna
2017	A	`conf`	Energy-Efficient Delivery by Heterogeneous Mobile Agents. STACS Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, Paolo Penna
2017	J	`jnl`	No truthful mechanism can be better than n approximate for two natural problems. CoRR Stefano Leucci, Akaki Mamageishvili, Paolo Penna
2017	J	`jnl`	Selfish Jobs with Favorite Machines: Price of Anarchy vs Strong Price of Anarchy. CoRR Cong Chen, Paolo Penna, Yinfeng Xu
2017	—	`conf`	Selfish Jobs with Favorite Machines: Price of Anarchy vs. Strong Price of Anarchy. COCOA (2) Cong Chen, Paolo Penna, Yinfeng Xu
2017	B	`conf`	Sorting with Recurrent Comparison Errors. ISAAC Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
2017	J	`jnl`	Sorting with Recurrent Comparison Errors. CoRR Barbara Geissmann, Stefano Leucci, Chih-Hung Liu, Paolo Penna
2017	C	`conf`	Truthful Mechanisms for Delivery with Agents. ATMOS Andreas Bärtschi, Daniel Graf, Paolo Penna
2017	J	`jnl`	Truthful Mechanisms for Delivery with Mobile Agents. CoRR Andreas Bärtschi, Daniel Graf, Paolo Penna
2016	B	`conf`	Bribeproof Mechanisms for Two-Values Domains. SAGT Matús Mihalák, Paolo Penna, Peter Widmayer
2016	J	`jnl`	Convergence to Equilibrium of Logit Dynamics for Strategic Games. Algorithmica Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano
2016	B	`conf`	Core-periphery clustering and collaboration networks. ASONAM Pierluigi Crescenzi, Pierre Fraigniaud, Zvi Lotker, Paolo Penna
2016	J	`jnl`	Energy-efficient Delivery by Heterogeneous Mobile Agents. CoRR Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, Paolo Penna
2016	J	`jnl`	Independent lazy better-response dynamics on network games. CoRR Paolo Penna, Laurent Viennot
2016	J	`jnl`	Local Distributed Algorithms for Selfish Agents. CoRR Simon Collet, Pierre Fraigniaud, Paolo Penna
2016	C	`conf`	On Computing the Total Displacement Number via Weighted Motzkin Paths. IWOCA Andreas Bärtschi, Barbara Geissmann, Daniel Graf, Tomas Hruz, Paolo Penna, Thomas Tschager
2016	J	`jnl`	On computing the total displacement number via weighted Motzkin paths. CoRR Andreas Bärtschi, Barbara Geissmann, Daniel Graf, Tomas Hruz, Paolo Penna, Thomas Tschager
2016	J	`jnl`	Sequential Solutions in Machine Scheduling Games. CoRR Paul Giessler, Akaki Mamageishvili, Matús Mihalák, Paolo Penna
2016	J	`jnl`	Sort well with energy-constrained comparisons. CoRR Barbara Geissmann, Paolo Penna
2016	J	`jnl`	Tighter bounds on the inefficiency ratio of stable equilibria in load balancing games. Oper. Res. Lett. Akaki Mamageishvili, Paolo Penna
2015	J	`jnl`	Bribeproof mechanisms for two-values domains. CoRR Matús Mihalák, Paolo Penna, Peter Widmayer
2015	J	`jnl`	Imperfect Best-Response Mechanisms. Theory Comput. Syst. Diodato Ferraioli, Paolo Penna
2015	J	`jnl`	Logit Dynamics with Concurrent Updates for Local Interaction Potential Games. Algorithmica Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano
2015	J	`jnl`	Mechanisms for Scheduling with Single-Bit Private Values. Theory Comput. Syst. Vincenzo Auletta, George Christodoulou, Paolo Penna
2015	—	`conf`	On Sampling Simple Paths in Planar Graphs According to Their Lengths. MFCS (2) Sandro Montanari, Paolo Penna
2015	J	`jnl`	The price of anarchy and stability in general noisy best-response dynamics. CoRR Paolo Penna
2015	J	`jnl`	Tighter Bounds on the Inefficiency Ratio of Stable Equilibria in Load Balancing Games. CoRR Akaki Mamageishvili, Paolo Penna
2014	J	`jnl`	Optimal collusion-resistant mechanisms with verification. Games Econ. Behav. Paolo Penna, Carmine Ventre
2013	C	`conf`	Data Delivery by Energy-Constrained Mobile Agents. ALGOSENSORS Jérémie Chalopin, Shantanu Das, Matús Mihalák, Paolo Penna, Peter Widmayer
2013	B	`conf`	Imperfect Best-Response Mechanisms. SAGT Diodato Ferraioli, Paolo Penna
2013	A	`conf`	Logit Dynamics with Concurrent Updates for Local Interaction Games. ESA Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano
2012	J	`jnl`	Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions. ACM Trans. Comput. Theory Paolo Penna, Carmine Ventre
2012	J	`jnl`	Convergence to Equilibrium of Logit Dynamics for Strategic Games CoRR Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano
2012	J	`jnl`	Imperfect best-response mechanisms CoRR Diodato Ferraioli, Paolo Penna
2012	B	`conf`	Mechanisms for Scheduling with Single-Bit Private Values. SAGT Vincenzo Auletta, George Christodoulou, Paolo Penna
2012	J	`jnl`	Reversibility and Mixing Time for Logit Dynamics with Concurrent Updates CoRR Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano
2011	J	`jnl`	A response to "Mechanism Design with Partial Verification and Revelation Principle". Auton. Agents Multi Agent Syst. Vincenzo Auletta, Paolo Penna, Giuseppe Persiano, Carmine Ventre
2011	J	`jnl`	Alternatives to truthfulness are hard to recognize. Auton. Agents Multi Agent Syst. Vincenzo Auletta, Paolo Penna, Giuseppe Persiano, Carmine Ventre
2011	B	`conf`	Convergence to equilibrium of logit dynamics for strategic games. SPAA Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano
2009	J	`jnl`	On designing truthful mechanisms for online scheduling. Theor. Comput. Sci. Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano
2009	—	`ch.`	Online Train Disposition: To Wait or Not to Wait? Robust and Online Large-Scale Optimization Luzi Anderegg, Paolo Penna, Peter Widmayer
2009	A*	`conf`	Optimal collusion-resistant mechanisms with verification. EC Paolo Penna, Carmine Ventre
2009	B	`conf`	Private Capacities in Mechanism Design. MFCS Vincenzo Auletta, Paolo Penna, Giuseppe Persiano
2009	—	`conf`	Pseudonyms in Cost-Sharing Games. WINE Paolo Penna, Florian Schoppmann, Riccardo Silvestri, Peter Widmayer
2009	J	`jnl`	Strongly polynomial-time truthful mechanisms in one shot. Theor. Comput. Sci. Paolo Penna, Guido Proietti, Peter Widmayer
2009	J	`jnl`	The power of verification for one-parameter agents. J. Comput. Syst. Sci. Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano
2008	B	`conf`	Alternatives to Truthfulness Are Hard to Recognize. SAGT Vincenzo Auletta, Paolo Penna, Giuseppe Persiano, Carmine Ventre
2008	A	`conf`	Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions. ESA Paolo Penna, Carmine Ventre
2008	J	`jnl`	Guest editors' introduction. ACM SIGMOBILE Mob. Comput. Commun. Rev. Paolo Penna, S. S. Ravi
2008	—	`conf`	Interference Games in Wireless Networks. WINE Vincenzo Auletta, Luca Moscardelli, Paolo Penna, Giuseppe Persiano
2007	B	`conf`	An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem. WG Angelo Monti, Paolo Penna, Riccardo Silvestri
2007	J	`jnl`	On-line load balancing made simple: Greedy strikes back. J. Discrete Algorithms Pilu Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, Walter Unger
2007	J	`jnl`	Routing selfish unsplittable traffic. ACM Trans. Algorithms Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano
2006	—	`conf`	New Constructions of Mechanisms with Verification. ICALP (1) Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano, Carmine Ventre
2006	—	`conf`	Strongly Polynomial-Time Truthful Mechanisms in One Shot. WINE Paolo Penna, Guido Proietti, Peter Widmayer
2006	A	`conf`	The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing Mechanisms. STACS Paolo Penna, Carmine Ventre
2005	—	`conf`	Equilibria for Broadcast Range Assignment Games in Ad-Hoc Networks. ADHOC-NOW Pilu Crescenzi, Miriam Di Ianni, Alessandro Lazzoni, Paolo Penna, Gianluca Rossi, Paola Vocca
2005	B	`conf`	Free-Riders in Steiner Tree Cost-Sharing Games. SIROCCO Paolo Penna, Carmine Ventre
2005	B	`conf`	On Designing Truthful Mechanisms for Online Scheduling. SIROCCO Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano
2005	J	`jnl`	On the approximability of the range assignment problem on radio networks in presence of selfish agents. Theor. Comput. Sci. Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri
2005	J	`jnl`	Partial Digest is hard to solve for erroneous input data. Theor. Comput. Sci. Mark Cieliebak, Stephan J. Eidenbenz, Paolo Penna
2005	J	`jnl`	XOR-Based Schemes for Fast Parallel IP Lookups. Theory Comput. Syst. Gian Carlo Bongiovanni, Paolo Penna
2004	A	`conf`	Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines. STACS Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano
2004	—	`conf`	Energy-efficient broadcasting in ad-hoc networks: combining MSTs with shortest-path trees. PE-WASUN Paolo Penna, Carmine Ventre
2004	B	`conf`	How to route and tax selfish unsplittable traffic. SPAA Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Pino Persiano
2004	B	`conf`	More Powerful and Simpler Cost-Sharing Methods. WAOA Paolo Penna, Carmine Ventre
2004	J	`jnl`	On the Power Assignment Problem in Radio Networks. Mob. Networks Appl. Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri
2004	J	`jnl`	On-line algorithms for the channel assignment problem in cellular networks. Discret. Appl. Math. Pilu Crescenzi, Giorgio Gambosi, Paolo Penna
2004	J	`jnl`	Proximity drawings in polynomial area and volume. Comput. Geom. Paolo Penna, Paola Vocca
2004	B	`conf`	Sharing the Cost of Multicast Transmissions in Wireless Networks. SIROCCO Paolo Penna, Carmine Ventre
2004	A*	`conf`	The Power of Verification for One-Parameter Agents. ICALP Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano
2004	—	`conf`	Truthful Mechanisms for Generalized Utilitarian Problems. IFIP TCS Giovanna Melideo, Paolo Penna, Guido Proietti, Roger Wattenhofer, Peter Widmayer
2003	B	`conf`	Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. SIROCCO Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri
2003	B	`conf`	Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. WAOA Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri
2003	C	`conf`	Improving Customer Proximity to Railway Stations. CIAC Evangelos Kranakis, Paolo Penna, Konrad Schlude, David Scot Taylor, Peter Widmayer
2003	C	`conf`	Noisy Data Make the Partial Digest Problem NP-hard. WABI Mark Cieliebak, Stephan J. Eidenbenz, Paolo Penna
2003	A	`conf`	On the Approximation Ratio of the MST-Based Heuristic for the Energy-Efficient Broadcast Problem in Static Ad-Hoc Radio Networks. IPDPS Andrea E. F. Clementi, Gurvan Huiban, Gianluca Rossi, Yann C. Verhoeven, Paolo Penna
2003	A*	`conf`	Online Load Balancing Made Simple: Greedy Strikes Back. ICALP Pierluigi Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, Walter Unger
2003	J	`jnl`	The Minimum Range Assignment Problem on Linear Radio Networks. Algorithmica Andrea E. F. Clementi, Paolo Penna, Afonso Ferreira, Stephane Perennes, Riccardo Silvestri
2003	C	`conf`	XOR-Based Schemes for Fast Parallel IP Lookups. CIAC Gian Carlo Bongiovanni, Paolo Penna
2002	J	`jnl`	On the approximability of two tree drawing conventions. Inf. Process. Lett. Paolo Penna
2002	C	`conf`	Online train disposition: to wait or not to wait? ATMOS Luzi Anderegg, Paolo Penna, Peter Widmayer
2002	—	`conf`	Server Placements, Roman Domination and other Dominating Set Variants. IFIP TCS Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer
2001	—	`conf`	On Computing Ad-hoc Selective Families. RANDOM-APPROX Andrea E. F. Clementi, Pierluigi Crescenzi, Angelo Monti, Paolo Penna, Riccardo Silvestri
2001	A	`conf`	On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. STACS Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo Penna, Gianluca Rossi, Paola Vocca
2001	B	`conf`	On the Complexity of Train Assignment Problems. ISAAC Thomas Erlebach, Martin Gantenbein, Daniel Hürlimann, Gabriele Neyer, Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer
2000	—	`conf`	A Note on Parallel Read Operations on Large Public Databases. ICALP Satellite Workshops Gian Carlo Bongiovanni, Andrea E. F. Clementi, Paolo Penna
2000	J	`jnl`	On the power assignment problem in radio networks Electron. Colloquium Comput. Complex. Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri
2000	—	`conf`	On-line algorithms for the channel assignment problem in cellular networks. DIAL-M Pierluigi Crescenzi, Giorgio Gambosi, Paolo Penna
2000	J	`jnl`	Parallel Read Operations Without Memory Contention Electron. Colloquium Comput. Complex. Alexander E. Andreev, Andrea E. F. Clementi, Paolo Penna, José D. P. Rolim
2000	A	`conf`	Succinct Representations of Model Based Belief Revision. STACS Paolo Penna
2000	A	`conf`	The Minimum Range Assignment Problem on Linear Radio Networks. ESA Andrea E. F. Clementi, Afonso Ferreira, Paolo Penna, Stephane Perennes, Riccardo Silvestri
2000	A	`conf`	The Power Range Assignment Problem in Radio Networks on the Plane. STACS Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri
1999	—	`conf`	Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks. RANDOM-APPROX Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri
1999	A	`conf`	Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines. STACS Alexander E. Andreev, Andrea E. F. Clementi, Paolo Penna, José D. P. Rolim
1998	J	`jnl`	Linear area upward drawings of AVL trees. Comput. Geom. Pierluigi Crescenzi, Paolo Penna, Adolfo Piperno
1998	A	`conf`	Proximity Drawings: Three Dimensions Are Better than Two. GD Paolo Penna, Paola Vocca
1998	—	`conf`	Proximity drawings of binary trees in polynomial area. CCCG Paolo Penna, Paola Vocca
1998	J	`jnl`	Strictly-upward Drawings of Ordered Search Trees. Theor. Comput. Sci. Pierluigi Crescenzi, Paolo Penna
1997	A	`conf`	Minimum-Area h-v Drawings of Complete Binary Trees. GD Pierluigi Crescenzi, Paolo Penna
1996	B	`conf`	Upward Drawings of Search Trees (Extended Abstract). WG Pierluigi Crescenzi, Paolo Penna