Pol G. Recasens, Yue Zhu, et al.
EuroSys 2024
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.
Pol G. Recasens, Yue Zhu, et al.
EuroSys 2024
Anurag Ajay, Seungwook Han, et al.
NeurIPS 2023
Dzung Phan, Vinicius Lima
INFORMS 2023
Guojing Cong, David A. Bader
Journal of Parallel and Distributed Computing