AbstractExtending a result of Borodin et al. [1], we show that any branching program using linear queries “∑iλixi:c” to sort n numbers x1, x2,…,xn must satisfy the time-space tradeoff relation TS = Ω(n2). The same relation is also shown to be true for branching programs that uses queries “min R = ?” where R is any subset of {x1, x2,…,xn}
We prove the first time-space lower bound tradeoffs for randomized computation of decision problems....
We present a randomized algorithm sorting n integers in O(n p log logn) expected time and linear spa...
AbstractA model of computation is introduced which permits the analysis of both the time and space r...
AbstractIt is shown how to extend the techniques originally used to prove a lower bound of Ω(n2) for...
Abstract. An optimal (n2) lower bound is shown for the time-space product of any R-way branching pro...
An optimal R(n2) lower bound is shown for the time-space product of any R-way branching pro-gram tha...
We obtain the first non-trivial time–space tradeoff lower bound for func-tions f: {0, 1}nQ {0, 1} on...
AbstractWe obtain the first non-trivial time–space tradeoff lower bound for functions f:{0, 1}n→{0, ...
AbstractUpper bound time-space trade-offs are established for sorting and selection in two computati...
We study the fundamental problem of sorting in a sequential model of computation and in particular c...
AbstractThis paper considers time-space tradeoffs for various set operations. Denoting the time requ...
AbstractTwo time-space tradeoffs for element distinctness are given. The first one shows T2S = Ω(n3)...
AbstractThis paper establishes time-space tradeoffs for some algebraic problems in the branching pro...
A model of computation is introduced which permits the analysis of both the time and space require-m...
A model of computat ion is introduced which permits the analysis of both the time and space requirem...
We prove the first time-space lower bound tradeoffs for randomized computation of decision problems....
We present a randomized algorithm sorting n integers in O(n p log logn) expected time and linear spa...
AbstractA model of computation is introduced which permits the analysis of both the time and space r...
AbstractIt is shown how to extend the techniques originally used to prove a lower bound of Ω(n2) for...
Abstract. An optimal (n2) lower bound is shown for the time-space product of any R-way branching pro...
An optimal R(n2) lower bound is shown for the time-space product of any R-way branching pro-gram tha...
We obtain the first non-trivial time–space tradeoff lower bound for func-tions f: {0, 1}nQ {0, 1} on...
AbstractWe obtain the first non-trivial time–space tradeoff lower bound for functions f:{0, 1}n→{0, ...
AbstractUpper bound time-space trade-offs are established for sorting and selection in two computati...
We study the fundamental problem of sorting in a sequential model of computation and in particular c...
AbstractThis paper considers time-space tradeoffs for various set operations. Denoting the time requ...
AbstractTwo time-space tradeoffs for element distinctness are given. The first one shows T2S = Ω(n3)...
AbstractThis paper establishes time-space tradeoffs for some algebraic problems in the branching pro...
A model of computation is introduced which permits the analysis of both the time and space require-m...
A model of computat ion is introduced which permits the analysis of both the time and space requirem...
We prove the first time-space lower bound tradeoffs for randomized computation of decision problems....
We present a randomized algorithm sorting n integers in O(n p log logn) expected time and linear spa...
AbstractA model of computation is introduced which permits the analysis of both the time and space r...