Engineering and Visualizing Algorithms

  • Camil Demetrescu
  • Irene Finocchi
  • Giuseppe F. Italiano
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2912)

Abstract

We discuss some relevant issues in Algorithm Engineering, focussing on the interplay between theory and practice,and showing how it can integrate and reinforce the traditional theoretical approaches to the design and analysis of algorithms and data structures,while de- vising methodologies and tools for developing and engineering e .cient algorithmic codes.

References

  1. 1.
    Anderson, R.: The role of experiment in the theory of algorithms. In: Proceedings of the 5th DIMACS Challenge Workshop (1996), Available over the Internet at the URL: http://www.cs.amherst.edu/~dsj/methday.html
  2. 2.
    Baker, J.E., Cruz, I., Liotta, G., Tamassia, R.: A New Model for Algorithm Animation over the WWW. ACM Computing Surveys 27(4), 568–572 (1996)CrossRefGoogle Scholar
  3. 3.
    Baker, J.E., Cruz, I., Liotta, G., Tamassia, R.: Animating Geometric Algorithms over the Web. In: Proceedings of the 12th Annual ACM Symposium on Computational Geometry, pp. C3–C4 (1996)Google Scholar
  4. 4.
    Baker, J.E., Cruz, I., Liotta, G., Tamassia, R.: The Mocha Algorithm Animation System. In: Proceedings of the 1996 ACM Workshop on Advanced Visual Interfaces, pp. 248–250 (1996)Google Scholar
  5. 5.
    Baker, R.S., Boilen, M., Goodrich, M.T., Tamassia, R., Stibel, B.: Testers and visualizers for teaching data structures. SIGCSEB: SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education) 31 (1999)Google Scholar
  6. 6.
    Brown, M.H.: Algorithm Animation. MIT Press, Cambridge (1988)Google Scholar
  7. 7.
    Brown, M.H.: Zeus: a System for Algorithm Animation and Multi-View Editing. In: Proceedings of the 7-th IEEE Workshop on Visual Languages, pp. 4–9 (1991)Google Scholar
  8. 8.
    Cattaneo, G., Italiano, G.F., Ferraro-Petrillo, U.: CATAI: Concurrent Algorithms and Data Types Animation over the Internet. Journal of Visual Languages and Computing 13(4), 391–419 (2002), System Home Page: http://isis.dia.unisa.it/catai/ CrossRefGoogle Scholar
  9. 9.
    Cherkassky, B.V., Goldberg, A.V.: On implementing the push-relabel method for the maximum flow problem. Algorithmica 19, 390–410 (1997)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Crescenzi, P., Demetrescu, C., Finocchi, I., Petreschi, R.: Reversible Execution and Visualization of Programs with Leonardo. Journal of Visual Languages and Computing 11(2) (2000), System home page: http://www.dis.uniroma1.it/~demetres/Leonardo/
  11. 11.
    Demetrescu, C., Finocchi, I., Italiano, G.F., Naeher, S.: Visualization in algorithm engineering: Tools and techniques. In: Dagstuhl Seminar on Experimental Algorithmics 00371, Springer, Heidelberg (2001)Google Scholar
  12. 12.
    Demetrescu, C., Finocchi, I., Liotta, G.: Visualizing Algorithms over the Web with the Publication-driven Approach. In: Näher, S., Wagner, D. (eds.) WAE 2000. LNCS, vol. 1982, pp. 147–158. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  13. 13.
    Diehl, S.: Dagstuhl Seminar 2001. LNCS, vol. 2269. Springer, Heidelberg (2002)MATHCrossRefGoogle Scholar
  14. 14.
    Goldberg, A.V.: Selecting problems for algorithm evaluation. In: Vitter, J.S., Zaroliagis, C.D. (eds.) WAE 1999. LNCS, vol. 1668, pp. 1–11. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  15. 15.
    Johnson, D.: A theoretician’s guide to the experimental analysis of algorithms. In: Proceedings of the 5th DIMACS Challenge Workshop (1996), Available over the Internet at the URL: http://www.cs.amherst.edu/~dsj/methday.html
  16. 16.
    Malony, A., Reed, D.: Visualizing Parallel Computer System Performance. In: Simmons, M., Koskela, R., Bucher, I. (eds.) Instrumentation for Future Parallel Computing Systems, pp. 59–90. ACM Press, New York (1999)Google Scholar
  17. 17.
    McGeoch, C.: A bibliography of algorithm experimentation. In: Proceedings of the 5th DIMACS Challenge Workshop (1996), Available over the Internet at the URL: http://www.cs.amherst.edu/~dsj/methday.html
  18. 18.
    Moret, B.M.E.: Towards a discipline of experimental algorithmics. In: Proceedings of the 5th DIMACS Challenge Workshop (1996), Available over the Internet at the URL: http://www.cs.amherst.edu/~dsj/methday.html
  19. 19.
    Roman, G.C., Cox, K.C., Wilcox, C.D., Plun, J.Y.: PAVANE: a System for Declarative Visualization of Concurrent Computations. Journal of Visual Languages and Computing 3, 161–193 (1992)CrossRefGoogle Scholar
  20. 20.
    Stasko, J.T.: Animating Algorithms with X-TANGO. SIGACT News 23(2), 67–71 (1992)CrossRefGoogle Scholar
  21. 21.
    Stasko, J.T., Domingue, J., Brown, M.H., Price, B.A.: Software Visualization: Programming as a Multimedia Experience. MIT Press, Cambridge (1997)Google Scholar
  22. 22.
    Tal, A., Dobkin, D.: Visualization of Geometric Algorithms. IEEE Transactions on Visualization and Computer Graphics 1(2), 194–204 (1995)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Camil Demetrescu
    • 1
  • Irene Finocchi
    • 2
  • Giuseppe F. Italiano
    • 2
  1. 1.Dipartimento di Informatica e SistemisticaUniversità di Roma “La Sapienza”RomaItaly
  2. 2.Dipartimento di Informatica, Sistemi e ProduzioneUniversit‘a di Roma “Tor Vergata”RomaItaly

Personalised recommendations