- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j20 |      | Paolo Penna, Carmine Ventre: Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions. TOCT 4(2): 6 (2012) |
| c44 | | Vincenzo Auletta, George Christodoulou, Paolo Penna: Mechanisms for Scheduling with Single-Bit Private Values. SAGT 2012: 25-36 |
| i5 | | Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano: Reversibility and Mixing Time for Logit Dynamics with Concurrent Updates. CoRR abs/1207.2908 (2012) |
| i4 | | |
| i3 | | Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano: Convergence to Equilibrium of Logit Dynamics for Strategic Games. CoRR abs/1212.1884 (2012) |
| 2011 | ||
| j19 | | Vincenzo Auletta, Paolo Penna, Giuseppe Persiano, Carmine Ventre: Alternatives to truthfulness are hard to recognize. Autonomous Agents and Multi-Agent Systems 22(1): 200-216 (2011) |
| j18 | | Vincenzo Auletta, Paolo Penna, Giuseppe Persiano, Carmine Ventre: A response to "Mechanism Design with Partial Verification and Revelation Principle". Autonomous Agents and Multi-Agent Systems 22(1): 224 (2011) |
| c43 | | Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Paolo Penna, Giuseppe Persiano: Convergence to equilibrium of logit dynamics for strategic games. SPAA 2011: 197-206 |
| 2009 | ||
| j17 | | Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano: The power of verification for one-parameter agents. J. Comput. Syst. Sci. 75(3): 190-211 (2009) |
| j16 | | Paolo Penna, Guido Proietti, Peter Widmayer: Strongly polynomial-time truthful mechanisms in one shot. Theor. Comput. Sci. 410(17): 1607-1615 (2009) |
| j15 | | Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano: On designing truthful mechanisms for online scheduling. Theor. Comput. Sci. 410(36): 3348-3356 (2009) |
| c42 | | Vincenzo Auletta, Paolo Penna, Giuseppe Persiano: Private Capacities in Mechanism Design. MFCS 2009: 112-123 |
| c41 | | Paolo Penna, Carmine Ventre: Optimal collusion-resistant mechanisms with verification. ACM Conference on Electronic Commerce 2009: 147-156 |
| c40 | | Paolo Penna, Florian Schoppmann, Riccardo Silvestri, Peter Widmayer: Pseudonyms in Cost-Sharing Games. WINE 2009: 256-267 |
| p1 | | Luzi Anderegg, Paolo Penna, Peter Widmayer: Online Train Disposition: To Wait or Not to Wait? Robust and Online Large-Scale Optimization 2009: 387-398 |
| 2008 | ||
| j14 | | Paolo Penna, S. S. Ravi: Guest editors' introduction. Mobile Computing and Communications Review 12(1): 15-16 (2008) |
| c39 | | Paolo Penna, Carmine Ventre: Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions. ESA 2008: 708-719 |
| c38 | | Vincenzo Auletta, Paolo Penna, Giuseppe Persiano, Carmine Ventre: Alternatives to Truthfulness Are Hard to Recognize. SAGT 2008: 194-205 |
| c37 | | Vincenzo Auletta, Luca Moscardelli, Paolo Penna, Giuseppe Persiano: Interference Games in Wireless Networks. WINE 2008: 278-285 |
| 2007 | ||
| j13 | | Pilu Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, Walter Unger: On-line load balancing made simple: Greedy strikes back. J. Discrete Algorithms 5(1): 162-175 (2007) |
| j12 | | Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano: Routing selfish unsplittable traffic. ACM Transactions on Algorithms 3(4) (2007) |
| c36 | | Angelo Monti, Paolo Penna, Riccardo Silvestri: An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem. WG 2007: 154-165 |
| 2006 | ||
| c35 | | Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano, Carmine Ventre: New Constructions of Mechanisms with Verification. ICALP (1) 2006: 596-607 |
| c34 | | Paolo Penna, Carmine Ventre: The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing Mechanisms. STACS 2006: 337-348 |
| c33 | | Paolo Penna, Guido Proietti, Peter Widmayer: Strongly Polynomial-Time Truthful Mechanisms in One Shot. WINE 2006: 377-388 |
| 2005 | ||
| j11 | | Gian Carlo Bongiovanni, Paolo Penna: XOR-Based Schemes for Fast Parallel IP Lookups. Theory Comput. Syst. 38(4): 481-501 (2005) |
| j10 | | Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri: On the approximability of the range assignment problem on radio networks in presence of selfish agents. Theor. Comput. Sci. 343(1-2): 27-41 (2005) |
| j9 | | Mark Cieliebak, Stephan Eidenbenz, Paolo Penna: Partial Digest is hard to solve for erroneous input data. Theor. Comput. Sci. 349(3): 361-381 (2005) |
| c32 | | Pilu Crescenzi, Miriam Di Ianni, Alessandro Lazzoni, Paolo Penna, Gianluca Rossi, Paola Vocca: Equilibria for Broadcast Range Assignment Games in Ad-Hoc Networks. ADHOC-NOW 2005: 4-17 |
| c31 | | Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano: On Designing Truthful Mechanisms for Online Scheduling. SIROCCO 2005: 3-17 |
| c30 | | |
| 2004 | ||
| j8 | | Paolo Penna, Paola Vocca: Proximity drawings in polynomial area and volume. Comput. Geom. 29(2): 91-116 (2004) |
| j7 | | Pilu Crescenzi, Giorgio Gambosi, Paolo Penna: On-line algorithms for the channel assignment problem in cellular networks. Discrete Applied Mathematics 137(3): 237-266 (2004) |
| j6 | | Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri: On the Power Assignment Problem in Radio Networks. MONET 9(2): 125-140 (2004) |
| c29 | | Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano: The Power of Verification for One-Parameter Agents. ICALP 2004: 171-182 |
| c28 |  | Giovanna Melideo, Paolo Penna, Guido Proietti, Roger Wattenhofer, Peter Widmayer: Truthful Mechanisms for Generalized Utilitarian Problems. IFIP TCS 2004: 167-180 |
| c27 | | Paolo Penna, Carmine Ventre: Energy-efficient broadcasting in ad-hoc networks: combining MSTs with shortest-path trees. PE-WASUN 2004: 61-68 |
| c26 | | Paolo Penna, Carmine Ventre: Sharing the Cost of Multicast Transmissions in Wireless Networks. SIROCCO 2004: 255-266 |
| c25 | | Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Pino Persiano: How to route and tax selfish unsplittable traffic. SPAA 2004: 196-205 |
| c24 | | Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Giuseppe Persiano: Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines. STACS 2004: 608-619 |
| c23 | | |
| 2003 | ||
| j5 | | Andrea E. F. Clementi, Paolo Penna, Afonso Ferreira, Stephane Perennes, Riccardo Silvestri: The Minimum Range Assignment Problem on Linear Radio Networks. Algorithmica 35(2): 95-110 (2003) |
| c22 | | Gian Carlo Bongiovanni, Paolo Penna: XOR-Based Schemes for Fast Parallel IP Lookups. CIAC 2003: 238-250 |
| c21 | | Evangelos Kranakis, Paolo Penna, Konrad Schlude, David Scot Taylor, Peter Widmayer: Improving Customer Proximity to Railway Stations. CIAC 2003: 264-276 |
| c20 | | Pierluigi Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, Walter Unger: Online Load Balancing Made Simple: Greedy Strikes Back. ICALP 2003: 1108-1122 |
| c19 | | Andrea E. F. Clementi, Gurvan Huiban, Gianluca Rossi, Yann C. Verhoeven, Paolo Penna: On the Approximation Ratio of the MST-Based Heuristic for the Energy-Efficient Broadcast Problem in Static Ad-Hoc Radio Networks. IPDPS 2003: 222 |
| c18 | | Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri: Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. SIROCCO 2003: 1-16 |
| c17 | | Mark Cieliebak, Stephan Eidenbenz, Paolo Penna: Noisy Data Make the Partial Digest Problem NP-hard. WABI 2003: 111-123 |
| c16 | | Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri: Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. WAOA 2003: 248-251 |
| 2002 | ||
| j4 | | Luzi Anderegg, Paolo Penna, Peter Widmayer: Online train disposition: to wait or not to wait? Electr. Notes Theor. Comput. Sci. 66(6): 32-41 (2002) |
| j3 | | Paolo Penna: On the approximability of two tree drawing conventions. Inf. Process. Lett. 82(5): 237-242 (2002) |
| c15 | | Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer: Server Placements, Roman Domination and other Dominating Set Variants. IFIP TCS 2002: 280-291 |
| 2001 | ||
| c14 | | Thomas Erlebach, Martin Gantenbein, Daniel Hürlimann, Gabriele Neyer, Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer: On the Complexity of Train Assignment Problems. ISAAC 2001: 390-402 |
| c13 | | Andrea E. F. Clementi, Pierluigi Crescenzi, Angelo Monti, Paolo Penna, Riccardo Silvestri: On Computing Ad-hoc Selective Families. RANDOM-APPROX 2001: 211-222 |
| c12 | | Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo Penna, Gianluca Rossi, Paola Vocca: On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. STACS 2001: 121-131 |
| 2000 | ||
| c11 | | Pierluigi Crescenzi, Giorgio Gambosi, Paolo Penna: On-line algorithms for the channel assignment problem in cellular networks. DIAL-M 2000: 1-7 |
| c10 | | Andrea E. F. Clementi, Afonso Ferreira, Paolo Penna, Stephane Perennes, Riccardo Silvestri: The Minimum Range Assignment Problem on Linear Radio Networks. ESA 2000: 143-154 |
| c9 | | Gian Carlo Bongiovanni, Andrea E. F. Clementi, Paolo Penna: A Note on Parallel Read Operations on Large Public Databases. ICALP Satellite Workshops 2000: 123-134 |
| c8 | | |
| c7 | | Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri: The Power Range Assignment Problem in Radio Networks on the Plane. STACS 2000: 651-660 |
| i2 | | Alexander E. Andreev, Andrea E. F. Clementi, Paolo Penna, José D. P. Rolim: Parallel Read Operations Without Memory Contention. Electronic Colloquium on Computational Complexity (ECCC) 7(53) (2000) |
| i1 | | Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri: On the power assignment problem in radio networks. Electronic Colloquium on Computational Complexity (ECCC) 7(54) (2000) |
| 1999 | ||
| c6 | | Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri: Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks. RANDOM-APPROX 1999: 197-208 |
| c5 | | Alexander E. Andreev, Andrea E. F. Clementi, Paolo Penna, José D. P. Rolim: Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines. STACS 1999: 68-77 |
| 1998 | ||
| j2 | | Pierluigi Crescenzi, Paolo Penna, Adolfo Piperno: Linear area upward drawings of AVL trees. Comput. Geom. 9(1-2): 25-42 (1998) |
| j1 | | Pierluigi Crescenzi, Paolo Penna: Strictly-upward Drawings of Ordered Search Trees. Theor. Comput. Sci. 203(1): 51-67 (1998) |
| c4 | | |
| c3 | | Paolo Penna, Paola Vocca: Proximity Drawings: Three Dimensions Are Better than Two. Graph Drawing 1998: 275-287 |
| 1997 | ||
| c2 | | Pierluigi Crescenzi, Paolo Penna: Minimum-Area h-v Drawings of Complete Binary Trees. Graph Drawing 1997: 371-382 |
| 1996 | ||
| c1 | | Pierluigi Crescenzi, Paolo Penna: Upward Drawings of Search Trees (Extended Abstract). WG 1996: 114-125 |
Data released under the ODC-BY 1.0 license — See also our legal information page