Add to ORKGAbstract. We prove a time-space tradeoff for traversing undirected graphs, using a structured model that is a nonjumping variant of Cook and Rackoff’s “jumping automata for graphs.
International audienceWe introduce timed automata and show how they can be used for the specificatio...
This paper is concerned with the derivation of infinite schedules for timed automata that are in som...
This paper is concerned with the derivation of infinite schedules for timed automata that are in som...
AbstractWe investigate time-space tradeoffs for traversing undirected graphs, using a variety of str...
Directed and undirected st-connectivity are important problems in computing. There are algorithms fo...
. We initiate a study of space-time tradeoffs in the cell-probe model under restricted preprocessing...
In this paper we propose a family of algorithms combining treeclustering with conditioning that trad...
AbstractIn this paper we propose a family of algorithms combining tree-clustering with conditioning ...
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
We present a spectrum of randomized time-space tradeoffs for solving directed graph connectivity or ...
Abstract. We present a spectrum of randomized time-space tradeoffs for solving directed graph connec...
AbstractWe present a family of randomized algorithms that enjoys a wide range of time–space trade-of...
AbstractThis paper establishes time-space tradeoffs for some algebraic problems in the branching pro...
Abstract. We initiate a study of space-time tradeos in the cell-probe model under restricted preproc...
AbstractWe exhibit a new method for showing lower bounds for time-space tradeoffs of polynomial eval...
International audienceWe introduce timed automata and show how they can be used for the specificatio...
This paper is concerned with the derivation of infinite schedules for timed automata that are in som...
This paper is concerned with the derivation of infinite schedules for timed automata that are in som...
AbstractWe investigate time-space tradeoffs for traversing undirected graphs, using a variety of str...
Directed and undirected st-connectivity are important problems in computing. There are algorithms fo...
. We initiate a study of space-time tradeoffs in the cell-probe model under restricted preprocessing...
In this paper we propose a family of algorithms combining treeclustering with conditioning that trad...
AbstractIn this paper we propose a family of algorithms combining tree-clustering with conditioning ...
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
We present a spectrum of randomized time-space tradeoffs for solving directed graph connectivity or ...
Abstract. We present a spectrum of randomized time-space tradeoffs for solving directed graph connec...
AbstractWe present a family of randomized algorithms that enjoys a wide range of time–space trade-of...
AbstractThis paper establishes time-space tradeoffs for some algebraic problems in the branching pro...
Abstract. We initiate a study of space-time tradeos in the cell-probe model under restricted preproc...
AbstractWe exhibit a new method for showing lower bounds for time-space tradeoffs of polynomial eval...
International audienceWe introduce timed automata and show how they can be used for the specificatio...
This paper is concerned with the derivation of infinite schedules for timed automata that are in som...
This paper is concerned with the derivation of infinite schedules for timed automata that are in som...