| 2009 |
|---|
| 61 | EE | 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 |
|---|
| 60 | EE | Geppino Pucci,
Coromoto León,
Ioannis Caragiannis,
Kieran T. Herley:
Topic 12: Theory and Algorithms for Parallel Computation.
Euro-Par 2008: 876 |
| 59 | EE | Sandeep N. Bhatt,
Gianfranco Bilardi,
Geppino Pucci:
Area-time tradeoffs for universal VLSI circuits.
Theor. Comput. Sci. 408(2-3): 143-150 (2008) |
| 58 | EE | Kieran T. Herley,
Andrea Pietracaprina,
Geppino Pucci:
Store-and-Forward Multicast Routing on the Mesh.
Theory Comput. Syst. 42(4): 519-535 (2008) |
| 2007 |
|---|
| 57 | | Pierluigi Crescenzi,
Giuseppe Prencipe,
Geppino Pucci:
Fun with Algorithms, 4th International Conference, FUN 2007, Castiglioncello, Italy, June 3-5, 2007, Proceedings
Springer 2007 |
| 56 | EE | Paolo Bertasi,
Mauro Bianco,
Andrea Pietracaprina,
Geppino Pucci:
Obtaining Performance Measures through Microbenchmarking in a Peer-to-Peer Overlay Computer.
CISIS 2007: 285-290 |
| 55 | EE | Pilu Crescenzi,
Carlo Nocentini,
Andrea Pietracaprina,
Geppino Pucci,
Carlo Sandri:
On the Connectivity of Bluetooth-Based Ad Hoc Networks.
Euro-Par 2007: 960-969 |
| 54 | EE | Gianfranco Bilardi,
Andrea Pietracaprina,
Geppino Pucci,
Francesco Silvestri:
Network-Oblivious Algorithms.
IPDPS 2007: 1-10 |
| 2006 |
|---|
| 53 | EE | Andrea Pietracaprina,
Geppino Pucci,
Francesco Silvestri:
Cache-oblivious simulation of parallel programs.
IPDPS 2006 |
| 52 | EE | Alberto Bertoldo,
Mauro Bianco,
Geppino Pucci:
A Static Parallel Multifrontal Solver for Finite Element Meshes.
ISPA 2006: 734-746 |
| 51 | EE | Carlo Fantozzi,
Andrea Pietracaprina,
Geppino Pucci:
Translating submachine locality into locality of reference.
J. Parallel Distrib. Comput. 66(5): 633-646 (2006) |
| 2005 |
|---|
| 50 | EE | Gianfranco Bilardi,
Andrea Pietracaprina,
Geppino Pucci,
Sebastiano Fabio Schifano,
Raffaele Tripiccione:
The Potential of On-Chip Multiprocessing for QCD Machines.
HiPC 2005: 386-397 |
| 49 | EE | Andrea Pietracaprina,
Geppino Pucci:
Optimal many-to-one routing on the mesh with constant queues.
Inf. Process. Lett. 96(1): 24-29 (2005) |
| 48 | EE | Gianfranco Bilardi,
Kieran T. Herley,
Andrea Pietracaprina,
Geppino Pucci:
On stalling in LogP.
J. Parallel Distrib. Comput. 65(3): 307-312 (2005) |
| 2004 |
|---|
| 47 | EE | Carlo Fantozzi,
Andrea Pietracaprina,
Geppino Pucci:
Translating Submachine Locality into Locality of Reference.
IPDPS 2004 |
| 46 | EE | Alberto Bertoldo,
Mauro Bianco,
Geppino Pucci:
A Fast Multifrontal Solver for Non-linear Multi-physics Problems.
International Conference on Computational Science 2004: 614-617 |
| 2003 |
|---|
| 45 | EE | 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 |
|---|
| 44 | EE | Carlo Fantozzi,
Andrea Pietracaprina,
Geppino Pucci:
Seamless Integration of Parallelism and Memory Hierarchy.
ICALP 2002: 856-867 |
| 43 | EE | 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 |
| 42 | EE | Roberto Grossi,
Andrea Pietracaprina,
Geppino Pucci:
Optimal Deterministic Protocols for Mobile Robots on a Grid.
Inf. Comput. 173(2): 132-142 (2002) |
| 41 | EE | Kieran T. Herley,
Andrea Pietracaprina,
Geppino Pucci:
Deterministic parallel backtrack search.
Theor. Comput. Sci. 270(1-2): 309-324 (2002) |
| 2001 |
|---|
| 40 | EE | Andrea Pietracaprina,
Geppino Pucci:
Optimal Many-to-One Routing on the Mesh with Constant Queues.
Euro-Par 2001: 645-650 |
| 39 | | Carlo Fantozzi,
Andrea Pietracaprina,
Geppino Pucci:
Implementing Shared Memory on Clustered Machines.
IPDPS 2001: 62 |
| 38 | EE | 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 |
| 37 | EE | Kieran T. Herley,
Andrea Pietracaprina,
Geppino Pucci:
One-to-Many routing on the mesh.
SPAA 2001: 31-37 |
| 36 | EE | 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 |
|---|
| 35 | EE | Mauro Bianco,
Geppino Pucci:
On the Predictive Quality of BSP-like Cost Functions for NOWs.
Euro-Par 2000: 638-646 |
| 34 | EE | Marco Danelutto,
Geppino Pucci:
A Compact, Thread-Safe Communication Library for Efficient Cluster Computing.
HPCN Europe 2000: 407-416 |
| 33 | EE | 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- |
| 32 | EE | Gianfranco Bilardi,
Kieran T. Herley,
Andrea Pietracaprina,
Geppino Pucci:
On Stalling in LogP.
IPDPS Workshops 2000: 109-115 |
| 31 | | Andrea Pietracaprina,
Geppino Pucci,
Jop F. Sibeyn:
Constructive, Deterministic Implementation of Shared Memory on Meshes.
SIAM J. Comput. 30(2): 625-648 (2000) |
| 1999 |
|---|
| 30 | EE | Sandeep N. Bhatt,
Gianfranco Bilardi,
Geppino Pucci:
Area-Universal Circuits with Constant Slowdown.
ARVLSI 1999: 89-98 |
| 29 | EE | 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 |
| 28 | | Kieran T. Herley,
Andrea Pietracaprina,
Geppino Pucci:
Deterministic Branch-and-Bound on Distributed Memory Machines (Extended Abstract).
IPPS/SPDP Workshops 1999: 1085-1094 |
| 27 | EE | Gianfranco Bilardi,
Andrea Pietracaprina,
Geppino Pucci,
Kieran T. Herley,
Paul G. Spirakis:
BSP versus LogP.
Algorithmica 24(3-4): 405-422 (1999) |
| 26 | | 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) |
| 25 | EE | Kieran T. Herley,
Andrea Pietracaprina,
Geppino Pucci:
Fast Deterministic Parallel Branch-and-Bound.
Parallel Processing Letters 9(3): 325-333 (1999) |
| 1998 |
|---|
| 24 | | 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 |
| 23 | EE | Roberto Grossi,
Andrea Pietracaprina,
Geppino Pucci:
Optimal Deterministic Protocols for Mobile Robots on a Grid.
SWAT 1998: 181-192 |
| 22 | | 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) |
| 1997 |
|---|
| 21 | | Andrea Pietracaprina,
Geppino Pucci:
The Complexity of Deterministic PRAM Simulation on Distributed Memory Machines.
Theory Comput. Syst. 30(3): 231-247 (1997) |
| 1996 |
|---|
| 20 | | Kieran T. Herley,
Andrea Pietracaprina,
Geppino Pucci:
Fast Deterministic Backtrack Search.
ICALP 1996: 598-609 |
| 19 | | Gianfranco Bilardi,
Kieran T. Herley,
Andrea Pietracaprina,
Geppino Pucci,
Paul G. Spirakis:
BSP vs LogP.
SPAA 1996: 25-32 |
| 18 | | 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) |
| 1995 |
|---|
| 17 | | 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 |
| 16 | | Sandeep N. Bhatt,
Gianfranco Bilardi,
Kieran T. Herley,
Geppino Pucci,
Abhiram G. Ranade:
Tight Bounds on Parallel List Marking.
Euro-Par 1995: 231-242 |
| 15 | | Andrea Pietracaprina,
Geppino Pucci:
Improved Deterministic PRAM Simulation on the Mesh.
ICALP 1995: 372-383 |
| 14 | EE | Maria Cristina Pinotti,
Geppino Pucci:
Parallel Algorithms for Priority Queue Operations.
Theor. Comput. Sci. 148(1): 171-180 (1995) |
| 1994 |
|---|
| 13 | | Andrea Pietracaprina,
Geppino Pucci:
Tight Bounds on Deterministic PRAM Emulations with Constant Redundancy.
ESA 1994: 391-400 |
| 12 | EE | Andrea Pietracaprina,
Geppino Pucci,
Jop F. Sibeyn:
Constructive Deterministic PRAM Simulation on a Mesh-Connected Computer.
SPAA 1994: 248-256 |
| 11 | | Linda Pagli,
Geppino Pucci:
Counting the Number of Fault Patterns in Redundant VLSI Arrays.
Inf. Process. Lett. 50(6): 337-342 (1994) |
| 1993 |
|---|
| 10 | | 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 |
| 9 | | 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) |
| 1992 |
|---|
| 8 | | Fabrizio Luccio,
Linda Pagli,
Geppino Pucci:
Three non Conventional Paradigms of Parallel Computation.
Heinz Nixdorf Symposium 1992: 166-175 |
| 7 | | Maria Cristina Pinotti,
Geppino Pucci:
Parallel Algorithms for Priority Queue Operations.
SWAT 1992: 130-139 |
| 6 | EE | Geppino Pucci:
A New Approach to the Modeling of Recovery Block Structures.
IEEE Trans. Software Eng. 18(2): 159-167 (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 | | Fabrizio Luccio,
Andrea Pietracaprina,
Geppino Pucci:
Analysis of Parallel Uniform Hashing.
Inf. Process. Lett. 37(2): 67-69 (1991) |
| 3 | | Maria Cristina Pinotti,
Geppino Pucci:
Parallel Priority Queues.
Inf. Process. Lett. 40(1): 33-40 (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) |
