A problem with a demonstrable time-space trade-off is exhibited. The problem is to compile a straight-line program for a certain uninterpreted expression; time is reckoned as the number of instructions in the program,. space as the number of registers referred to. There are programs using linear space and linear time, but any program using less than linear space uses more than linear time
AbstractWe obtain the first non-trivial time–space tradeoff lower bound for functions f:{0, 1}n→{0, ...
The purpose of this thesis is to demonstrate the development of the time-cost trade-off problem in m...
AbstractOn any general sequential model of computation with random-access input (e.g., a logarithmic...
AbstractRecent research has investigated time-space tradeoffs for register allocation strategies of ...
AbstractThis paper establishes time-space tradeoffs for some algebraic problems in the branching pro...
AbstractIt is shown how to extend the techniques originally used to prove a lower bound of Ω(n2) for...
A model of computat ion is introduced which permits the analysis of both the time and space requirem...
AbstractUpper bound time-space trade-offs are established for sorting and selection in two computati...
AbstractThis paper considers time-space tradeoffs for various set operations. Denoting the time requ...
AbstractWe exhibit a new method for showing lower bounds for time-space tradeoffs of polynomial eval...
Abstract. An optimal (n2) lower bound is shown for the time-space product of any R-way branching pro...
AbstractA model of computation is introduced which permits the analysis of both the time and space r...
A model of computation is introduced which permits the analysis of both the time and space require-m...
We prove the first time-space lower bound tradeoffs for randomized computation of decision problems....
This paper discusses a method for converting time issue into space issue in the design process. Duri...
AbstractWe obtain the first non-trivial time–space tradeoff lower bound for functions f:{0, 1}n→{0, ...
The purpose of this thesis is to demonstrate the development of the time-cost trade-off problem in m...
AbstractOn any general sequential model of computation with random-access input (e.g., a logarithmic...
AbstractRecent research has investigated time-space tradeoffs for register allocation strategies of ...
AbstractThis paper establishes time-space tradeoffs for some algebraic problems in the branching pro...
AbstractIt is shown how to extend the techniques originally used to prove a lower bound of Ω(n2) for...
A model of computat ion is introduced which permits the analysis of both the time and space requirem...
AbstractUpper bound time-space trade-offs are established for sorting and selection in two computati...
AbstractThis paper considers time-space tradeoffs for various set operations. Denoting the time requ...
AbstractWe exhibit a new method for showing lower bounds for time-space tradeoffs of polynomial eval...
Abstract. An optimal (n2) lower bound is shown for the time-space product of any R-way branching pro...
AbstractA model of computation is introduced which permits the analysis of both the time and space r...
A model of computation is introduced which permits the analysis of both the time and space require-m...
We prove the first time-space lower bound tradeoffs for randomized computation of decision problems....
This paper discusses a method for converting time issue into space issue in the design process. Duri...
AbstractWe obtain the first non-trivial time–space tradeoff lower bound for functions f:{0, 1}n→{0, ...
The purpose of this thesis is to demonstrate the development of the time-cost trade-off problem in m...
AbstractOn any general sequential model of computation with random-access input (e.g., a logarithmic...