Hiroshi Kanayama, Tetsuya Nasukawa
Natural Language Engineering
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.
Hiroshi Kanayama, Tetsuya Nasukawa
Natural Language Engineering
Joxan Jaffar
Journal of the ACM
Youssef Mroueh, Apoorva Nitsure
TMLR
Guillaume Buthmann, Tomoya Sakai, et al.
ICASSP 2025