Sciweavers

7 search results - page 1 / 2
» stacs 1997
Sort
View
58
Voted
STACS
1997
Springer
15 years 3 months ago
Finding the k Shortest Paths in Parallel
Eric Ruppert
54
Voted
STACS
1997
Springer
15 years 3 months ago
Efficient Scaling-Invariant Checking of Timed Bisimulation
Carsten Weise, Dirk Lenzkes
68
Voted
STACS
1997
Springer
15 years 3 months ago
Probabilistic Proof Systems - A Survey
Various types of probabilistic proof systems have played a central role in the development of computer science in the last decade. In this exposition, we concentrate on three such...
Oded Goldreich
94
Voted
STACS
1997
Springer
15 years 3 months ago
Intrinsic Universality of a 1-Dimensional Reversible Cellular Automaton
Abstract. This paper deals with simulation and reversibility in the context of Cellular Automata (ca). We recall the de nitions of ca and of the Block (bca) and Partitioned (pca) s...
Jérôme Olivier Durand-Lose
59
Voted
STACS
1997
Springer
15 years 3 months ago
Strict Sequential P-completeness
In this paper we present a new notion of what it means for a problem in P to be inherently sequential. Informally, a problem L is strictly sequential P-complete if when the best kn...
Klaus Reinhardt