STACS
1997
Springer
14 years 3 months ago
1997
Springer
STACS
1997
Springer
14 years 3 months ago
1997
Springer
STACS
1997
Springer
14 years 3 months ago
1997
Springer
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...
STACS
1997
Springer
14 years 3 months ago
1997
Springer
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...
STACS
1997
Springer
14 years 3 months ago
1997
Springer
Exotic semirings such as the “(max, +) semiring” (R ∪ {−∞}, max, +), or the “tropical semiring” (N ∪ {+∞}, min, +), have been invented and reinvented many times s...
STACS
1997
Springer
14 years 3 months ago
1997
Springer
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...
STACS
1997
Springer
14 years 3 months ago
1997
Springer
We consider the problem of maintaining a set of n integers in the range 0::2w ? 1 under the operations of insertion, deletion, predecessor queries, minimum queries and maximum quer...
SOFSEM
1997
Springer
14 years 3 months ago
1997
Springer
SOFSEM
1997
Springer
14 years 3 months ago
1997
Springer
This paper surveys recent results in the area of virtual path layout in ATM networks. We present a model for the theoretical study of these layouts the model amounts to covering t...
SOFSEM
1997
Springer
14 years 3 months ago
1997
Springer
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...