| 2009 | ||
|---|---|---|
| 59 | Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci: On the Expansion and Diameter of Bluetooth-Like Topologies. ESA 2009: 528-539 | |
| 58 | Andrea Pietracaprina, Rob H. Bisseling, Emmanuelle Lebhar, Alexander Tiskin: Introduction. Euro-Par 2009: 989 | |
| 57 | Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin: An efficient rigorous approach for identifying statistically significant frequent itemsets. PODS 2009: 117-126 | |
| 56 | Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin: MADMX: A Novel Strategy for Maximal Dense Motif Extraction. WABI 2009: 362-374 | |
| 55 | Pierluigi Crescenzi, Carlo Nocentini, Andrea Pietracaprina, Geppino Pucci: On the connectivity of Bluetooth-based ad hoc networks. Concurrency and Computation: Practice and Experience 21(7): 875-887 (2009) | |
| 2008 | ||
| 54 | Nancy M. Amato, Der-Tsai Lee, Andrea Pietracaprina, Roberto Tamassia: Preface. Theor. Comput. Sci. 408(2-3): 97-98 (2008) | |
| 53 | Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci: Store-and-Forward Multicast Routing on the Mesh. Theory Comput. Syst. 42(4): 519-535 (2008) | |
| 2007 | ||
| 52 | Paolo Bertasi, Mauro Bianco, Andrea Pietracaprina, Geppino Pucci: Obtaining Performance Measures through Microbenchmarking in a Peer-to-Peer Overlay Computer. CISIS 2007: 285-290 | |
| 51 | Andrea Pietracaprina, Fabio Vandin: Efficient Incremental Mining of Top-K Frequent Closed Itemsets. Discovery Science 2007: 275-280 | |
| 50 | Pilu Crescenzi, Carlo Nocentini, Andrea Pietracaprina, Geppino Pucci, Carlo Sandri: On the Connectivity of Bluetooth-Based Ad Hoc Networks. Euro-Par 2007: 960-969 | |
| 49 | Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri: Network-Oblivious Algorithms. IPDPS 2007: 1-10 | |
| 2006 | ||
| 48 | Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri: Cache-oblivious simulation of parallel programs. IPDPS 2006 | |
| 47 | Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci: Translating submachine locality into locality of reference. J. Parallel Distrib. Comput. 66(5): 633-646 (2006) | |
| 2005 | ||
| 46 | Andrea Pietracaprina, Kieran T. Herley, Christos D. Zaroliagis, Casiano Rodriguez-Leon: Topic 12 Theory and Algorithms for Parallel Computation. Euro-Par 2005: 929 | |
| 45 | Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Sebastiano Fabio Schifano, Raffaele Tripiccione: The Potential of On-Chip Multiprocessing for QCD Machines. HiPC 2005: 386-397 | |
| 44 | Andrea Pietracaprina, Geppino Pucci: Optimal many-to-one routing on the mesh with constant queues. Inf. Process. Lett. 96(1): 24-29 (2005) | |
| 43 | Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci: On stalling in LogP. J. Parallel Distrib. Comput. 65(3): 307-312 (2005) | |
| 2004 | ||
| 42 | Christos Kaklamanis, Nancy M. Amato, Danny Krizanc, Andrea Pietracaprina: Topic 13: Theory and Algorithms for Parallel Computation. Euro-Par 2004: 803 | |
| 41 | Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci: Translating Submachine Locality into Locality of Reference. IPDPS 2004 | |
| 2003 | ||
| 40 | Andrea Pietracaprina, Dario Zandolin: Mining Frequent Itemsets using Patricia Tries. FIMI 2003 | |
| 39 | Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci: A General Pram Simulation Scheme For Clustered Machines. Int. J. Found. Comput. Sci. 14(6): 1147-1164 (2003) | |
| 2002 | ||
| 38 | Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci: Seamless Integration of Parallelism and Memory Hierarchy. ICALP 2002: 856-867 | |
| 37 | Frank K. H. A. Dehne, Stefano Mardegan, Andrea Pietracaprina, Giuseppe Prencipe: Distribution Sweeping on Clustered Machines with Hierarchical Memories. IPDPS 2002 | |
| 36 | Roberto Grossi, Andrea Pietracaprina, Geppino Pucci: Optimal Deterministic Protocols for Mobile Robots on a Grid. Inf. Comput. 173(2): 132-142 (2002) | |
| 35 | Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci: Deterministic parallel backtrack search. Theor. Comput. Sci. 270(1-2): 309-324 (2002) | |
| 2001 | ||
| 34 | Andrea Pietracaprina, Geppino Pucci: Optimal Many-to-One Routing on the Mesh with Constant Queues. Euro-Par 2001: 645-650 | |
| 33 | Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci: Implementing Shared Memory on Clustered Machines. IPDPS 2001: 62 | |
| 32 | Gianfranco Bilardi, Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci: On the Effectiveness of D-BSP as a Bridging Model of Parallel Computation. International Conference on Computational Science (2) 2001: 579-588 | |
| 31 | Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci: One-to-Many routing on the mesh. SPAA 2001: 31-37 | |
| 30 | Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci: Implementing Shared Memory on Mesh-Connected Computers and on the Fat-Tree. Inf. Comput. 165(2): 123-143 (2001) | |
| 2000 | ||
| 29 | Nancy M. Amato, Jack Perdue, Mark M. Mathis, Andrea Pietracaprina, Geppino Pucci: Predicting Performance on SMPs. A Case Study: The SGI Power Challenge. IPDPS 2000: 729- | |
| 28 | Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci: On Stalling in LogP. IPDPS Workshops 2000: 109-115 | |
| 27 | Gianfranco Bilardi, Andrea Pietracaprina, Paolo D'Alberto: On the Space and Access Complexity of Computation DAGs. WG 2000: 47-58 | |
| 26 | Andrea Pietracaprina, Geppino Pucci, Jop F. Sibeyn: Constructive, Deterministic Implementation of Shared Memory on Meshes. SIAM J. Comput. 30(2): 625-648 (2000) | |
| 1999 | ||
| 25 | Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci: A Quantitative Measure of Portability with Application to Bandwidth-Latency Models for Parallel Computing. Euro-Par 1999: 543-551 | |
| 24 | Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci: Deterministic Branch-and-Bound on Distributed Memory Machines (Extended Abstract). IPPS/SPDP Workshops 1999: 1085-1094 | |
| 23 | Armin Bäumker, Wolfgang Dittrich, Andrea Pietracaprina: The Complexity of Parallel Multisearch on Coarse-Grained Machines. Algorithmica 24(3-4): 209-242 (1999) | |
| 22 | Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Kieran T. Herley, Paul G. Spirakis: BSP versus LogP. Algorithmica 24(3-4): 405-422 (1999) | |
| 21 | Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci: Deterministic Branch-and-Bound on Distributed Memory Machines. Int. J. Found. Comput. Sci. 10(4): 391-404 (1999) | |
| 20 | Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci: Fast Deterministic Parallel Branch-and-Bound. Parallel Processing Letters 9(3): 325-333 (1999) | |
| 1998 | ||
| 19 | Gianfranco Bilardi, Giuseppe F. Italiano, Andrea Pietracaprina, Geppino Pucci: Algorithms - ESA '98, 6th Annual European Symposium, Venice, Italy, August 24-26, 1998, Proceedings Springer 1998 | |
| 18 | Andrea Pietracaprina: Deterministic Routing of h-relations on the Multibutterfly. IPPS/SPDP 1998: 375-379 | |
| 17 | Roberto Grossi, Andrea Pietracaprina, Geppino Pucci: Optimal Deterministic Protocols for Mobile Robots on a Grid. SWAT 1998: 181-192 | |
| 1997 | ||
| 16 | Andrea Pietracaprina, Franco P. Preparata: Practical Constructive Schemes for Deterministic Shared-Memory Access. Theory Comput. Syst. 30(1): 3-37 (1997) | |
| 15 | Andrea Pietracaprina, Geppino Pucci: The Complexity of Deterministic PRAM Simulation on Distributed Memory Machines. Theory Comput. Syst. 30(3): 231-247 (1997) | |
| 1996 | ||
| 14 | Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci: Fast Deterministic Backtrack Search. ICALP 1996: 598-609 | |
| 13 | Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci, Paul G. Spirakis: BSP vs LogP. SPAA 1996: 25-32 | |
| 12 | Armin Bäumker, Wolfgang Dittrich, Andrea Pietracaprina: The Deterministic Complexity of Parallel Multisearch (Extended Abstract). SWAT 1996: 404-415 | |
| 1995 | ||
| 11 | Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci: Implementing Shared Memory on Mult-Dimensional Meshes and on the Fat-Tree (Extended Abstract). ESA 1995: 60-74 | |
| 10 | Andrea Pietracaprina, Geppino Pucci: Improved Deterministic PRAM Simulation on the Mesh. ICALP 1995: 372-383 | |
| 1994 | ||
| 9 | Andrea Pietracaprina, Geppino Pucci: Tight Bounds on Deterministic PRAM Emulations with Constant Redundancy. ESA 1994: 391-400 | |
| 8 | Andrea Pietracaprina, Geppino Pucci, Jop F. Sibeyn: Constructive Deterministic PRAM Simulation on a Mesh-Connected Computer. SPAA 1994: 248-256 | |
| 1993 | ||
| 7 | Andrea Pietracaprina, Franco P. Preparata: A Practical Constructive Scheme for Deterministic Shared-Memory Access. SPAA 1993: 100-109 | |
| 6 | Andrea Pietracaprina, Franco P. Preparata: On O(sqrt(n))-Worst-Case-Time Solution to the Granularity Problem. STACS 1993: 110-119 | |
| 1992 | ||
| 5 | Fabrizio Luccio, Andrea Pietracaprina, Geppino Pucci: Analysis and Implementation of Parallel Uniform Hashing. Int. J. Found. Comput. Sci. 3(1): 55-63 (1992) | |
| 1991 | ||
| 4 | Arvind Krishna, Andrea Pietracaprina, Bruce Hajek: Packet Routing in Optimal Time on a Butterfly. INFOCOM 1991: 840-849 | |
| 3 | Fabrizio Luccio, Andrea Pietracaprina, Geppino Pucci: Analysis of Parallel Uniform Hashing. Inf. Process. Lett. 37(2): 67-69 (1991) | |
| 1990 | ||
| 2 | Fabrizio Luccio, Andrea Pietracaprina, Geppino Pucci: A New Scheme for the Deterministic Simulation of PRAMs in VLSI. Algorithmica 5(4): 529-544 (1990) | |
| 1988 | ||
| 1 | Fabrizio Luccio, Geppino Pucci, Andrea Pietracaprina: A Probabilistic Simulation of PRAMs on a Bounded Degree Network. Inf. Process. Lett. 28(3): 141-147 (1988) | |