Shuang Chen, Herbert Freeman
International Journal of Pattern Recognition and Artificial 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.
Shuang Chen, Herbert Freeman
International Journal of Pattern Recognition and Artificial Intelligence
Daniel Karl I. Weidele, Priyanshu Rai, et al.
AAAI 2026
David Eppstein, Zvi Galil, et al.
Journal of the ACM
Zhikun Yuen, Paula Branco, et al.
DSAA 2023