Topics
MassachusettsPlace
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1998.Includes bibliographical references (p. 83-84).by Yevgeniy Dodis.M.S
We consider data-structures for answering reachability and distance queries on constant-treewidth gr...
AbstractWe consider time-space tradeoffs for static data structure problems in the cell probe model ...
Propositional proof complexity is a field in theoretical computer science that analyses the resource...
. We initiate a study of space-time tradeoffs in the cell-probe model under restricted preprocessing...
Abstract. We initiate a study of space-time tradeos in the cell-probe model under restricted preproc...
AbstractWe investigate time-space tradeoffs for traversing undirected graphs, using a variety of str...
AbstractWe present a family of randomized algorithms that enjoys a wide range of time–space trade-of...
We consider data-structures for answering reachability and distance queries on constant-treewidth gr...
AbstractWe exhibit a new method for showing lower bounds for time-space tradeoffs of polynomial eval...
We consider data-structures for answering reachability and distance queries on constant-treewidth gr...
AbstractIn this paper we propose a family of algorithms combining tree-clustering with conditioning ...
We extend recent techniques for time-space tradeoff lower bounds using multiparty communication comp...
This thesis concerns the time and space efficiency of programs in GP 2, a rule-based graph transform...
We reconsider basic algorithmic graph problems in a setting where an n-vertex input graph is read-on...
AbstractLet EH be the hypothesis that a certain type of expander graph has an explicit construction....
We consider data-structures for answering reachability and distance queries on constant-treewidth gr...
AbstractWe consider time-space tradeoffs for static data structure problems in the cell probe model ...
Propositional proof complexity is a field in theoretical computer science that analyses the resource...
. We initiate a study of space-time tradeoffs in the cell-probe model under restricted preprocessing...
Abstract. We initiate a study of space-time tradeos in the cell-probe model under restricted preproc...
AbstractWe investigate time-space tradeoffs for traversing undirected graphs, using a variety of str...
AbstractWe present a family of randomized algorithms that enjoys a wide range of time–space trade-of...
We consider data-structures for answering reachability and distance queries on constant-treewidth gr...
AbstractWe exhibit a new method for showing lower bounds for time-space tradeoffs of polynomial eval...
We consider data-structures for answering reachability and distance queries on constant-treewidth gr...
AbstractIn this paper we propose a family of algorithms combining tree-clustering with conditioning ...
We extend recent techniques for time-space tradeoff lower bounds using multiparty communication comp...
This thesis concerns the time and space efficiency of programs in GP 2, a rule-based graph transform...
We reconsider basic algorithmic graph problems in a setting where an n-vertex input graph is read-on...
AbstractLet EH be the hypothesis that a certain type of expander graph has an explicit construction....
We consider data-structures for answering reachability and distance queries on constant-treewidth gr...
AbstractWe consider time-space tradeoffs for static data structure problems in the cell probe model ...
Propositional proof complexity is a field in theoretical computer science that analyses the resource...
Add to ORKG