- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j30 |      | Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci: On the Expansion and Diameter of Bluetooth-Like Topologies. Theory Comput. Syst. 52(2): 319-339 (2013) |
| 2012 | ||
| j29 | | Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin: An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets. J. ACM 59(3): 12 (2012) |
| c40 | | Geppino Pucci, Christos D. Zaroliagis, Kieran T. Herley, Henning Meyerhenke: Topic 12: Theory and Algorithms for Parallel Computation. Euro-Par 2012: 674-675 |
| c39 | | Andrea Pietracaprina, Geppino Pucci, Matteo Riondato, Francesco Silvestri, Eli Upfal: Space-round tradeoffs for MapReduce computations. ICS 2012: 235-244 |
| 2011 | ||
| j28 | | Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin: MADMX: A Strategy for Maximal Dense Motif Extraction. Journal of Computational Biology 18(4): 535-545 (2011) |
| c38 | | Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci, Eli Upfal: Tight bounds on information dissemination in sparse mobile networks. PODC 2011: 355-362 |
| r1 | | Gianfranco Bilardi, Geppino Pucci: Universality in VLSI Computation. Encyclopedia of Parallel Computing 2011: 2112-2118 |
| i5 | | Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci, Eli Upfal: Tight Bounds on Information Dissemination in Sparse Mobile Networks. CoRR abs/1101.4609 (2011) |
| i4 | | Andrea Pietracaprina, Geppino Pucci, Matteo Riondato, Francesco Silvestri, Eli Upfal: Space-Round Tradeoffs for MapReduce Computations. CoRR abs/1111.2228 (2011) |
| 2010 | ||
| i3 | | Roberto Grossi, Andrea Pietracaprina, Nadia Pisanti, Geppino Pucci, Eli Upfal, Fabio Vandin: MADMX: A Novel Strategy for Maximal Dense Motif Extraction. CoRR abs/1002.0874 (2010) |
| i2 | | Adam Kirsch, Michael Mitzenmacher, Andrea Pietracaprina, Geppino Pucci, Eli Upfal, Fabio Vandin: An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets. CoRR abs/1002.1104 (2010) |
| i1 | | Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci, Eli Upfal: Infectious Random Walks. CoRR abs/1007.1604 (2010) |
| 2009 | ||
| j27 | | 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) |
| j26 | | Pierluigi Crescenzi, Fabrizio Luccio, Geppino Pucci: Foreword. Theory Comput. Syst. 44(2): 141-142 (2009) |
| c37 | | Alberto Pettarin, Andrea Pietracaprina, Geppino Pucci: On the Expansion and Diameter of Bluetooth-Like Topologies. ESA 2009: 528-539 |
| c36 | | 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 |
| c35 | | 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 |
| 2008 | ||
| j25 | | Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci: Store-and-Forward Multicast Routing on the Mesh. Theory Comput. Syst. 42(4): 519-535 (2008) |
| j24 | | Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci: Area-time tradeoffs for universal VLSI circuits. Theor. Comput. Sci. 408(2-3): 143-150 (2008) |
| c34 | | Geppino Pucci, Coromoto León, Ioannis Caragiannis, Kieran T. Herley: Topic 12: Theory and Algorithms for Parallel Computation. Euro-Par 2008: 876 |
| 2007 | ||
| c33 | | Paolo Bertasi, Mauro Bianco, Andrea Pietracaprina, Geppino Pucci: Obtaining Performance Measures through Microbenchmarking in a Peer-to-Peer Overlay Computer. CISIS 2007: 285-290 |
| c32 | | Pilu Crescenzi, Carlo Nocentini, Andrea Pietracaprina, Geppino Pucci, Carlo Sandri: On the Connectivity of Bluetooth-Based Ad Hoc Networks. Euro-Par 2007: 960-969 |
| c31 | | Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri: Network-Oblivious Algorithms. IPDPS 2007: 1-10 |
| e2 |  | Pierluigi Crescenzi, Giuseppe Prencipe, Geppino Pucci (Eds.): Fun with Algorithms, 4th International Conference, FUN 2007, Castiglioncello, Italy, June 3-5, 2007, Proceedings. Lecture Notes in Computer Science 4475, Springer 2007, isbn 978-3-540-72913-6 |
| 2006 | ||
| j23 | | Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci: Translating submachine locality into locality of reference. J. Parallel Distrib. Comput. 66(5): 633-646 (2006) |
| c30 | | Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri: Cache-oblivious simulation of parallel programs. IPDPS 2006 |
| c29 | | Alberto Bertoldo, Mauro Bianco, Geppino Pucci: A Static Parallel Multifrontal Solver for Finite Element Meshes. ISPA 2006: 734-746 |
| 2005 | ||
| j22 | | Andrea Pietracaprina, Geppino Pucci: Optimal many-to-one routing on the mesh with constant queues. Inf. Process. Lett. 96(1): 24-29 (2005) |
| j21 | | Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci: On stalling in LogP. J. Parallel Distrib. Comput. 65(3): 307-312 (2005) |
| c28 | | Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Sebastiano Fabio Schifano, Raffaele Tripiccione: The Potential of On-Chip Multiprocessing for QCD Machines. HiPC 2005: 386-397 |
| 2004 | ||
| c27 | | Alberto Bertoldo, Mauro Bianco, Geppino Pucci: A Fast Multifrontal Solver for Non-linear Multi-physics Problems. International Conference on Computational Science 2004: 614-617 |
| c26 | | Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci: Translating Submachine Locality into Locality of Reference. IPDPS 2004 |
| 2003 | ||
| j20 | | 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 | ||
| j19 | | Roberto Grossi, Andrea Pietracaprina, Geppino Pucci: Optimal Deterministic Protocols for Mobile Robots on a Grid. Inf. Comput. 173(2): 132-142 (2002) |
| j18 | | Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci: Deterministic parallel backtrack search. Theor. Comput. Sci. 270(1-2): 309-324 (2002) |
| c25 | | Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci: Seamless Integration of Parallelism and Memory Hierarchy. ICALP 2002: 856-867 |
| c24 | | Mauro Bianco, Gianfranco Bilardi, Francesco Pesavento, Geppino Pucci, Bernhard A. Schrefler: An Accurate and Efficient Frontal Solver for Fully-Coupled Hygro-Thermo-Mechanical Problems. International Conference on Computational Science (1) 2002: 733-742 |
| 2001 | ||
| j17 | | 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) |
| c23 | | Andrea Pietracaprina, Geppino Pucci: Optimal Many-to-One Routing on the Mesh with Constant Queues. Euro-Par 2001: 645-650 |
| c22 | | 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 |
| c21 | | Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci: Implementing Shared Memory on Clustered Machines. IPDPS 2001: 62 |
| c20 | | Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci: One-to-Many routing on the mesh. SPAA 2001: 31-37 |
| 2000 | ||
| j16 | | Andrea Pietracaprina, Geppino Pucci, Jop F. Sibeyn: Constructive, Deterministic Implementation of Shared Memory on Meshes. SIAM J. Comput. 30(2): 625-648 (2000) |
| c19 | | Mauro Bianco, Geppino Pucci: On the Predictive Quality of BSP-like Cost Functions for NOWs. Euro-Par 2000: 638-646 |
| c18 | | Marco Danelutto, Geppino Pucci: A Compact, Thread-Safe Communication Library for Efficient Cluster Computing. HPCN Europe 2000: 407-416 |
| c17 | | Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci: On Stalling in LogP. IPDPS Workshops 2000: 109-115 |
| c16 | | 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- |
| 1999 | ||
| j15 | | Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Kieran T. Herley, Paul G. Spirakis: BSP versus LogP. Algorithmica 24(3-4): 405-422 (1999) |
| j14 | | 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) |
| j13 | | Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci: Fast Deterministic Parallel Branch-and-Bound. Parallel Processing Letters 9(3): 325-333 (1999) |
| c15 | | Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci: Area-Universal Circuits with Constant Slowdown. ARVLSI 1999: 89-98 |
| c14 | | 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 |
| c13 | | Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci: Deterministic Branch-and-Bound on Distributed Memory Machines (Extended Abstract). IPPS/SPDP Workshops 1999: 1085-1094 |
| 1998 | ||
| j12 | | Sandeep N. Bhatt, Gianfranco Bilardi, Kieran T. Herley, Geppino Pucci, Abhiram G. Ranade: Tight Bounds on Parallel List Marking. J. Parallel Distrib. Comput. 51(2): 75-88 (1998) |
| c12 | | Roberto Grossi, Andrea Pietracaprina, Geppino Pucci: Optimal Deterministic Protocols for Mobile Robots on a Grid. SWAT 1998: 181-192 |
| e1 | | Gianfranco Bilardi, Giuseppe F. Italiano, Andrea Pietracaprina, Geppino Pucci (Eds.): Algorithms - ESA '98, 6th Annual European Symposium, Venice, Italy, August 24-26, 1998, Proceedings. Lecture Notes in Computer Science 1461, Springer 1998, isbn 3-540-64848-8 |
| 1997 | ||
| j11 | | Andrea Pietracaprina, Geppino Pucci: The Complexity of Deterministic PRAM Simulation on Distributed Memory Machines. Theory Comput. Syst. 30(3): 231-247 (1997) |
| 1996 | ||
| j10 | | Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg, Eric J. Schwabe: On Bufferless Routing of Variable Length Messages in Leveled Networks. IEEE Trans. Computers 45(6): 714-729 (1996) |
| c11 | | Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci: Fast Deterministic Backtrack Search. ICALP 1996: 598-609 |
| c10 | | Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci, Paul G. Spirakis: BSP vs LogP. SPAA 1996: 25-32 |
| 1995 | ||
| j9 | | Maria Cristina Pinotti, Geppino Pucci: Parallel Algorithms for Priority Queue Operations. Theor. Comput. Sci. 148(1): 171-180 (1995) |
| c9 | | 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 |
| c8 | | Sandeep N. Bhatt, Gianfranco Bilardi, Kieran T. Herley, Geppino Pucci, Abhiram G. Ranade: Tight Bounds on Parallel List Marking. Euro-Par 1995: 231-242 |
| c7 | | Andrea Pietracaprina, Geppino Pucci: Improved Deterministic PRAM Simulation on the Mesh. ICALP 1995: 372-383 |
| 1994 | ||
| j8 | | Linda Pagli, Geppino Pucci: Counting the Number of Fault Patterns in Redundant VLSI Arrays. Inf. Process. Lett. 50(6): 337-342 (1994) |
| c6 | | Andrea Pietracaprina, Geppino Pucci: Tight Bounds on Deterministic PRAM Emulations with Constant Redundancy. ESA 1994: 391-400 |
| c5 | | Andrea Pietracaprina, Geppino Pucci, Jop F. Sibeyn: Constructive Deterministic PRAM Simulation on a Mesh-Connected Computer. SPAA 1994: 248-256 |
| 1993 | ||
| j7 | | Sandeep N. Bhatt, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg: Scattering and Gathering Messages in Networks of Processors. IEEE Trans. Computers 42(8): 938-949 (1993) |
| c4 | | Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci, Abhiram G. Ranade, Arnold L. Rosenberg, Eric J. Schwabe: On Bufferless Routing of Variable-length Message in Leveled Networks (Extended Abstract). ESA 1993: 49-60 |
| 1992 | ||
| j6 | | Fabrizio Luccio, Andrea Pietracaprina, Geppino Pucci: Analysis and Implementation of Parallel Uniform Hashing. Int. J. Found. Comput. Sci. 3(1): 55-63 (1992) |
| j5 | | Geppino Pucci: A New Approach to the Modeling of Recovery Block Structures. IEEE Trans. Software Eng. 18(2): 159-167 (1992) |
| c3 | | Fabrizio Luccio, Linda Pagli, Geppino Pucci: Three non Conventional Paradigms of Parallel Computation. Heinz Nixdorf Symposium 1992: 166-175 |
| c2 | | Maria Cristina Pinotti, Geppino Pucci: Parallel Algorithms for Priority Queue Operations. SWAT 1992: 130-139 |
| 1991 | ||
| j4 | | Fabrizio Luccio, Andrea Pietracaprina, Geppino Pucci: Analysis of Parallel Uniform Hashing. Inf. Process. Lett. 37(2): 67-69 (1991) |
| j3 | | Maria Cristina Pinotti, Geppino Pucci: Parallel Priority Queues. Inf. Process. Lett. 40(1): 33-40 (1991) |
| 1990 | ||
| j2 | | Fabrizio Luccio, Andrea Pietracaprina, Geppino Pucci: A New Scheme for the Deterministic Simulation of PRAMs in VLSI. Algorithmica 5(4): 529-544 (1990) |
| c1 | | |
| 1988 | ||
| j1 | | Fabrizio Luccio, Geppino Pucci, Andrea Pietracaprina: A Probabilistic Simulation of PRAMs on a Bounded Degree Network. Inf. Process. Lett. 28(3): 141-147 (1988) |
Data released under the ODC-BY 1.0 license — See also our legal information page