팔로우
Irene Finocchi
Irene Finocchi
Professor of Computer Science, LUISS University, Rome, Italy
luiss.it의 이메일 확인됨
제목
인용
인용
연도
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
10102018
Handbook of data structures and applications
DP Mehta, S Sahni
Chapman and Hall/CRC, 2004
3562004
Input-sensitive profiling
E Coppa, C Demetrescu, I Finocchi
ACM SIGPLAN Notices 47 (6), 89-98, 2012
1312012
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
1282009
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
982000
Combinatorial algorithms for feedback problems in directed graphs
C Demetrescu, I Finocchi
Information Processing Letters 86 (3), 129-136, 2003
922003
An experimental analysis of simple, distributed vertex coloring algorithms
I Finocchi, A Panconesi, R Silvestri
Algorithmica 41 (1), 1-23, 2005
892005
Specifying algorithm visualizations: Interesting events or state mapping?
C Demetrescu, I Finocchi, JT Stasko
Software Visualization: International Seminar Dagstuhl Castle, Germany, May …, 2002
772002
Clique counting in mapreduce: Algorithms and experiments
I Finocchi, M Finocchi, EG Fusco
Journal of Experimental Algorithmics (JEA) 20, 1-20, 2015
612015
Resilient search trees
I Finocchi, F Grandoni, GF Italiano
SODA 2007 - 18th Annual ACM-SIAM Symposium on Discrete Algorithms, 547-553, 2007
532007
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
532004
Reactive imperative programming with dataflow constraints
C Demetrescu, I Finocchi, A Ribichini
ACM SIGPLAN Notices 46 (10), 407-426, 2011
522011
Optimal resilient dynamic dictionaries
GS Brodal, R Fagerberg, I Finocchi, F Grandoni, GF Italiano, ...
European Symposium on Algorithms, 347-358, 2007
502007
On coding labeled trees
S Caminiti, I Finocchi, R Petreschi
Theoretical computer science 382 (2), 97-108, 2007
472007
Sorting and searching in faulty memories
I Finocchi, GF Italiano
Algorithmica 52 (3), 309-332, 2008
442008
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
432009
On data skewness, stragglers, and mapreduce progress indicators
E Coppa, I Finocchi
Proceedings of the Sixth ACM Symposium on Cloud Computing, 139-152, 2015
422015
Designing reliable algorithms in unreliable memories
I Finocchi, F Grandoni, GF Italiano
Computer Science Review 1 (2), 77-87, 2007
422007
The price of resiliency: a case study on sorting with memory faults
U Ferraro-Petrillo, I Finocchi, G Italiano
Algorithms–ESA 2006, 768-779, 2006
412006
Algoritmi e strutture dati
C Demetrescu, I Finocchi, GF Italiano
McGraw-Hill, 2004
412004
현재 시스템이 작동되지 않습니다. 나중에 다시 시도해 주세요.
학술자료 1–20