Arnold L. Rosenberg
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.
Arnold L. Rosenberg
Journal of the ACM
L. Joskowicz, Elisha Sacks
aaai 1994
Alex Golts, Daniel Khapun, et al.
MICCAI 2021
Baihan Lin, Guillermo Cecchi, et al.
IJCAI 2023