Volgen
Irene Finocchi
Irene Finocchi
Professor of Computer Science, LUISS University, Rome, Italy
Geverifieerd e-mailadres voor luiss.it
Titel
Geciteerd door
Geciteerd door
Jaar
A survey of symbolic execution techniques
R Baldoni, E Coppa, DC D’elia, C Demetrescu, I Finocchi
ACM Computing Surveys (CSUR) 51 (3), 1-39, 2018
4242018
Handbook of data structures and applications
DP Mehta, S Sahni
Chapman and Hall/CRC, 2004
3122004
Trading off space for passes in graph streaming problems
C Demetrescu, I Finocchi, A Ribichini
ACM Transactions on Algorithms (TALG) 6 (1), 1-17, 2009
1172009
Input-sensitive profiling
E Coppa, C Demetrescu, I Finocchi
ACM SIGPLAN Notices 47 (6), 89-98, 2012
1112012
Reversible execution and visualization of programs with Leonardo
P Crescenzi, C Demetrescu, I Finocchi, R Petreschi
Journal of Visual Languages & Computing 11 (2), 125-150, 2000
922000
An experimental analysis of simple, distributed vertex coloring algorithms
I Finocchi, A Panconesi, R Silvestri
Algorithmica 41 (1), 1-23, 2005
902005
Combinatorial algorithms for feedback problems in directed graphs
C Demetrescu, I Finocchi
Information Processing Letters 86 (3), 129-136, 2003
842003
Specifying algorithm visualizations: Interesting events or state mapping?
C Demetrescu, I Finocchi, JT Stasko
Software Visualization, 16-30, 2002
712002
Resilient search trees
I Finocchi, F Grandoni, GF Italiano
SODA 2007 - 18th Annual ACM-SIAM Symposium on Discrete Algorithms, 547-553, 2007
502007
Optimal resilient dynamic dictionaries
GS Brodal, R Fagerberg, I Finocchi, F Grandoni, GF Italiano, ...
European Symposium on Algorithms, 347-358, 2007
472007
Sorting and searching in the presence of memory faults (without redundancy)
I Finocchi, GF Italiano
STOC 2004 - 36-th Annual ACM Symposium on Theory of Computing, 101-110, 2004
472004
Mining hot calling contexts in small space
DC D'Elia, C Demetrescu, I Finocchi
ACM SIGPLAN Notices 46 (6), 516-527, 2011
46*2011
Clique counting in mapreduce: Algorithms and experiments
I Finocchi, M Finocchi, EG Fusco
Journal of Experimental Algorithmics (JEA) 20, 1-20, 2015
45*2015
Sorting and searching in faulty memories
I Finocchi, GF Italiano
Algorithmica 52 (3), 309-332, 2008
442008
Reactive imperative programming with dataflow constraints
C Demetrescu, I Finocchi, A Ribichini
ACM SIGPLAN Notices 46 (10), 407-426, 2011
422011
On data skewness, stragglers, and MapReduce progress indicators
E Coppa, I Finocchi
Proceedings of the Sixth ACM Symposium on Cloud Computing, 139-152, 2015
412015
Optimal resilient sorting and searching in the presence of memory faults
I Finocchi, F Grandoni, GF Italiano
Theoretical Computer Science 410 (44), 4457-4470, 2009
412009
Designing reliable algorithms in unreliable memories
I Finocchi, F Grandoni, GF Italiano
Computer Science Review 1 (2), 77-87, 2007
412007
The price of resiliency: a case study on sorting with memory faults
U Ferraro-Petrillo, I Finocchi, GF Italiano
European Symposium on Algorithms, 768-779, 2006
392006
Algoritmi e strutture dati
C Demetrescu, I Finocchi, GF Italiano
McGraw-Hill, 2004
392004
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20