Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Implementing Algorithms and Data Structures: An Educational and Research Perspective

(Invited Presentation)

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1533))

Included in the following conference series:

  • 604 Accesses

Abstract

Anecdotal evidence shows that developing correct and efficient implementations of fundamental data structures and algorithms is a challenging task. We discuss educational and research issues in algorithm engineering. Topics include algorithmic patterns, the development of a library of data structures and algorithms in Java, and the use of design patters in teaching introductory data structures courses.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. R. Baker, M. Boilen, M. T. Goodrich, R. Tamassia, and B. A. Stibel. Testers and visualizers for teaching data structures. Manuscript, 1998.

    Google Scholar 

  2. J. Beall. Shortest path between two points in a polygon. http://www.cs.brown.edu/courses/cs252/projects/jeb/html/cs252proj.html.

  3. E. Gamma, R. Helm, R. Johnson, and J. Vlissides. Design Patterns. Addison-Wesley, Reading, MA, 1995.

    Google Scholar 

  4. N. Gelfand, M. T. Goodrich, and R. Tamassia. Teaching data structure design patterns. In Proc. SIGCSE, 1997.

    Google Scholar 

  5. N. Gelfand and R. Tamassia. Algorithmic patterns for graph drawing. In Proc. Graph Drawing’ 98. Springer-Verlag, to appear.

    Google Scholar 

  6. M. T. Goodrich, M. Handy, B. Hudson, and R. Tamassia. Accessing the internal organization of data structures in the JDSL library. Manuscript, 1998.

    Google Scholar 

  7. M. T. Goodrich and J. G. Kloss. Tiered vector: an efficient dynamic array for JDSL. Manuscript, 1998.

    Google Scholar 

  8. M. T. Goodrich and R. Tamassia. Data Structures and Algorithms in Java. Wiley, New York, NY, 1998.

    Google Scholar 

  9. D. Jackson. The TripartiteEmbeddedPlanarGraph. Manuscript, 1997.

    Google Scholar 

  10. JDSL teach version home page. http://www.cs.brown.edu/cgc/jdsl.

  11. K. Mehlhorn and S. Näher. LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, New York, 1998.

    Google Scholar 

  12. F. P. Preparata. Planar point location revisited. Internat. J. Found. Comput. Sci., 1(1):71–86, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  13. R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and read-ability of diagrams. IEEE Trans. Syst. Man Cybern., SMC-18(1):61–79, 1988.

    Article  Google Scholar 

  14. R. Tamassia, L. Vismara, and J. E. Baker. A case study in algorithm engineering for geometric computing. In Proc. Workshop on Algorithm Engineering, pages 136–145, 1997.

    Google Scholar 

  15. K. Weihe. Reuse of algorithms: Still a challenge to object-oriented programming. In Proc. OOPSLA’ 97, pages 34–48, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Brown University, Providence, RI, 02912-1910, USA

    Roberto Tamassia

Authors
  1. Roberto Tamassia
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Korea Advanced Institute of Science and Technology, 373-1, Kusong-dong, Yusong-gu, Taejon, 305-701, Korea

    Kyung-Yong Chwa

  2. Department of Computer Science, University of California, Santa Barbara, CA, 93106, USA

    Oscar H. Ibarra

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tamassia, R. (1998). Implementing Algorithms and Data Structures: An Educational and Research Perspective. In: Chwa, KY., Ibarra, O.H. (eds) Algorithms and Computation. ISAAC 1998. Lecture Notes in Computer Science, vol 1533. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49381-6_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-49381-6_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65385-1

  • Online ISBN: 978-3-540-49381-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation