S. Winograd
Journal of the ACM
A problem with a demonstrable Ume-space trade-off Is exhibited The problem is to compile a straight-line program for a certain unmterprted expression; time is reckoned as the number of mstrucUons m the program, space as the number of registers referred to There are programs using linear space and linear tune, but any program using less than linear space uses more than linear rune. © 1978, ACM. All rights reserved.
S. Winograd
Journal of the ACM
Wooseok Choi, Tommaso Stecconi, et al.
Advanced Science
Susumu Horiguchi, Takeo Nakada
Journal of Parallel and Distributed Computing
Hiroshi Kanayama, Tetsuya Nasukawa
Natural Language Engineering