Irene Finocchi

Orcid: 0000-0002-6394-6798

Affiliations:
  • Luiss Guido Carli University, Rome, Italy
  • Sapienza University of Rome, Italy (former)


According to our database1, Irene Finocchi authored at least 80 papers between 1997 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
From Stars to Diamonds: Counting and Listing Almost Complete Subgraphs in Large Networks.
Comput. J., 2024

2023
An analysis of international mobility and research productivity in computer science.
Scientometrics, November, 2023

Clique-TF-IDF: A New Partitioning Framework Based on Dense Substructures.
Proceedings of the AIxIA 2023 - Advances in Artificial Intelligence, 2023

2022
On computer science research and its temporal evolution.
Scientometrics, 2022

Which Conference Is That? A Case Study in Computer Science.
ACM J. Data Inf. Qual., 2022

2020
On bibliometrics in academic promotions: a case study in computer science and engineering in Italy.
Scientometrics, 2020

2019
Counting cliques in parallel without a cluster: Engineering a fork/join algorithm for shared-memory platforms.
Inf. Sci., 2019

WebIsAGraph: A Very Large Hypernymy Graph from a Web Corpus.
Proceedings of the Sixth Italian Conference on Computational Linguistics, 2019

2018
CrumbTrail: An efficient methodology to reduce multiple inheritance in knowledge graphs.
Knowl. Based Syst., 2018

A Survey of Symbolic Execution Techniques.
ACM Comput. Surv., 2018

Efficient Pruning of Large Knowledge Graphs.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017
Resilient Dynamic Programming.
Algorithmica, 2017

Guest Editors' Foreword.
Algorithmica, 2017

2016
Mining hot calling contexts in small space.
Softw. Pract. Exp., 2016

2015
Clique Counting in MapReduce: Algorithms and Experiments.
ACM J. Exp. Algorithmics, 2015

Empirical Evaluation for Graph Drawing (Dagstuhl Seminar 15052).
Dagstuhl Reports, 2015

On data skewness, stragglers, and MapReduce progress indicators.
Proceedings of the Sixth ACM Symposium on Cloud Computing, 2015

2014
Input-Sensitive Profiling.
IEEE Trans. Software Eng., 2014

Reactive Imperative Programming with Dataflow Constraints.
ACM Trans. Program. Lang. Syst., 2014

Counting small cliques in MapReduce.
CoRR, 2014

Experimental Evaluation of Algorithms for the Food-Selection Problem.
CoRR, 2014

Estimating the Empirical Cost Function of Routines with Dynamic Workloads.
Proceedings of the 12th Annual IEEE/ACM International Symposium on Code Generation and Optimization, 2014

2013
Ball-Larus Path Profiling Across Multiple Loop iterations
CoRR, 2013

Multithreaded Input-Sensitive Profiling
CoRR, 2013

Software Streams: Big Data Challenges in Dynamic Program Analysis.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012
Editorial: Preface to the special issue.
Networks, 2012

k-Calling context profiling.
Proceedings of the 27th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2012

2011
Guest editors' foreword.
ACM J. Exp. Algorithmics, 2011

Local dependency dynamic programming in the presence of memory faults.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

Dynamic programming in faulty memory hierarchies (cache-obliviously).
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

2010
Experimental Study of Resilient Algorithms and Data Structures.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

2009
Optimal resilient sorting and searching in the presence of memory faults.
Theor. Comput. Sci., 2009

Resilient dictionaries.
ACM Trans. Algorithms, 2009

Trading off space for passes in graph streaming problems.
ACM Trans. Algorithms, 2009

The Price of Resiliency: a Case Study on Sorting with Memory Faults.
Algorithmica, 2009

Informative Labeling Schemes for the Least Common Ancestor Problem.
Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

2008
Sorting and Searching in Faulty Memories.
Algorithmica, 2008

A Note on Algebraic Hypercube Colorings.
Proceedings of the Fifth International Conference on Information Technology: New Generations (ITNG 2008), 2008

Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors.
Proceedings of the Algorithms, 2008

2007
On coding labeled trees.
Theor. Comput. Sci., 2007

Designing reliable algorithms in unreliable memories.
Comput. Sci. Rev., 2007

Resilient search trees.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007


2006
Conflict-free star-access in parallel memory systems.
J. Parallel Distributed Comput., 2006

Crossing-constrained hierarchical drawings.
J. Discrete Algorithms, 2006

A data-driven graphical toolkit for software visualization.
Proceedings of the ACM 2006 Symposium on Software Visualization, 2006

Visual editing of animated algorithms: the Leonardo Web builder.
Proceedings of the working conference on Advanced visual interfaces, 2006

2005
Structure-Preserving Hierarchical Decompositions.
Theory Comput. Syst., 2005

An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms.
Algorithmica, 2005

Portraying Algorithms with Leonardo Web.
Proceedings of the Web Information Systems Engineering - WISE 2005 Workshops, 2005

Graph Coloring with Distance Constraints.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2005

2004
Dynamic Graphs.
Proceedings of the Handbook of Data Structures and Applications., 2004

Dynamic Trees.
Proceedings of the Handbook of Data Structures and Applications., 2004

A Java-based system for building animated presentations over the Web.
Sci. Comput. Program., 2004

Divider-based algorithms for hierarchical tree partitioning.
Discret. Appl. Math., 2004

Sorting and searching in the presence of memory faults (without redundancy).
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

A portable virtual machine for program debugging and directing.
Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), 2004

A Unified Approach to Coding Labeled Trees.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Star-Coloring of Graphs for Conflict-Free Access to Parallel Memory Systems.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

2003
Combinatorial algorithms for feedback problems in directed graphs.
Inf. Process. Lett., 2003

Algorithm engineering, Algorithmics Column.
Bull. EATCS, 2003

Engineering and Visualizing Algorithms.
Proceedings of the Graph Drawing, 11th International Symposium, 2003


2002
On max cut in cubic graphs.
Parallel Algorithms Appl., 2002

Experimental analysis of simple, distributed vertex coloring algorithms.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001
Smooth Animation of Algorithms in a Declarative Framework.
J. Vis. Lang. Comput., 2001

Removing Cycles for Minimizing Crossings.
ACM J. Exp. Algorithmics, 2001

Tree partitioning via vertex deletion.
Electron. Notes Discret. Math., 2001

Graph Sketches.
Proceedings of the IEEE Symposium on Information Visualization 2001 (INFOVIS'01), 2001

Specifying Algorithm Visualizations: Interesting Events or State Mapping?
Proceedings of the Software Visualization, 2001

On the Validity of Hierarchical Decompositions.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

Layered Drawings of Graphs with Crossing Constraints.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

Hierarchical Clustering of Trees: Algorithms and Experiments.
Proceedings of the Algorithm Engineering and Experimentation, Third International Workshop, 2001

2000
Reversible Execution and Visualization of Programs with LEONARDO.
J. Vis. Lang. Comput., 2000

Visualizing Algorithms over the Web with the Publication-Driven Approach.
Proceedings of the Algorithm Engineering, 2000

Visualization in Algorithm Engineering: Tools and Techniques.
Proceedings of the Experimental Algorithmics, 2000

1999
A Technique for Generating Graphical Abstractions of Program Data Structures.
Proceedings of the Visual Information and Information Systems, 1999

Infinite Trees and the Future.
Proceedings of the Graph Drawing, 7th International Symposium, 1999

A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs.
Proceedings of the Advances in Computing Science, 1999

1997
LEONARDO: a software visualization system.
Proceedings of the Workshop on Algorithm Engineering, 1997


  Loading...