( en | de | ru )

 

Disambiguation of "Pietracaprina, Andrea"

Author of the publication

copydeleteadd this publication to your clipboard
Mining Frequent Itemsets using Patricia Tries.

, and . FIMI, volume 90 of CEUR Workshop Proceedings, CEUR-WS.org, (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Andrea Witzenrath

Risikofaktoren für abdominelle Komplikationen nach kardiopulmonalem Bypass. Uni Erlangen-Nürnberg, (2009)

Andrea Rottach

Analysis of the cell cycle dependent dynamics of Dnmt1 and Np95 in living cells. Uni München, (2009)

Andrea Hruby

Die MAPKKK Bck1p des Zellwand-Integritätssignalwegs in der Bäckerhefe Saccharomyces cerevisiae. Uni Münster, (2009)

Michaela Andrea Fingas

Resultate nach radikaler Prostatektomie bei Patienten mit einem Prostatakarzinom Gleason 7-10. Uni Marburg, (2009)

Andrea Wätzig

 

Other publications of authors with the same name

Topic 13: Theory and Algorithms for Parallel Computation., , , and . Euro-Par, volume 3149 of Lecture Notes in Computer Science, page 803. Springer, (2004)Efficient Incremental Mining of Top-K Frequent Closed Itemsets., and . Discovery Science, volume 4755 of Lecture Notes in Computer Science, page 275-280. Springer, (2007)Implementing Shared Memory on Mesh-Connected Computers and on the Fat-Tree., , and . Inf. Comput., 165 (2): 123-143 (2001)Mining Frequent Itemsets using Patricia Tries., and . FIMI, volume 90 of CEUR Workshop Proceedings, CEUR-WS.org, (2003)Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation., , , and . SPAA, page 182-191. ACM, (2015)Tight bounds on information dissemination in sparse mobile networks., , , and . PODC, page 355-362. ACM, (2011)Cache-oblivious simulation of parallel programs., , and . IPDPS, IEEE, (2006)Optimal Many-to-One Routing on the Mesh with Constant Queues., and . Euro-Par, volume 2150 of Lecture Notes in Computer Science, page 645-650. Springer, (2001)Fast and Accurate Fair k-Center Clustering in Doubling Metrics., , and . WWW, page 756-767. ACM, (2024)An efficient rigorous approach for identifying statistically significant frequent itemsets., , , , , and . PODS, page 117-126. ACM, (2009)