Rie Kubota Ando
CoNLL 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.
Rie Kubota Ando
CoNLL 2006
Gaku Yamamoto, Hideki Tai, et al.
AAMAS 2008
Aamod Khatiwada, Harsha Kokel, et al.
NeurIPS 2024
L. Joskowicz, Elisha Sacks
aaai 1994