Guojing Cong, David A. Bader
Journal of Parallel and Distributed Computing
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.
Guojing Cong, David A. Bader
Journal of Parallel and Distributed Computing
Rakesh Mohan, Ramakant Nevatia
IEEE Transactions on Pattern Analysis and Machine Intelligence
Susan L. Spraragen
International Conference on Design and Emotion 2010
Rina Dechter, Kalev Kask, et al.
AAAI/IAAI 2002