Berrin Yanikoglu, Peter A. Sandon
Pattern Recognition
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.
Berrin Yanikoglu, Peter A. Sandon
Pattern Recognition
Sebastian Hudert, Torsten Eymann, et al.
IEEE-CEC 2000
Cynthia Dwork, Moni Naor, et al.
Journal of the ACM
Juliana Jansen Ferreira, Joao Henrique Gallas Brasil, et al.
ACS Spring 2026