John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence
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.
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence
Cynthia Dwork, Moni Naor, et al.
Journal of the ACM
Hiroshi Kanayama, Tetsuya Nasukawa
Natural Language Engineering
Tushar Deepak Chandra, Sam Toueg
Journal of the ACM