default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIrene Finocchi
Person information
- affiliation: Luiss Guido Carli University, Rome, Italy
- affiliation (former): Sapienza University of Rome, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j36]Irene Finocchi
, Renan Leon Garcia, Blerina Sinaimeri:
From Stars to Diamonds: Counting and Listing Almost Complete Subgraphs in Large Networks. Comput. J. 67(6): 2151-2161 (2024)- 2023
- [j35]Irene Finocchi, Andrea Ribichini, Marco Schaerf:
An analysis of international mobility and research productivity in computer science. Scientometrics 128(11): 6147-6175 (2023) - [c44]Marco D'Elia, Irene Finocchi, Maurizio Patrignani:
Clique-TF-IDF: A New Partitioning Framework Based on Dense Substructures. AI*IA 2023: 396-410 - 2022
- [j34]Camil Demetrescu, Irene Finocchi, Andrea Ribichini, Marco Schaerf:
Which Conference Is That? A Case Study in Computer Science. ACM J. Data Inf. Qual. 14(3): 18:1-18:13 (2022) - [j33]Camil Demetrescu, Irene Finocchi, Andrea Ribichini, Marco Schaerf:
On computer science research and its temporal evolution. Scientometrics 127(8): 4913-4938 (2022) - 2020
- [j32]Camil Demetrescu, Irene Finocchi, Andrea Ribichini, Marco Schaerf:
On bibliometrics in academic promotions: a case study in computer science and engineering in Italy. Scientometrics 124(3): 2207-2228 (2020) - [e5]Guy E. Blelloch, Irene Finocchi:
Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020. SIAM 2020, ISBN 978-1-61197-600-7 [contents]
2010 – 2019
- 2019
- [j31]Emilio Coppa, Irene Finocchi, Renan Leon Garcia:
Counting cliques in parallel without a cluster: Engineering a fork/join algorithm for shared-memory platforms. Inf. Sci. 496: 553-571 (2019) - [c43]Stefano Faralli, Irene Finocchi, Simone Paolo Ponzetto, Paola Velardi:
WebIsAGraph: A Very Large Hypernymy Graph from a Web Corpus. CLiC-it 2019 - [e4]Antony L. Hosking, Irene Finocchi:
Proceedings of the 16th ACM SIGPLAN International Conference on Managed Programming Languages and Runtimes, MPLR 2019, Athens, Greece, October 21-22, 2019. ACM 2019, ISBN 978-1-4503-6977-0 [contents] - 2018
- [j30]Roberto Baldoni, Emilio Coppa, Daniele Cono D'Elia, Camil Demetrescu, Irene Finocchi:
A Survey of Symbolic Execution Techniques. ACM Comput. Surv. 51(3): 50:1-50:39 (2018) - [j29]Stefano Faralli, Irene Finocchi, Simone Paolo Ponzetto, Paola Velardi:
CrumbTrail: An efficient methodology to reduce multiple inheritance in knowledge graphs. Knowl. Based Syst. 151: 180-197 (2018) - [c42]Stefano Faralli, Irene Finocchi, Simone Paolo Ponzetto, Paola Velardi:
Efficient Pruning of Large Knowledge Graphs. IJCAI 2018: 4055-4063 - 2017
- [j28]Saverio Caminiti, Irene Finocchi, Emanuele G. Fusco, Francesco Silvestri:
Resilient Dynamic Programming. Algorithmica 77(2): 389-425 (2017) - [j27]Nikhil Bansal, Irene Finocchi:
Guest Editors' Foreword. Algorithmica 78(4): 1107-1108 (2017) - 2016
- [j26]Daniele Cono D'Elia, Camil Demetrescu, Irene Finocchi:
Mining hot calling contexts in small space. Softw. Pract. Exp. 46(8): 1131-1152 (2016) - [i8]Roberto Baldoni, Emilio Coppa, Daniele Cono D'Elia, Camil Demetrescu, Irene Finocchi:
A Survey of Symbolic Execution Techniques. CoRR abs/1610.00502 (2016) - 2015
- [j25]Irene Finocchi, Marco Finocchi, Emanuele G. Fusco:
Clique Counting in MapReduce: Algorithms and Experiments. ACM J. Exp. Algorithmics 20: 1.7:1-1.7:20 (2015) - [c41]Emilio Coppa, Irene Finocchi:
On data skewness, stragglers, and MapReduce progress indicators. SoCC 2015: 139-152 - [e3]Nikhil Bansal, Irene Finocchi:
Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings. Lecture Notes in Computer Science 9294, Springer 2015, ISBN 978-3-662-48349-7 [contents] - [i7]Emilio Coppa, Irene Finocchi:
On data skewness, stragglers, and MapReduce progress indicators. CoRR abs/1503.09062 (2015) - [i6]Ulrik Brandes, Irene Finocchi, Martin Nöllenburg, Aaron J. Quigley:
Empirical Evaluation for Graph Drawing (Dagstuhl Seminar 15052). Dagstuhl Reports 5(1): 243-258 (2015) - 2014
- [j24]Camil Demetrescu, Irene Finocchi, Andrea Ribichini:
Reactive Imperative Programming with Dataflow Constraints. ACM Trans. Program. Lang. Syst. 37(1): 3:1-3:53 (2014) - [j23]Emilio Coppa, Camil Demetrescu, Irene Finocchi:
Input-Sensitive Profiling. IEEE Trans. Software Eng. 40(12): 1185-1205 (2014) - [c40]Emilio Coppa, Camil Demetrescu, Irene Finocchi, Romolo Marotta:
Estimating the Empirical Cost Function of Routines with Dynamic Workloads. CGO 2014: 230 - [i5]Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Luigi Laura:
Experimental Evaluation of Algorithms for the Food-Selection Problem. CoRR abs/1401.7591 (2014) - [i4]Irene Finocchi, Marco Finocchi, Emanuele G. Fusco:
Counting small cliques in MapReduce. CoRR abs/1403.0734 (2014) - 2013
- [c39]Irene Finocchi:
Software Streams: Big Data Challenges in Dynamic Program Analysis. CiE 2013: 124-134 - [i3]Emilio Coppa, Camil Demetrescu, Irene Finocchi, Romolo Marotta:
Multithreaded Input-Sensitive Profiling. CoRR abs/1304.3804 (2013) - [i2]Daniele Cono D'Elia, Camil Demetrescu, Irene Finocchi:
Ball-Larus Path Profiling Across Multiple Loop iterations. CoRR abs/1304.5197 (2013) - 2012
- [j22]Tiziana Calamoneri, Irene Finocchi:
Editorial: Preface to the special issue. Networks 59(3): 265-266 (2012) - [c38]Giorgio Ausiello, Camil Demetrescu, Irene Finocchi, Donatella Firmani:
k-Calling context profiling. OOPSLA 2012: 867-878 - [c37]Emilio Coppa, Camil Demetrescu, Irene Finocchi:
Input-sensitive profiling. PLDI 2012: 89-98 - 2011
- [j21]Irene Finocchi, John Hershberger:
Guest editors' foreword. ACM J. Exp. Algorithmics 16 (2011) - [c36]Saverio Caminiti, Irene Finocchi, Emanuele G. Fusco, Francesco Silvestri:
Dynamic programming in faulty memory hierarchies (cache-obliviously). FSTTCS 2011: 433-444 - [c35]Camil Demetrescu, Irene Finocchi, Andrea Ribichini:
Reactive imperative programming with dataflow constraints. OOPSLA 2011: 407-426 - [c34]Daniele Cono D'Elia, Camil Demetrescu, Irene Finocchi:
Mining hot calling contexts in small space. PLDI 2011: 516-527 - [c33]Saverio Caminiti, Irene Finocchi, Emanuele G. Fusco:
Local dependency dynamic programming in the presence of memory faults. STACS 2011: 45-56 - [i1]Camil Demetrescu, Irene Finocchi, Andrea Ribichini:
Reactive Imperative Programming with Dataflow Constraints. CoRR abs/1104.2293 (2011) - 2010
- [c32]Umberto Ferraro Petrillo, Irene Finocchi, Giuseppe F. Italiano:
Experimental Study of Resilient Algorithms and Data Structures. SEA 2010: 1-12
2000 – 2009
- 2009
- [j20]Umberto Ferraro Petrillo, Irene Finocchi, Giuseppe F. Italiano:
The Price of Resiliency: a Case Study on Sorting with Memory Faults. Algorithmica 53(4): 597-620 (2009) - [j19]Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano:
Resilient dictionaries. ACM Trans. Algorithms 6(1): 1:1-1:19 (2009) - [j18]Camil Demetrescu, Irene Finocchi, Andrea Ribichini:
Trading off space for passes in graph streaming problems. ACM Trans. Algorithms 6(1): 6:1-6:17 (2009) - [j17]Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano:
Optimal resilient sorting and searching in the presence of memory faults. Theor. Comput. Sci. 410(44): 4457-4470 (2009) - [c31]Saverio Caminiti, Irene Finocchi, Rossella Petreschi:
Informative Labeling Schemes for the Least Common Ancestor Problem. ICTCS 2009: 66-70 - [e2]Irene Finocchi, John Hershberger:
Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, ALENEX 2009, New York, New York, USA, January 3, 2009. SIAM 2009, ISBN 978-0-898719-30-7 [contents] - 2008
- [j16]Irene Finocchi, Giuseppe F. Italiano:
Sorting and Searching in Faulty Memories. Algorithmica 52(3): 309-332 (2008) - [c30]Saverio Caminiti, Irene Finocchi, Rossella Petreschi:
Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors. ESA 2008: 234-245 - [c29]Irene Finocchi, Emanuele G. Fusco, Rossella Petreschi:
A Note on Algebraic Hypercube Colorings. ITNG 2008: 869-874 - 2007
- [j15]Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano:
Designing reliable algorithms in unreliable memories. Comput. Sci. Rev. 1(2): 77-87 (2007) - [j14]Saverio Caminiti, Irene Finocchi, Rossella Petreschi:
On coding labeled trees. Theor. Comput. Sci. 382(2): 97-108 (2007) - [c28]Gerth Stølting Brodal, Rolf Fagerberg, Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano, Allan Grønlund Jørgensen, Gabriel Moruz, Thomas Mølhave:
Optimal Resilient Dynamic Dictionaries. ESA 2007: 347-358 - [c27]Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano:
Resilient search trees. SODA 2007: 547-553 - 2006
- [j13]Irene Finocchi:
Crossing-constrained hierarchical drawings. J. Discrete Algorithms 4(2): 299-312 (2006) - [j12]Sajal K. Das, Irene Finocchi, Rossella Petreschi:
Conflict-free star-access in parallel memory systems. J. Parallel Distributed Comput. 66(11): 1431-1441 (2006) - [c26]Vincenzo Bonifaci, Camil Demetrescu, Irene Finocchi, Luigi Laura:
Visual editing of animated algorithms: the Leonardo Web builder. AVI 2006: 476-479 - [c25]Umberto Ferraro Petrillo, Irene Finocchi, Giuseppe F. Italiano:
The Price of Resiliency: A Case Study on Sorting with Memory Faults. ESA 2006: 768-779 - [c24]Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano:
Optimal Resilient Sorting and Searching in the Presence of Memory Faults. ICALP (1) 2006: 286-298 - [c23]Camil Demetrescu, Irene Finocchi, Andrea Ribichini:
Trading off space for passes in graph streaming problems. SODA 2006: 714-723 - [c22]Camil Demetrescu, Irene Finocchi:
A data-driven graphical toolkit for software visualization. SOFTVIS 2006: 57-66 - [e1]Tiziana Calamoneri, Irene Finocchi, Giuseppe F. Italiano:
Algorithms and Complexity, 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings. Lecture Notes in Computer Science 3998, Springer 2006, ISBN 3-540-34375-X [contents] - 2005
- [j11]Irene Finocchi, Alessandro Panconesi, Riccardo Silvestri:
An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms. Algorithmica 41(1): 1-23 (2005) - [j10]Irene Finocchi, Rossella Petreschi:
Structure-Preserving Hierarchical Decompositions. Theory Comput. Syst. 38(6): 687-700 (2005) - [c21]Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano:
Designing Reliable Algorithms in Unreliable Memories. ESA 2005: 1-8 - [c20]Tiziana Calamoneri, Irene Finocchi, Rossella Petreschi:
Graph Coloring with Distance Constraints. PDPTA 2005: 131-140 - [c19]Vincenzo Bonifaci, Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Luigi Laura:
Portraying Algorithms with Leonardo Web. WISE Workshops 2005: 73-83 - 2004
- [j9]Irene Finocchi, Rossella Petreschi:
Divider-based algorithms for hierarchical tree partitioning. Discret. Appl. Math. 136(2-3): 227-247 (2004) - [j8]Vincenzo Bonifaci, Camil Demetrescu, Irene Finocchi, Luigi Laura:
A Java-based system for building animated presentations over the Web. Sci. Comput. Program. 53(1): 37-49 (2004) - [c18]Sajal K. Das, Irene Finocchi, Rossella Petreschi:
Star-Coloring of Graphs for Conflict-Free Access to Parallel Memory Systems. IPDPS 2004 - [c17]Saverio Caminiti, Irene Finocchi, Rossella Petreschi:
A Unified Approach to Coding Labeled Trees. LATIN 2004: 339-348 - [c16]Camil Demetrescu, Irene Finocchi:
A portable virtual machine for program debugging and directing. SAC 2004: 1524-1530 - [c15]Irene Finocchi, Giuseppe F. Italiano:
Sorting and searching in the presence of memory faults (without redundancy). STOC 2004: 101-110 - [r2]Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano:
Dynamic Trees. Handbook of Data Structures and Applications 2004 - [r1]Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano:
Dynamic Graphs. Handbook of Data Structures and Applications 2004 - 2003
- [j7]Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano:
Algorithm engineering, Algorithmics Column. Bull. EATCS 79: 48-63 (2003) - [j6]Camil Demetrescu, Irene Finocchi:
Combinatorial algorithms for feedback problems in directed graphs. Inf. Process. Lett. 86(3): 129-136 (2003) - [c14]Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano:
Engineering and Visualizing Algorithms. GD 2003: 509-513 - [p1]Harold N. Gabow, Camil Demetrescu, Irene Finocchi, Giuseppe Francesco Italiano, Giuseppe Liotta, Roberto Tamassia, Richard B. Borie, R. Gary Parker, Craig A. Tovey:
Graphs in Computer Science. Handbook of Graph Theory 2003: 952-1073 - 2002
- [j5]Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi:
On max cut in cubic graphs. Parallel Algorithms Appl. 17(3): 165-183 (2002) - [c13]Irene Finocchi, Alessandro Panconesi, Riccardo Silvestri:
Experimental analysis of simple, distributed vertex coloring algorithms. SODA 2002: 606-615 - 2001
- [j4]Irene Finocchi, Rossella Petreschi:
Tree partitioning via vertex deletion. Electron. Notes Discret. Math. 8: 38-41 (2001) - [j3]Camil Demetrescu, Irene Finocchi:
Removing Cycles for Minimizing Crossings. ACM J. Exp. Algorithmics 6: 2 (2001) - [j2]Camil Demetrescu, Irene Finocchi:
Smooth Animation of Algorithms in a Declarative Framework. J. Vis. Lang. Comput. 12(3): 253-281 (2001) - [c12]Irene Finocchi, Rossella Petreschi:
Hierarchical Clustering of Trees: Algorithms and Experiments. ALENEX 2001: 117-131 - [c11]Irene Finocchi:
Layered Drawings of Graphs with Crossing Constraints. COCOON 2001: 357-367 - [c10]Irene Finocchi, Rossella Petreschi:
On the Validity of Hierarchical Decompositions. COCOON 2001: 368-374 - [c9]Camil Demetrescu, Irene Finocchi, John T. Stasko:
Specifying Algorithm Visualizations: Interesting Events or State Mapping? Software Visualization 2001: 16-30 - [c8]James Abello, Irene Finocchi, Jeffrey L. Korn:
Graph Sketches. INFOVIS 2001: 67-72 - 2000
- [j1]Pierluigi Crescenzi, Camil Demetrescu, Irene Finocchi, Rossella Petreschi:
Reversible Execution and Visualization of Programs with LEONARDO. J. Vis. Lang. Comput. 11(2): 125-150 (2000) - [c7]Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Stefan Näher:
Visualization in Algorithm Engineering: Tools and Techniques. Experimental Algorithmics 2000: 24-50 - [c6]Camil Demetrescu, Irene Finocchi, Giuseppe Liotta:
Visualizing Algorithms over the Web with the Publication-Driven Approach. WAE 2000: 147-158
1990 – 1999
- 1999
- [c5]Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi:
A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs. ASIAN 1999: 27-36 - [c4]Camil Demetrescu, Giuseppe Di Battista, Irene Finocchi, Giuseppe Liotta, Maurizio Patrignani, Maurizio Pizzonia:
Infinite Trees and the Future. GD 1999: 379-391 - [c3]Camil Demetrescu, Irene Finocchi:
A Technique for Generating Graphical Abstractions of Program Data Structures. VISUAL 1999: 785-792 - [c2]Camil Demetrescu, Irene Finocchi:
Smooth Animation of Algorithms in a Declarative Framework. VL 1999: 280-287 - 1997
- [c1]Pierluigi Crescenzi, Camil Demetrescu, Irene Finocchi, Rossella Petreschi:
LEONARDO: a software visualization system. WAE 1997: 146-155
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
