Irene Finocchi
Irene Finocchi
Professor of Computer Science, LUISS University, Rome, Italy
Geverifieerd e-mailadres voor
Geciteerd door
Geciteerd door
Handbook of graph theory
JL Gross, J Yellen
CRC press, 2003
Handbook of data structures and applications
DP Mehta, S Sahni
Taylor & Francis, 2018
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
Nemos: A framework for axiomatic and executable specifications of memory consistency models
Y Yang, G Gopalakrishnan, G Lindstrom, K Slind
18th International Parallel and Distributed Processing Symposium, 2004 …, 2004
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
Input-sensitive profiling
E Coppa, C Demetrescu, I Finocchi
ACM SIGPLAN Notices 47 (6), 89-98, 2012
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
An experimental analysis of simple, distributed vertex coloring algorithms
I Finocchi, A Panconesi, R Silvestri
Algorithmica 41 (1), 1-23, 2005
Combinatorial algorithms for feedback problems in directed graphs
C Demetrescu, I Finocchi
Information Processing Letters 86 (3), 129-136, 2003
Non-affine extensions to polyhedral code generation
A Venkat, M Shantharam, M Hall, MM Strout
Proceedings of Annual IEEE/ACM International Symposium on Code Generation …, 2014
Fine-grained interoperability through mirrors and contracts
KE Gray, RB Findler, M Flatt
ACM SIGPLAN Notices 40 (10), 231-245, 2005
Specifying algorithm visualizations: Interesting events or state mapping?
C Demetrescu, I Finocchi, JT Stasko
Software Visualization, 16-30, 2002
Resilient search trees
I Finocchi, F Grandoni, GF Italiano
SODA 2007 - 18th Annual ACM-SIAM Symposium on Discrete Algorithms, 547-553, 2007
A parallel algorithm for the maximal path problem
R Anderson
Combinatorica 7 (4), 315-326, 1987
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
Optimal resilient dynamic dictionaries
GS Brodal, R Fagerberg, I Finocchi, F Grandoni, GF Italiano, ...
European Symposium on Algorithms, 347-358, 2007
Mining hot calling contexts in small space
DC D'Elia, C Demetrescu, I Finocchi
ACM SIGPLAN Notices 46 (6), 516-527, 2011
Reactive imperative programming with dataflow constraints
C Demetrescu, I Finocchi, A Ribichini
ACM SIGPLAN Notices 46 (10), 407-426, 2011
Designing reliable algorithms in unreliable memories
I Finocchi, F Grandoni, GF Italiano
Computer Science Review 1 (2), 77-87, 2007
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
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20