This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
7. References
Dobkin, D.P., Munro, J.I.: Time and Space Bounds for Selection Problems. Lecture Notes in Computer Science 62. Springer-Verlag, 1978
Galil, Z., Seiferas, J.: Saving Space in Fast String-Matching. 18th Symposium on Foundation of Computer Science, Providence, 1977
Paterson, M.S., Munro, J.I.: Selection and Sorting with Limited Storage. Report No. 24, University of Warwick, July 1978
Ružička, P.: Time-Space Trade Offs in Selection Problem. Thesis. 1980 (in Slovak)
Tompa, M.: Time-Space Tradeoffs for Straight-Line and Branching Programs. Technical Report No. 122-78, Departement of Computer Science, University of Toronto, July 1978
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ružička, P. (1980). Time and space bounds in producing certain partial orders. In: Dembiński, P. (eds) Mathematical Foundations of Computer Science 1980. MFCS 1980. Lecture Notes in Computer Science, vol 88. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022531
Download citation
DOI: https://doi.org/10.1007/BFb0022531
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10027-0
Online ISBN: 978-3-540-38194-5
eBook Packages: Springer Book Archive