activity
20112016
most citedClique counting in MapReduce: theory and experiments

28 citations · 32 across the 4 of their papers we have counts for

collaborators

7 papers

cs.SE2016

A Survey of Symbolic Execution Techniques

Roberto Baldoni, Emilio Coppa, Daniele Cono D'Elia +2

Many security and software testing applications require checking whether certain properties of a program hold for any possible usage scenario. For instance, a tool for identifying…

cs.DC2015★ 1 cited

On data skewness, stragglers, and MapReduce progress indicators

Emilio Coppa, Irene Finocchi

We tackle the problem of predicting the performance of MapReduce applications, designing accurate progress indicators that keep programmers informed on the percentage of completed…

cs.DC2014★ 28 cited

Clique counting in MapReduce: theory and experiments

Irene Finocchi, Marco Finocchi, Emanuele G. Fusco

We tackle the problem of counting the number of -cliques in large-scale graphs, for any constant . Clique counting is essential in a variety of applications, among whic…

cs.DS2014

Experimental Evaluation of Algorithms for the Food-Selection Problem

Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano +1

In this paper, we describe the result of our experiments on Algorithms for the Food-Selection Problem, which is the fundamental problem first stated and addressed in the seminal pa…

cs.PL2013

Ball-Larus Path Profiling Across Multiple Loop iterations

Daniele Cono D'Elia, Camil Demetrescu, Irene Finocchi

Identifying the hottest paths in the control flow graph of a routine can direct optimizations to portions of the code where most resources are consumed. This powerful methodology,…

cs.PF2013★ 3 cited

Multithreaded Input-Sensitive Profiling

Emilio Coppa, Camil Demetrescu, Irene Finocchi +1

Input-sensitive profiling is a recent performance analysis technique that makes it possible to estimate the empirical cost function of individual routines of a program, helping dev…