Skip to main content
SpringerLink
Log in

Implementing abstract data structures in hardware

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1988 (MFCS 1988)

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

  • 163 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

9. References

  1. Aho, A. V.: Hopcroft, J. E.; Ullman, J. D.; "The Design and Analysis of Computer Algorithms"; Addison-Wesley; Reading MA; 1974

    Google Scholar 

  2. Bauernöppel, F.; Jung, H.; Implementing Heaps on A Chain of Processors; submitted

    Google Scholar 

  3. Brown, M. R.; "Implementation and Analysis of Binomial Queue Algorithms"; SIAM J. Comp. 7(1978), 298–319

    Google Scholar 

  4. Emde Boas, P. v.; Kaas, R.; Zijlstra, E.; "Design And Implementation of An Efficient Priority Queue"; Math. Systems Theory 10(1977), 99–127

    Google Scholar 

  5. Emde Boas, P. v.; "Preserving Order in A Forest in Less Than Logarithmic Time"; Inf. Proc. Letters 6(1977), 80–82

    Google Scholar 

  6. Floyd, F. W.; "Algorithm 245: Treesort 3"; Comm. ACM 7(1964), 12, 701

    Google Scholar 

  7. Mehlhorn,K.; "Data Structures And Algorithms, Part 1: Sorting And Searching"; Springer; 1984

    Google Scholar 

  8. Meyer auf der Heide,F.; Simons,B; "Data Structures on Parallel Machines with Few Processors"; IBM Comp.Sci. Research Report RJ 5240 (54240) 8/18/86

    Google Scholar 

  9. Paul,W.; Vishkin,U; Wagener,H; "Parallel Computation on 2–3 Trees"; ICALP 1983; Springer Lecture Notesin Computer Science

    Google Scholar 

  10. Sleator, D.D.; Tarjan, R.E.; "Self-Adjusting Heaps"; SIAM J.Comp. 15(1986), 1, 52–69

    Google Scholar 

  11. Tarjan, R.E.; Fredman, M.L.; "Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms”; J. ACM 34(1987), 3, 596–615

    Google Scholar 

  12. Vuillemin, J.; "A Data Structure for Manipulating Priority Queues"; Comm. ACM 21(1978), 4, 309–315

    Google Scholar 

  13. Williams, J.W.; "Algorithm 232: Heapsort"; Comm. ACM 7(1964), 6, 347–348

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sektion Mathematik, Humboldt-Universität zu Berlin, P.O. Box 1297, 1086, Berlin, German Democratic Republic

    Frank Bauernöppel & Hermann Jung

Authors
  1. Frank Bauernöppel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hermann Jung
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michal P. Chytil Václav Koubek Ladislav Janiga

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bauernöppel, F., Jung, H. (1988). Implementing abstract data structures in hardware. In: Chytil, M.P., Koubek, V., Janiga, L. (eds) Mathematical Foundations of Computer Science 1988. MFCS 1988. Lecture Notes in Computer Science, vol 324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017140

Download citation

  • DOI: https://doi.org/10.1007/BFb0017140

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50110-7

  • Online ISBN: 978-3-540-45926-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation