Andrea Pietracaprina - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Tight bounds on information dissemination in sparse mobile networksAlberto Pettarin, Andrea Pietracaprina, Geppino Pucci, Eli Upfal. podc 2011: 355-362 [doi]

2010

Mining top-::::K:::: frequent itemsets through progressive samplingAndrea Pietracaprina, Matteo Riondato, Eli Upfal, Fabio Vandin. datamine, 21(2):310-326, 2010. [doi]

2009

2008

PrefaceNancy M. Amato, Der-Tsai Lee, Andrea Pietracaprina, Roberto Tamassia. TCS, 408(2-3):97-98, 2008. [doi]

Store-and-Forward Multicast Routing on the MeshKieran T. Herley, Andrea Pietracaprina, Geppino Pucci. mst, 42(4):519-535, 2008. [doi]

2007

2006

Translating submachine locality into locality of referenceCarlo Fantozzi, Andrea Pietracaprina, Geppino Pucci. jpdc, 66(5):633-646, 2006. [doi]

Cache-oblivious simulation of parallel programsAndrea Pietracaprina, Geppino Pucci, Francesco Silvestri. ipps 2006: [doi]

2005

2004

Translating Submachine Locality into Locality of ReferenceCarlo Fantozzi, Andrea Pietracaprina, Geppino Pucci. ipps 2004: [doi]

Topic 13: Theory and Algorithms for Parallel ComputationChristos Kaklamanis, Nancy M. Amato, Danny Krizanc, Andrea Pietracaprina. europar 2004: 803 [doi]

2003

A General Pram Simulation Scheme For Clustered MachinesCarlo Fantozzi, Andrea Pietracaprina, Geppino Pucci. ijfcs, 14(6):1147-1164, 2003. [doi]

Mining Frequent Itemsets using Patricia TriesAndrea Pietracaprina, Dario Zandolin. fimi 2003: [doi]

2002

2001

2000

1999

BSP versus LogPGianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Kieran T. Herley, Paul G. Spirakis. algorithmica, 24(3-4):405-422, 1999. [doi]

A Quantitative Measure of Portability with Application to Bandwidth-Latency Models for Parallel ComputingGianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci. europar 1999: 543-551 [doi]

The Complexity of Parallel Multisearch on Coarse-Grained MachinesArmin Bäumker, Wolfgang Dittrich, Andrea Pietracaprina. algorithmica, 24(3-4):209-242, 1999. [doi]

Deterministic Branch-and-Bound on Distributed Memory MachinesKieran T. Herley, Andrea Pietracaprina, Geppino Pucci. ijfcs, 10(4):391-404, 1999.

Fast Deterministic Parallel Branch-and-BoundKieran T. Herley, Andrea Pietracaprina, Geppino Pucci. ppl, 9(3):325-333, 1999. [doi]

Deterministic Branch-and-Bound on Distributed Memory Machines (Extended Abstract)Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci. ipps 1999: 1085-1094

1998

Algorithms - ESA 98, 6th Annual European Symposium, Venice, Italy, August 24-26, 1998, ProceedingsGianfranco Bilardi, Giuseppe F. Italiano, Andrea Pietracaprina, Geppino Pucci, editors, Volume 1461 of Lecture Notes in Computer Science, Springer, 1998.

Optimal Deterministic Protocols for Mobile Robots on a GridRoberto Grossi, Andrea Pietracaprina, Geppino Pucci. swat 1998: 181-192 [doi]

Deterministic Routing of h-relations on the MultibutterflyAndrea Pietracaprina. ipps 1998: 375-379 [doi]

1997

Practical Constructive Schemes for Deterministic Shared-Memory AccessAndrea Pietracaprina, Franco P. Preparata. mst, 30(1):3-37, 1997.

The Complexity of Deterministic PRAM Simulation on Distributed Memory MachinesAndrea Pietracaprina, Geppino Pucci. mst, 30(3):231-247, 1997.

1996

BSP vs LogPGianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci, Paul G. Spirakis. spaa 1996: 25-32

The Deterministic Complexity of Parallel Multisearch (Extended Abstract)Armin Bäumker, Wolfgang Dittrich, Andrea Pietracaprina. swat 1996: 404-415

Fast Deterministic Backtrack SearchKieran T. Herley, Andrea Pietracaprina, Geppino Pucci. icalp 1996: 598-609

1995

Implementing Shared Memory on Mult-Dimensional Meshes and on the Fat-Tree (Extended Abstract)Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci. esa 1995: 60-74

Improved Deterministic PRAM Simulation on the MeshAndrea Pietracaprina, Geppino Pucci. icalp 1995: 372-383

1994

Constructive Deterministic PRAM Simulation on a Mesh-Connected ComputerAndrea Pietracaprina, Geppino Pucci, Jop F. Sibeyn. spaa 1994: 248-256 [doi]

Tight Bounds on Deterministic PRAM Emulations with Constant RedundancyAndrea Pietracaprina, Geppino Pucci. esa 1994: 391-400

1993

On O(sqrt(n))-Worst-Case-Time Solution to the Granularity ProblemAndrea Pietracaprina, Franco P. Preparata. STACS 1993: 110-119

A Practical Constructive Scheme for Deterministic Shared-Memory AccessAndrea Pietracaprina, Franco P. Preparata. spaa 1993: 100-109 [doi]

1992

Analysis and Implementation of Parallel Uniform HashingFabrizio Luccio, Andrea Pietracaprina, Geppino Pucci. ijfcs, 3(1):55-63, 1992.

1991

Packet Routing in Optimal Time on a ButterflyArvind Krishna, Andrea Pietracaprina, Bruce Hajek. infocom 1991: 840-849

Analysis of Parallel Uniform HashingFabrizio Luccio, Andrea Pietracaprina, Geppino Pucci. ipl, 37(2):67-69, 1991.

1990

A New Scheme for the Deterministic Simulation of PRAMs in VLSIFabrizio Luccio, Andrea Pietracaprina, Geppino Pucci. algorithmica, 5(4):529-544, 1990.

1988

A Probabilistic Simulation of PRAMs on a Bounded Degree NetworkFabrizio Luccio, Geppino Pucci, Andrea Pietracaprina. ipl, 28(3):141-147, 1988.