Conrad Albrecht, Jannik Schneider, et al.
CVPR 2025
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.
Conrad Albrecht, Jannik Schneider, et al.
CVPR 2025
Tim Erdmann, Stefan Zecevic, et al.
ACS Spring 2024
Shuang Chen, Herbert Freeman
International Journal of Pattern Recognition and Artificial Intelligence
Chen-chia Chang, Wan-hsuan Lin, et al.
ICML 2025