The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Andrea Pietracaprina: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci
    Implementing Shared Memory on Mult-Dimensional Meshes and on the Fat-Tree (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:60-74 [Conf]
  2. Andrea Pietracaprina, Geppino Pucci
    Tight Bounds on Deterministic PRAM Emulations with Constant Redundancy. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:391-400 [Conf]
  3. Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci
    A Quantitative Measure of Portability with Application to Bandwidth-Latency Models for Parallel Computing. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1999, pp:543-551 [Conf]
  4. Christos Kaklamanis, Nancy M. Amato, Danny Krizanc, Andrea Pietracaprina
    Topic 13: Theory and Algorithms for Parallel Computation. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2004, pp:803- [Conf]
  5. Andrea Pietracaprina, Kieran T. Herley, Christos D. Zaroliagis, Casiano Rodriguez-Leon
    Topic 12 Theory and Algorithms for Parallel Computation. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2005, pp:929- [Conf]
  6. Andrea Pietracaprina, Geppino Pucci
    Optimal Many-to-One Routing on the Mesh with Constant Queues. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2001, pp:645-650 [Conf]
  7. Andrea Pietracaprina, Dario Zandolin
    Mining Frequent Itemsets using Patricia Tries. [Citation Graph (0, 0)][DBLP]
    FIMI, 2003, pp:- [Conf]
  8. Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Sebastiano Fabio Schifano, Raffaele Tripiccione
    The Potential of On-Chip Multiprocessing for QCD Machines. [Citation Graph (0, 0)][DBLP]
    HiPC, 2005, pp:386-397 [Conf]
  9. Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci
    Seamless Integration of Parallelism and Memory Hierarchy. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:856-867 [Conf]
  10. Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci
    Fast Deterministic Backtrack Search. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:598-609 [Conf]
  11. Andrea Pietracaprina, Geppino Pucci
    Improved Deterministic PRAM Simulation on the Mesh. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:372-383 [Conf]
  12. Gianfranco Bilardi, Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci
    On the Effectiveness of D-BSP as a Bridging Model of Parallel Computation. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (2), 2001, pp:579-588 [Conf]
  13. Arvind Krishna, Andrea Pietracaprina, Bruce Hajek
    Packet Routing in Optimal Time on a Butterfly. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1991, pp:840-849 [Conf]
  14. Nancy M. Amato, Jack Perdue, Mark M. Mathis, Andrea Pietracaprina, Geppino Pucci
    Predicting Performance on SMPs. A Case Study: The SGI Power Challenge. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2000, pp:729-0 [Conf]
  15. Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci
    On Stalling in LogP. [Citation Graph (0, 0)][DBLP]
    IPDPS Workshops, 2000, pp:109-115 [Conf]
  16. Frank K. H. A. Dehne, Stefano Mardegan, Andrea Pietracaprina, Giuseppe Prencipe
    Distribution Sweeping on Clustered Machines with Hierarchical Memories. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2002, pp:- [Conf]
  17. Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci
    Implementing Shared Memory on Clustered Machines. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2001, pp:62- [Conf]
  18. Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci
    Translating Submachine Locality into Locality of Reference. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  19. Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci
    Deterministic Branch-and-Bound on Distributed Memory Machines (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP Workshops, 1999, pp:1085-1094 [Conf]
  20. Andrea Pietracaprina
    Deterministic Routing of h-relations on the Multibutterfly. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP, 1998, pp:375-379 [Conf]
  21. Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri
    Cache-oblivious simulation of parallel programs. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2006, pp:- [Conf]
  22. Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci, Paul G. Spirakis
    BSP vs LogP. [Citation Graph (0, 0)][DBLP]
    SPAA, 1996, pp:25-32 [Conf]
  23. Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci
    One-to-Many routing on the mesh. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:31-37 [Conf]
  24. Andrea Pietracaprina, Franco P. Preparata
    A Practical Constructive Scheme for Deterministic Shared-Memory Access. [Citation Graph (0, 0)][DBLP]
    SPAA, 1993, pp:100-109 [Conf]
  25. Andrea Pietracaprina, Geppino Pucci, Jop F. Sibeyn
    Constructive Deterministic PRAM Simulation on a Mesh-Connected Computer. [Citation Graph (0, 0)][DBLP]
    SPAA, 1994, pp:248-256 [Conf]
  26. Andrea Pietracaprina, Franco P. Preparata
    On O(sqrt(n))-Worst-Case-Time Solution to the Granularity Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:110-119 [Conf]
  27. Armin Bäumker, Wolfgang Dittrich, Andrea Pietracaprina
    The Deterministic Complexity of Parallel Multisearch (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SWAT, 1996, pp:404-415 [Conf]
  28. Roberto Grossi, Andrea Pietracaprina, Geppino Pucci
    Optimal Deterministic Protocols for Mobile Robots on a Grid. [Citation Graph (0, 0)][DBLP]
    SWAT, 1998, pp:181-192 [Conf]
  29. Gianfranco Bilardi, Andrea Pietracaprina, Paolo D'Alberto
    On the Space and Access Complexity of Computation DAGs. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:47-58 [Conf]
  30. Armin Bäumker, Wolfgang Dittrich, Andrea Pietracaprina
    The Complexity of Parallel Multisearch on Coarse-Grained Machines. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:24, n:3-4, pp:209-242 [Journal]
  31. Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Kieran T. Herley, Paul G. Spirakis
    BSP versus LogP. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:24, n:3-4, pp:405-422 [Journal]
  32. Fabrizio Luccio, Andrea Pietracaprina, Geppino Pucci
    A New Scheme for the Deterministic Simulation of PRAMs in VLSI. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1990, v:5, n:4, pp:529-544 [Journal]
  33. Roberto Grossi, Andrea Pietracaprina, Geppino Pucci
    Optimal Deterministic Protocols for Mobile Robots on a Grid. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:173, n:2, pp:132-142 [Journal]
  34. Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci
    Implementing Shared Memory on Mesh-Connected Computers and on the Fat-Tree. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:165, n:2, pp:123-143 [Journal]
  35. Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci
    A General Pram Simulation Scheme For Clustered Machines. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:6, pp:1147-1164 [Journal]
  36. Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci
    Deterministic Branch-and-Bound on Distributed Memory Machines. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:4, pp:391-404 [Journal]
  37. Fabrizio Luccio, Andrea Pietracaprina, Geppino Pucci
    Analysis and Implementation of Parallel Uniform Hashing. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1992, v:3, n:1, pp:55-63 [Journal]
  38. Fabrizio Luccio, Geppino Pucci, Andrea Pietracaprina
    A Probabilistic Simulation of PRAMs on a Bounded Degree Network. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:28, n:3, pp:141-147 [Journal]
  39. Fabrizio Luccio, Andrea Pietracaprina, Geppino Pucci
    Analysis of Parallel Uniform Hashing. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:37, n:2, pp:67-69 [Journal]
  40. Andrea Pietracaprina, Geppino Pucci
    Optimal many-to-one routing on the mesh with constant queues. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:96, n:1, pp:24-29 [Journal]
  41. Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci
    On stalling in LogP. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2005, v:65, n:3, pp:307-312 [Journal]
  42. Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci
    Translating submachine locality into locality of reference. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2006, v:66, n:5, pp:633-646 [Journal]
  43. Andrea Pietracaprina, Franco P. Preparata
    Practical Constructive Schemes for Deterministic Shared-Memory Access. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1997, v:30, n:1, pp:3-37 [Journal]
  44. Andrea Pietracaprina, Geppino Pucci
    The Complexity of Deterministic PRAM Simulation on Distributed Memory Machines. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1997, v:30, n:3, pp:231-247 [Journal]
  45. Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci
    Fast Deterministic Parallel Branch-and-Bound. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1999, v:9, n:3, pp:325-333 [Journal]
  46. Andrea Pietracaprina, Geppino Pucci, Jop F. Sibeyn
    Constructive, Deterministic Implementation of Shared Memory on Meshes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:2, pp:625-648 [Journal]
  47. Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci
    Deterministic parallel backtrack search. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:270, n:1-2, pp:309-324 [Journal]
  48. Andrea Pietracaprina, Fabio Vandin
    Efficient Incremental Mining of Top-K Frequent Closed Itemsets. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2007, pp:275-280 [Conf]
  49. Pilu Crescenzi, Carlo Nocentini, Andrea Pietracaprina, Geppino Pucci, Carlo Sandri
    On the Connectivity of Bluetooth-Based Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2007, pp:960-969 [Conf]
  50. Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri
    Network-Oblivious Algorithms. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2007, pp:1-10 [Conf]

  51. On the Expansion and Diameter of Bluetooth-Like Topologies. [Citation Graph (, )][DBLP]


  52. Introduction. [Citation Graph (, )][DBLP]


  53. An efficient rigorous approach for identifying statistically significant frequent itemsets. [Citation Graph (, )][DBLP]


  54. MADMX: A Novel Strategy for Maximal Dense Motif Extraction. [Citation Graph (, )][DBLP]


  55. Obtaining Performance Measures through Microbenchmarking in a Peer-to-Peer Overlay Computer. [Citation Graph (, )][DBLP]


  56. On the connectivity of Bluetooth-based ad hoc networks. [Citation Graph (, )][DBLP]


  57. MADMX: A Novel Strategy for Maximal Dense Motif Extraction [Citation Graph (, )][DBLP]


  58. An Efficient Rigorous Approach for Identifying Statistically Significant Frequent Itemsets [Citation Graph (, )][DBLP]


  59. An Optimized Data Structure for High Throughput 3D Proteomics Data: mzRTree [Citation Graph (, )][DBLP]


  60. Mining Top-K Frequent Itemsets Through Progressive Sampling [Citation Graph (, )][DBLP]


  61. Infectious Random Walks [Citation Graph (, )][DBLP]


Search in 0.079secs, Finished in 0.084secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002