Time and space bounds in producing certain partial orders

1. Dobkin, D.P., Munro, J.I.: Time and Space Bounds for Selection Problems. Lecture Notes in Computer Science 62. Springer-Verlag, 1978

   Google Scholar 

2. Galil, Z., Seiferas, J.: Saving Space in Fast String-Matching. 18th Symposium on Foundation of Computer Science, Providence, 1977

   Google Scholar 

3. Paterson, M.S., Munro, J.I.: Selection and Sorting with Limited Storage. Report No. 24, University of Warwick, July 1978

   Google Scholar 

4. Ružička, P.: Time-Space Trade Offs in Selection Problem. Thesis. 1980 (in Slovak)

   Google Scholar 

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 1978

   Google Scholar 

Download references