Time and space bounds in producing certain partial orders

  • Peter Ružička
Part of the Lecture Notes in Computer Science book series (LNCS, volume 88)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7. References

  1. 1.
    Dobkin, D.P., Munro, J.I.: Time and Space Bounds for Selection Problems. Lecture Notes in Computer Science 62. Springer-Verlag, 1978Google Scholar
  2. 2.
    Galil, Z., Seiferas, J.: Saving Space in Fast String-Matching. 18th Symposium on Foundation of Computer Science, Providence, 1977Google Scholar
  3. 3.
    Paterson, M.S., Munro, J.I.: Selection and Sorting with Limited Storage. Report No. 24, University of Warwick, July 1978Google Scholar
  4. 4.
    Ružička, P.: Time-Space Trade Offs in Selection Problem. Thesis. 1980 (in Slovak)Google Scholar
  5. 5.
    Tompa, M.: Time-Space Tradeoffs for Straight-Line and Branching Programs. Technical Report No. 122-78, Departement of Computer Science, University of Toronto, July 1978Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • Peter Ružička
    • 1
  1. 1.Computing Research CenterBratislavaCzechoslovakia

Personalised recommendations