Abstract. We initiate a study of space-time tradeos in the cell-probe model under restricted preprocessing power. Classically, space-time trade-os have been studied in this model under the assumption that the pre-processing is unrestricted. In this setting, a large gap exists between the best known upper and lower bounds. Augmenting the model with a function family F that characterizes the preprocessing power, makes for a more realistic computational model and allows to obtain much tighter space-time tradeos for various natural settings of F. The extreme set-tings of our model reduce to the classical cell probe and generalized decision tree complexities. We use graph properties for the purpose of illustrating various aspects of our model ac...
We present a spectrum of randomized time-space tradeoffs for solving directed graph connectivity or ...
We prove the first time-space lower bound tradeoffs for randomized computation of decision problems....
A temporal graph can be viewed as a sequence of static graphs indexed by discrete time steps. The ve...
. We initiate a study of space-time tradeoffs in the cell-probe model under restricted preprocessing...
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
AbstractWe investigate time-space tradeoffs for traversing undirected graphs, using a variety of str...
AbstractIn this paper we propose a family of algorithms combining tree-clustering with conditioning ...
In this paper we propose a family of algorithms combining treeclustering with conditioning that trad...
AbstractWe exhibit a new method for showing lower bounds for time-space tradeoffs of polynomial eval...
AbstractLet EH be the hypothesis that a certain type of expander graph has an explicit construction....
We introduce a natural temporal analogue of Eulerian circuits and prove that, in contrast to the sta...
We extend recent techniques for time-space tradeoff lower bounds using multiparty communication comp...
Abstract. We prove a time-space tradeoff for traversing undirected graphs, using a structured model ...
Directed and undirected st-connectivity are important problems in computing. There are algorithms fo...
AbstractThis paper establishes time-space tradeoffs for some algebraic problems in the branching pro...
We present a spectrum of randomized time-space tradeoffs for solving directed graph connectivity or ...
We prove the first time-space lower bound tradeoffs for randomized computation of decision problems....
A temporal graph can be viewed as a sequence of static graphs indexed by discrete time steps. The ve...
. We initiate a study of space-time tradeoffs in the cell-probe model under restricted preprocessing...
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
AbstractWe investigate time-space tradeoffs for traversing undirected graphs, using a variety of str...
AbstractIn this paper we propose a family of algorithms combining tree-clustering with conditioning ...
In this paper we propose a family of algorithms combining treeclustering with conditioning that trad...
AbstractWe exhibit a new method for showing lower bounds for time-space tradeoffs of polynomial eval...
AbstractLet EH be the hypothesis that a certain type of expander graph has an explicit construction....
We introduce a natural temporal analogue of Eulerian circuits and prove that, in contrast to the sta...
We extend recent techniques for time-space tradeoff lower bounds using multiparty communication comp...
Abstract. We prove a time-space tradeoff for traversing undirected graphs, using a structured model ...
Directed and undirected st-connectivity are important problems in computing. There are algorithms fo...
AbstractThis paper establishes time-space tradeoffs for some algebraic problems in the branching pro...
We present a spectrum of randomized time-space tradeoffs for solving directed graph connectivity or ...
We prove the first time-space lower bound tradeoffs for randomized computation of decision problems....
A temporal graph can be viewed as a sequence of static graphs indexed by discrete time steps. The ve...