Yehuda Naveli, Michal Rimon, et al.
AAAI/IAAI 2006
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.
Yehuda Naveli, Michal Rimon, et al.
AAAI/IAAI 2006
Masami Akamine, Jitendra Ajmera
IEICE Trans Inf Syst
Tim Erdmann, Stefan Zecevic, et al.
ACS Spring 2024
Annina Riedhauser, Viacheslav Snigirev, et al.
CLEO 2023