The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Irene Finocchi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Irene Finocchi, Rossella Petreschi
    Hierarchical Clustering of Trees: Algorithms and Experiments. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2001, pp:117-131 [Conf]
  2. Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi
    A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    ASIAN, 1999, pp:27-36 [Conf]
  3. Vincenzo Bonifaci, Camil Demetrescu, Irene Finocchi, Luigi Laura
    Visual editing of animated algorithms: the Leonardo Web builder. [Citation Graph (0, 0)][DBLP]
    AVI, 2006, pp:476-479 [Conf]
  4. Irene Finocchi
    Layered Drawings of Graphs with Crossing Constraints. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:357-367 [Conf]
  5. Irene Finocchi, Rossella Petreschi
    On the Validity of Hierarchical Decompositions. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:368-374 [Conf]
  6. Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Stefan Näher
    Visualization in Algorithm Engineering: Tools and Techniques. [Citation Graph (0, 0)][DBLP]
    Experimental Algorithmics, 2000, pp:24-50 [Conf]
  7. Camil Demetrescu, Irene Finocchi, John T. Stasko
    Specifying Algorithm Visualizations: Interesting Events or State Mapping? [Citation Graph (0, 0)][DBLP]
    Software Visualization, 2001, pp:16-30 [Conf]
  8. Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano
    Designing Reliable Algorithms in Unreliable Memories. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:1-8 [Conf]
  9. Umberto Ferraro Petrillo, Irene Finocchi, Giuseppe F. Italiano
    The Price of Resiliency: A Case Study on Sorting with Memory Faults. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:768-779 [Conf]
  10. Camil Demetrescu, Giuseppe Di Battista, Irene Finocchi, Giuseppe Liotta, Maurizio Patrignani, Maurizio Pizzonia
    Infinite Trees and the Future. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1999, pp:379-391 [Conf]
  11. Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano
    Engineering and Visualizing Algorithms. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2003, pp:509-513 [Conf]
  12. Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano
    Optimal Resilient Sorting and Searching in the Presence of Memory Faults. [Citation Graph (0, 0)][DBLP]
    ICALP (1), 2006, pp:286-298 [Conf]
  13. James Abello, Irene Finocchi, Jeffrey L. Korn
    Visualization of State Transition Graphs Graph Sketches. [Citation Graph (0, 0)][DBLP]
    INFOVIS, 2001, pp:67-0 [Conf]
  14. Sajal K. Das, Irene Finocchi, Rossella Petreschi
    Star-Coloring of Graphs for Conflict-Free Access to Parallel Memory Systems. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  15. Saverio Caminiti, Irene Finocchi, Rossella Petreschi
    A Unified Approach to Coding Labeled Trees. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:339-348 [Conf]
  16. Tiziana Calamoneri, Irene Finocchi, Rossella Petreschi
    Graph Coloring with Distance Constraints. [Citation Graph (0, 0)][DBLP]
    PDPTA, 2005, pp:131-140 [Conf]
  17. Camil Demetrescu, Irene Finocchi
    A portable virtual machine for program debugging and directing. [Citation Graph (0, 0)][DBLP]
    SAC, 2004, pp:1524-1530 [Conf]
  18. Camil Demetrescu, Irene Finocchi, Andrea Ribichini
    Trading off space for passes in graph streaming problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:714-723 [Conf]
  19. Irene Finocchi, Alessandro Panconesi, Riccardo Silvestri
    Experimental analysis of simple, distributed vertex coloring algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:606-615 [Conf]
  20. Irene Finocchi, Giuseppe F. Italiano
    Sorting and searching in the presence of memory faults (without redundancy). [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:101-110 [Conf]
  21. Camil Demetrescu, Irene Finocchi
    A Technique for Generating Graphical Abstractions of Program Data Structures. [Citation Graph (0, 0)][DBLP]
    VISUAL, 1999, pp:785-792 [Conf]
  22. Camil Demetrescu, Irene Finocchi
    Smooth Animation of Algorithms in a Declarative Framework. [Citation Graph (0, 0)][DBLP]
    VL, 1999, pp:280-287 [Conf]
  23. Camil Demetrescu, Irene Finocchi, Giuseppe Liotta
    Visualizing Algorithms over the Web with the Publication-Driven Approach. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 2000, pp:147-158 [Conf]
  24. Vincenzo Bonifaci, Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano, Luigi Laura
    Portraying Algorithms with Leonardo Web. [Citation Graph (0, 0)][DBLP]
    WISE Workshops, 2005, pp:73-83 [Conf]
  25. Irene Finocchi, Alessandro Panconesi, Riccardo Silvestri
    An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:41, n:1, pp:1-23 [Journal]
  26. Irene Finocchi, Rossella Petreschi
    Divider-based algorithms for hierarchical tree partitioning. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:136, n:2-3, pp:227-247 [Journal]
  27. Camil Demetrescu, Irene Finocchi, Giuseppe F. Italiano
    Algorithm engineering, Algorithmics Column. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2003, v:79, n:, pp:48-63 [Journal]
  28. Camil Demetrescu, Irene Finocchi
    Combinatorial algorithms for feedback problems in directed graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:86, n:3, pp:129-136 [Journal]
  29. Irene Finocchi
    Crossing-constrained hierarchical drawings. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2006, v:4, n:2, pp:299-312 [Journal]
  30. Camil Demetrescu, Irene Finocchi
    Rwmoving Cycles for Minimizing Crossings. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2001, v:6, n:, pp:2-0 [Journal]
  31. Sajal K. Das, Irene Finocchi, Rossella Petreschi
    Conflict-free star-access in parallel memory systems. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2006, v:66, n:11, pp:1431-1441 [Journal]
  32. Irene Finocchi, Rossella Petreschi
    Structure-Preserving Hierarchical Decompositions. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2005, v:38, n:6, pp:687-700 [Journal]
  33. Tiziana Calamoneri, Irene Finocchi, Yannis Manoussakis, Rossella Petreschi
    On max cut in cubic graphs. [Citation Graph (0, 0)][DBLP]
    Parallel Algorithms Appl., 2002, v:17, n:3, pp:165-183 [Journal]
  34. Vincenzo Bonifaci, Camil Demetrescu, Irene Finocchi, Luigi Laura
    A Java-based system for building animated presentations over the Web. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 2004, v:53, n:1, pp:37-49 [Journal]
  35. Pierluigi Crescenzi, Camil Demetrescu, Irene Finocchi, Rossella Petreschi
    Reversible Execution and Visualization of Programs with LEONARDO. [Citation Graph (0, 0)][DBLP]
    J. Vis. Lang. Comput., 2000, v:11, n:2, pp:125-150 [Journal]
  36. Camil Demetrescu, Irene Finocchi
    Smooth Animation of Algorithms in a Declarative Framework. [Citation Graph (0, 0)][DBLP]
    J. Vis. Lang. Comput., 2001, v:12, n:3, pp:253-281 [Journal]
  37. 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. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:347-358 [Conf]
  38. Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano
    Resilient search trees. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:547-553 [Conf]
  39. Saverio Caminiti, Irene Finocchi, Rossella Petreschi
    On coding labeled trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:382, n:2, pp:97-108 [Journal]

  40. Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors. [Citation Graph (, )][DBLP]


  41. A Note on Algebraic Hypercube Colorings. [Citation Graph (, )][DBLP]


  42. A data-driven graphical toolkit for software visualization. [Citation Graph (, )][DBLP]


  43. Experimental Study of Resilient Algorithms and Data Structures. [Citation Graph (, )][DBLP]


  44. The Price of Resiliency: a Case Study on Sorting with Memory Faults. [Citation Graph (, )][DBLP]


  45. Sorting and Searching in Faulty Memories. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002