| 2013 | ||
|---|---|---|
| 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) | |
| c37 | Giorgio Ausiello, Camil Demetrescu, Irene Finocchi, Donatella Firmani: k-Calling context profiling. OOPSLA 2012: 867-878 | |
| c36 | ||
| 2011 | ||
| j21 | Irene Finocchi, John Hershberger: Guest editors' foreword. ACM Journal of Experimental Algorithmics 16 (2011) | |
| c35 | Saverio Caminiti, Irene Finocchi, Emanuele G. Fusco, Francesco Silvestri: Dynamic programming in faulty memory hierarchies (cache-obliviously). FSTTCS 2011: 433-444 | |
| c34 | Camil Demetrescu, Irene Finocchi, Andrea Ribichini: Reactive imperative programming with dataflow constraints. OOPSLA 2011: 407-426 | |
| c33 | Daniele Cono D'Elia, Camil Demetrescu, Irene Finocchi: Mining hot calling contexts in small space. PLDI 2011: 516-527 | |
| c32 | 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 | ||
| c31 | Umberto Ferraro Petrillo, Irene Finocchi, Giuseppe F. Italiano: Experimental Study of Resilient Algorithms and Data Structures. SEA 2010: 1-12 | |
| 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 | Camil Demetrescu, Irene Finocchi, Andrea Ribichini: Trading off space for passes in graph streaming problems. ACM Transactions on Algorithms 6(1) (2009) | |
| j18 | Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano: Resilient dictionaries. ACM Transactions on Algorithms 6(1) (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) | |
| c30 | Saverio Caminiti, Irene Finocchi, Rossella Petreschi: Informative Labeling Schemes for the Least Common Ancestor Problem. ICTCS 2009: 66-70 | |
| e2 | Irene Finocchi, John Hershberger (Eds.): 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 | |
| 2008 | ||
| j16 | Irene Finocchi, Giuseppe F. Italiano: Sorting and Searching in Faulty Memories. Algorithmica 52(3): 309-332 (2008) | |
| c29 | Saverio Caminiti, Irene Finocchi, Rossella Petreschi: Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors. ESA 2008: 234-245 | |
| c28 | 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. Computer Science Review 1(2): 77-87 (2007) | |
| j14 | Saverio Caminiti, Irene Finocchi, Rossella Petreschi: On coding labeled trees. Theor. Comput. Sci. 382(2): 97-108 (2007) | |
| c27 | 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 | |
| c26 | ||
| 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 Distrib. Comput. 66(11): 1431-1441 (2006) | |
| c25 | Vincenzo Bonifaci, Camil Demetrescu, Irene Finocchi, Luigi Laura: Visual editing of animated algorithms: the Leonardo Web builder. AVI 2006: 476-479 | |
| c24 | Umberto Ferraro Petrillo, Irene Finocchi, Giuseppe F. Italiano: The Price of Resiliency: A Case Study on Sorting with Memory Faults. ESA 2006: 768-779 | |
| c23 | Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano: Optimal Resilient Sorting and Searching in the Presence of Memory Faults. ICALP (1) 2006: 286-298 | |
| c22 | Camil Demetrescu, Irene Finocchi, Andrea Ribichini: Trading off space for passes in graph streaming problems. SODA 2006: 714-723 | |
| c21 | Camil Demetrescu, Irene Finocchi: A data-driven graphical toolkit for software visualization. SOFTVIS 2006: 57-66 | |
| e1 | Tiziana Calamoneri, Irene Finocchi, Giuseppe F. Italiano (Eds.): 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 | |
| 2005 | ||
| j11 | Irene Finocchi, Rossella Petreschi: Structure-Preserving Hierarchical Decompositions. Theory Comput. Syst. 38(6): 687-700 (2005) | |
| c20 | Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano: Designing Reliable Algorithms in Unreliable Memories. ESA 2005: 1-8 | |
| c19 | Tiziana Calamoneri, Irene Finocchi, Rossella Petreschi: Graph Coloring with Distance Constraints. PDPTA 2005: 131-140 | |
| c18 | Vincenzo Bonifaci, Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Luigi Laura: Portraying Algorithms with Leonardo Web. WISE Workshops 2005: 73-83 | |
| 2004 | ||
| j10 | Irene Finocchi, Alessandro Panconesi, Riccardo Silvestri: An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms. Algorithmica 41(1): 1-23 (2004) | |
| j9 | Irene Finocchi, Rossella Petreschi: Divider-based algorithms for hierarchical tree partitioning. Discrete Applied Mathematics 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) | |
| c17 | Sajal K. Das, Irene Finocchi, Rossella Petreschi: Star-Coloring of Graphs for Conflict-Free Access to Parallel Memory Systems. IPDPS 2004 | |
| c16 | Saverio Caminiti, Irene Finocchi, Rossella Petreschi: A Unified Approach to Coding Labeled Trees. LATIN 2004: 339-348 | |
| c15 | Camil Demetrescu, Irene Finocchi: A portable virtual machine for program debugging and directing. SAC 2004: 1524-1530 | |
| c14 | Irene Finocchi, Giuseppe F. Italiano: Sorting and searching in the presence of memory faults (without redundancy). STOC 2004: 101-110 | |
| 2003 | ||
| j7 | Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano: Algorithm engineering, Algorithmics Column. Bulletin of the 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) | |
| c13 | Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano: Engineering and Visualizing Algorithms. Graph Drawing 2003: 509-513 | |
| 2002 | ||
| j5 | Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi: On max cut in cubic graphs. Parallel Algorithms Appl. 17(3): 165-183 (2002) | |
| c12 | 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. Electronic Notes in Discrete Mathematics 8: 38-41 (2001) | |
| j3 | Camil Demetrescu, Irene Finocchi: Rwmoving Cycles for Minimizing Crossings. ACM Journal of Experimental 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) | |
| c11 | Irene Finocchi, Rossella Petreschi: Hierarchical Clustering of Trees: Algorithms and Experiments. ALENEX 2001: 117-131 | |
| c10 | ||
| c9 | Irene Finocchi, Rossella Petreschi: On the Validity of Hierarchical Decompositions. COCOON 2001: 368-374 | |
| c8 | Camil Demetrescu, Irene Finocchi, John T. Stasko: Specifying Algorithm Visualizations: Interesting Events or State Mapping? Software Visualization 2001: 16-30 | |
| c7 | James Abello, Irene Finocchi, Jeffrey L. Korn: Visualization of State Transition Graphs Graph Sketches. INFOVIS 2001: 67- | |
| 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) | |
| c6 | Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Stefan Näher: Visualization in Algorithm Engineering: Tools and Techniques. Experimental Algorithmics 2000: 24-50 | |
| c5 | Camil Demetrescu, Irene Finocchi, Giuseppe Liotta: Visualizing Algorithms over the Web with the Publication-Driven Approach. Algorithm Engineering 2000: 147-158 | |
| 1999 | ||
| c4 | Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi: A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs. ASIAN 1999: 27-36 | |
| c3 | Camil Demetrescu, Giuseppe Di Battista, Irene Finocchi, Giuseppe Liotta, Maurizio Patrignani, Maurizio Pizzonia: Infinite Trees and the Future. Graph Drawing 1999: 379-391 | |
| c2 | Camil Demetrescu, Irene Finocchi: A Technique for Generating Graphical Abstractions of Program Data Structures. VISUAL 1999: 785-792 | |
| c1 | Camil Demetrescu, Irene Finocchi: Smooth Animation of Algorithms in a Declarative Framework. VL 1999: 280-287 | |
Colors in the list of coauthors
Last update Fri May 24 03:02:58 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page