Publications
Please note that the copyrights
of the papers with full citations have been signed over
to the publishers.
Book Chapters

G. Bilardi, A. Pietracaprina. Theoretical Models of
Computation. Encyclopedia of Parallel Computing, Springer 2011: 11501158.
Publisher's page.

N.M. Amato, D.T. Lee, A. Pietracaprina, R. Tamassia (eds).
Excursions in Algorithmics: A Collection of Papers in Honor of
Franco P. Preparata. Preface. Special Issue of Theoretical Computer Science
408(23):9798, 2008.
 G. Bilardi, A. Pietracaprina, and G. Pucci.
Decomposable BSP:
A BandwidthLatency Model for Parallel and Hierarchical Computation.
In Handbook of Parallel Computing (J. Reif and S. Rajasekaran Eds.),
CRC Press, Boca Raton Fl USA, 2007.
Publisher's page.
 G. Bilardi, G. Italiano, A. Pietracaprina and G. Pucci (eds).
Algorithms  ESA'98.
Proceedings of the 6th Annual European Symposium.
LNCS 1461, Springer Verlag, Berlin, D, 1998.
Journal Papers

N. Lazzarini, L. Nanni, C. Fantozzi, A. Pietracaprina, G. Pucci,
T.M. Seccia, G.P. Rossi.
Heterogeneous Machine Learning System for Diagnosing Primary
Aldosteronism. Journal of Hypertension (esupplement) 31:e409,
2013. (IF:4.021.) Also in Proc. European Meeting on Hypertension and
Cardiovascular Protection (ESH13) (Poster Session), Milan I, June
2013.

A. Pettarin, A. Pietracaprina, and G. Pucci.
On the Expansion and Diameter of Bluetoothlike Topologies.
Theory of Computing Systems 52(2):319339, 2013. (IF:0.442.)

A. Kirsch, M. Mitzenmacher, A. Pietracaprina, G. Pucci, E. Upfal, and F. Vandin.
An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets.
Journal of the ACM 59(3):1211222, 2012. (IF:2.717.)

R. Grossi, A. Pietracaprina, N. Pisanti, G. Pucci, E. Upfal, and F. Vandin.
MADMX: A Strategy for Maximal Dense Motif Extraction.
Journal of Computational Biology, 18(4):535545, 2011. (IF:1.694.)

S. Nasso, F. Silvestri, F. Tisiot, B. DI Camillo, A. Pietracaprina, G. Toffolo.
An optimized data structure for highthroughput 3D proteomics data:
mzRTree.Journal of Proteomics 73:11761182. (IF:5.074)
 A. Pietracaprina, M. Riondato, E. Upfal, F. Vandin.
Mining TopK Frequent Itemsets Through Progressive Sampling.
Data Min. Knowl. Discov. 21(2): 310326, 2010. (IF: 1.238)
 P. Crescenzi, C. Nocentini, A. Pietracaprina, and G. Pucci.
On the Connectivity of BluetoothBased Ad Hoc Networks.
Concurrency and Computation: Practice and Experience 21(7): 875887, 2009.
Special Issue on EUROPAR'07. (IF:1.791)
 P. Bertasi, M. Bianco, A. Pietracaprina, G. Pucci.
Obtaining Performance Measures through Microbenchmarking in a
PeertoPeer Overlay Computer.
International Journal of Computational Intelligence Research.
4(1), 2008.
 K.T. Herley, A. Pietracaprina, and G. Pucci.
StoreandForward Multicast Routing on the Mesh.
Theory of Computing Systems, (42):519535, 2008. (IF:0.766)

C. Fantozzi, A. Pietracaprina, and G. Pucci.
Translating Submachine Locality into Locality of Reference.
Journal of Parallel and Distributed Computing 66(5):633646, 2006.
Special issue on the four Best Papers of IPDPS. (IF: 1.168)

G. Bilardi, K.T. Herley, A. Pietracaprina, and G. Pucci.
On Stalling in LogP.
Journal of Parallel and Distributed Computing 65(3):307312, 2005.
(IF: 1.168)

A. Pietracaprina and G. Pucci.
Optimal ManytoOne Routing on the Mesh with Constant Queues.
Information Processing Letters 96(1):2429, 2005.
(IF:1.504)

C. Fantozzi, A. Pietracaprina, and G. Pucci.
A General PRAM Simulation Scheme for Clustered Machines.
Int.l Journal on Foundations of Computer Science 14(6):11471164,
2003. (IF: 0.554)

K. Herley, A. Pietracaprina, and G. Pucci.
Deterministic parallel backtrack search.
Theoretical Computer Science, 270(12):309324, 2002.(IF:0.806)

R. Grossi, A. Pietracaprina, and G. Pucci.
Optimal deterministic protocols for mobile robots on a grid.
Information and Computation, 173(2):132142, 2002.(IF:1.504)

K.T. Herley, A. Pietracaprina, and G. Pucci.
Implementing shared memory on meshconnected computers and on the
fattree.
Information and Computation, 165(2):123143, 2001. (IF:1.504)

A. Pietracaprina, G. Pucci, and J. Sibeyn.
Constructive, deterministic implementation of shared memory
on meshes.
SIAM Journal on Computing, 30(2):625648, 2000.
(IF: 1.459)

K.T. Herley, A. Pietracaprina, and G. Pucci.
Deterministic branchandbound on distributed memory machines.
International Journal of Foundations of Computer Science,
10(4):391404, 1999. Special Issue for IRREGULAR'99. (IF: 0.554)

K.T. Herley, A. Pietracaprina, and G. Pucci.
Fast deterministic parallel branchandbound.
Parallel Processing Letters, 9(3):325334, 1999.

G. Bilardi, K.T. Herley, A. Pietracaprina, G. Pucci, and P. Spirakis.
BSP versus LogP.
Algorithmica, 24:405422, 1999.
Special Issue on Coarse Grained Parallel Algorithms. (IF: 0.825)

A. Baumker, W. Dittrich, and A. Pietracaprina.
The complexity of parallel multisearch on coarse grained machines.
Algoritmica, 24:209242, 1999.
Special Issue on Coarse Grained Parallel Algorithms.

A. Pietracaprina and G. Pucci.
The complexity of deterministic PRAM simulation on distributed
memory machines.
Theory of Computing Systems, 30(3):231247, 1997. (IF:0.442)

A. Pietracaprina and F.P. Preparata.
Practical constructive schemes for deterministic sharedmemory
access.
Theory of Computing Systems, Special Issue for SPAA'93, 30(1):337,
Jan/Feb 1997. (IF:0.442)

A. Krishna, A. Pietracaprina, and B. Hajek.
Sharper analysis of packet routing on a butterfly.
Networks, 24(2):91101, 1994. (IF: 0.645)

F. Luccio, A. Pietracaprina, and G. Pucci.
Analysis and implementation of parallel uniform hashing.
International Journal of Foundations of Computer Science,
3(1):5563, 1992. (IF: 0.554)

F. Luccio, A. Pietracaprina, and G. Pucci.
Analysis of parallel uniform hashing.
Information Processing Letters, 37:6769, 1991. (IF:0.706)

F. Luccio, A. Pietracaprina, and G. Pucci.
A new scheme for the deterministic simulation of PRAMs in VLSI.
Algorithmica, 5(4):529544, 1990. (IF: 0.825)

F. Luccio, A. Pietracaprina, and G. Pucci.
A probabilistic simulation of PRAMs on a bounded degree network.
Information Processing Letters, 28:141147, 1988. (IF:0.706)
Conference Papers

A. Pietracaprina, G. Pucci, F. Silvestri and F. Vandin.
SpaceEfficient Parallel Algorithms for Combinatorial Search Problems.
In Proc. 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013, Klosterneuburg OST, pages 717728, August 2013.
arXiv version

A. Pietracaprina, G. Pucci, M. Riondato, F. Silvestri and E. Upfal.
SpaceRound Tradeoffs for MapReduce Computations. In
Proc. 26th ACM International Conference on Supercomputing, ICS 2012,
Venice I, June 2012.
arXiv version

A. Pettarin, A. Pietracaprina G. Pucci, and E. Upfal.
Tight Bounds on Information Dissemination in Sparse Mobile
Networks. In Proc. 30th Annual ACM SIGACTSIGOPS Symposium on
Principles of Distributed Computing, PODC 2011, San Jose, CA USA, June
2011.
 A. Pettarin, A. Pietracaprina, and G. Pucci.
On the Expansion and Diameter of Bluetoothlike Topologies.
In Proc. 17th Annual European Symposium on Algorithms (ESA) 2009,
pages 528539, 2009.
 R. Grossi, A. Pietracaprina, N. Pisanti, G. Pucci,
E. Upfal, and F. Vandin.
MADMX: A Novel Strategy for Maximal Dense Motif Extraction.
In Proc. 9th Workshop on Algorithms in Bioinformatics (WABI) 2009,
pages 362374, 2009.
 A. Kirsch, M. Mitzenmacher, A. Pietracaprina, G. Pucci, E. Upfal,
and F. Vandin.
An Efficient Rigorous Approach for Identifying Statistically
Significant Frequent Itemsets.
In Proc. 27th ACM Symposium on Principles of Database Systems (PODS) 2009,
 A. Pietracaprina, and F. Vandin.
Efficient Incremental Mining of TopK Frequent Closed Itemsets.
In Proc. Discovery Science (DS) 2007, LNCS 4755, pages 275280, 2007.
 P. Crescenzi, C. Nocentini, A. Pietracaprina, G. Pucci, and C. Sandri.
On the Connectivity of BluetoothBased Ad Hoc Networks
In Proc. EUROPAR'07 Parallel Processing, LNCS Vol. 4641,
pages 960969, 2007.
 P. Bertasi, M. Bianco, A. Pietracaprina, and G. Pucci.
Obtaining Performance Measures through Microbenchmarking in a
PeertoPeer Overlay Computer. In Proc.
1st International Workshop on P2P, Parallel, Grid and Internet
Computing, 3PGIC2007.

G. Bilardi, A. Pietracaprina, G. Pucci, F. Silvestri.
NetworkOblivious Algorithms.
In Proc. 21st International Parallel and Distributed Processing Symposium,
IPDPS 2007.
arXiv version

A. Pietracaprina, G. Pucci, F. Silvestri.
CacheOblivious Simulation of Parallel Programs.
In Proc. 8th IPDPS Workshop on Advances in Parallel and
Distributed Computational Models, APDCM 2006.

G. Bilardi, A. Pietracaprina, G. Pucci, F. Schifano and R. Tripiccione.
The Potential of OnChip Multiprocessing for QCD Machines.
In Proc. 12th International Conference on
HighPerformance Computing (HiPC), LNCS Vol. 3769,
pages 386397, 2005.

C. Fantozzi, A. Pietracaprina, and G. Pucci.
Translating Submachine Locality into Locality of Reference.
In Proc. 18th International Parallel and Distributed
Processing Symposium, IPDPS 2004. Paper recepient of Best Paper
Award, Algorithms Track (4 tracks, 142 entries).

A. Pietracaprina and D. Zandolin.
Mining Frequent Itemsets Using Patricia Tries.
In Proc. 1st Workshop on Frequent Itemset Mining
Implementations, FIMI 2003.
Paper:
CEURWS Workshop Online Proceedings, Vol. 90
Code:
PATRICIAMINE.tar.gz

C. Fantozzi, A. Pietracaprina and G. Pucci.
Seamless integration of parallelism and memory hierarchy.
In Proc. 29th International Colloquium on Automata,
Languages, and Programming, ICALP'02,
LNCS 2380, pages 856867, Malaga, E, July 2002.

F. Dehne, S. Mardegan, A. Pietracaprina and G. Prencipe.
Distribution sweeping on clustered machines with hierarchical
memories.
In Proc. International Parallel and Distributed Processing
Symposium, IPDPS 2002, Fort Lauderdale, USA, April 2002.

A. Pietracaprina and G. Pucci.
Optimal manytoone routing on the mesh.
In Proc. EUROPAR'2001  Parallel Processing,
pages 645650, Manchester, UK, August 2001.

K.T. Herley, A. Pietracaprina and G. Pucci.
Onetomany routing on the mesh.
In Proc. 13th ACM Symp. on Parallel Algorithms and
Architectures, SPAA'01, pages 3137, Heraklion, GR, Jun. 2001.

G. Bilardi, C. Fantozzi, A. Pietracaprina and G. Pucci.
On the effectiveness of DBSP as a bridging model of parallel
computation.
In Proc. International Conference on Computational Science,
ICCS 2001, LNCS 2074, pages 579588, San Francisco, USA, May 2001.

C. Fantozzi, A. Pietracaprina and G. Pucci.
Implementing shared memory on clustered machines.
In Proc. International Parallel and Distributed Processing
Symposium, IPDPS 2001, San Francisco, USA, April 2001.

G. Bilardi, A. Pietracaprina, and P. D'Alberto.
On the space and access complexity of computation dags.
In Proc. 26th International Workshop on GraphTheoretic
Concepts in Computer Science, WG 2000, LNCS 1928, pages
4758, Konstanz, D, June 2000.

G. Bilardi, K.T. Herley, A. Pietracaprina, and G. Pucci.
On stalling in LogP.
In Proc. Workshop on Advances in Parallel and Distributed
Computational Models, LNCS 1800, pages 109115,
Cancun, MEX, May 2000.

N.M. Amato, J. Perdue, A. Pietracaprina, G. Pucci, and M. Mathis.
Predicting performance on SMP's. A case study: The SGI Power Challenge.
In Proc. International Parallel and Distributed Processing
Symposium, IPDPS 2000, pages 72937, Cancun, MEX, May 2000.

G. Bilardi, A. Pietracaprina, and G. Pucci.
A quantitative measure of portability with application to
bandwidthlatency models for parallel computing.
In Proc. EUROPAR'99 Parallel Processing,
LNCS 1685, pages 543551, Toulouse, F, Aug./Sep. 1999.

K.T. Herley, A. Pietracaprina and G. Pucci.
Deterministic branchandbound on distributed memory machines.
In Proc. IRREGULAR'99, pages 10851094, Puerto Rico, USA,
April 1999.

R. Grossi, A. Pietracaprina and G. Pucci.
Optimal deterministic protocols for mobile robots on a grid.
In Proc. 6th Scandinavian Workshop on Algorithm Theory,
LNCS 1432, pages 181192, Stockholm, S, July 1998.

N. Amato, L.K. Dale and J.Perdue, A. Pietracaprina, G. Pucci.
A cost model for communication on a symmetric multiprocessor.
In Proc 10th ACM Symp. on Parallel Algorithms and Architectures,
Revue Session, Puerto Vallarta, MEX, JuneJuly 1998.

A. Pietracaprina.
Deterministic routing of hrelations on the multibutterfly.
In Proc. 1st Merged IPPS/SPDP Symposium:
12th Int.l Parallel Processing Symposium
and 9th Symposium on Parallel and Distributed Processing,
pages 375379, Orlando, Florida, MarchApril 1998.

K.T. Herley, A. Pietracaprina, and G. Pucci.
Fast deterministic backtrack search.
In Proc. 23rd International Colloquium on Automata,
Languages, and Programming, ICALP'96,
LNCS 1099, pages 598609, Paderborn, D, Jul. 1996.

A. Baumker, W. Dittrich, and A. Pietracaprina.
The deterministic complexity of parallel multisearch.
In Proc. ot the 5th Scandinavian Workshop on Algorithm
Theory, SWAT'96, LNCS 1097, pages 404415, Reykjavik, Iceland, 1996.

G. Bilardi, K.T. Herley, A. Pietracaprina, G. Pucci, and
P. Spirakis.
BSP vs LogP.
In Proc. 8th ACM Symp. on Parallel Algorithms and
Architectures, SPAA'96, pages 2532, Padova, I, Jun. 1996.

K.T. Herley, A. Pietracaprina, and G. Pucci.
Implementing shared memory on multidimensional meshes
and on the fattree.
In Proc. 3rd European Symposium on Algorithms, ESA'95,
LNCS 979, pages 6074, Corfu, GR, Sep. 1995.

A. Pietracaprina and G. Pucci.
Improved deterministic PRAM simulation on the mesh.
In Proc. 22nd International Colloquium on Automata,
Languages, and Programming, ICALP'95, LNCS 944, pages 372383,
Szeged, H, July 1995.

A. Pietracaprina and G. Pucci.
Tight bounds on deterministic PRAM emulations with constant
redundancy.
In Proc. 2nd European Symposium on Algorithms, ESA'94,
LNCS 885, pages 319400, Utrecht, NL, Sep. 1994.

A. Pietracaprina, G. Pucci, and J. Sibeyn.
Constructive deterministic PRAM simulation on a meshconnected
computer.
In Proc. 6th ACM Symp. on Parallel Algorithms and
Architectures, SPAA'94, pages 248256, Cape May NJ, USA,
Jun. 1994.

A. Pietracaprina and F.P. Preparata.
A practical constructive scheme for deterministic sharedmemory
access.
In Proc. 5th ACM Symp. on Parallel Algorithms and
Architectures, SPAA'93, pages 100109, Velen, D, 1993.

A. Pietracaprina and F.P. Preparata.
An N^(1/2)worstcasetime solution to the granularity
problem.
In Proc. 10th Symp. on Theoretical Aspects of Computer
Science, STACS'93 , LNCS 665, pages 110119, Wurzburg, D,
February 1993.

A. Krishna, A. Pietracaprina, and B. Hajek.
Packet routing in optimal time on a butterfly.
In Proc. of the 10th IEEE INFOCOM, pages 08400849,
Bal Harbour, FL, April 1991.

F. Luccio, A. Pietracaprina, and G. Pucci.
Analysis and implementation of parallel uniform hashing.
In Proc. 1st Italian Conference on Algorithms and
Complexity, CIAC'90, pages 112, Roma, I, Oct. 1990.
