1. [BC-82] Borodin A. and Cook S., A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation, SICOMP 11(2), May 1982, pp. 287–297.
2. [B-81] Borodin A., Fischer M., Kirkpatrick D., Lynch N., Tompa M., A Time-Space Tradeoff on Non-Oblivious Machines, J.C.S.S. 22(3), June 1981, pp.351–364.
3. Research Paper;A. Cobham,1966
4. [R-72] Reingold E., On the Optimality of some Set Algorithms, J. ACM 19, 1972, pp.649–659.
5. [T-80] Tompa M., Time-Space Tradeoffs for Computing Functions Using Connectivity Properties of their Circuits, J.C.S.S. 20(2), 1980, pp.118–132.