117
Voted
STACS
2007
Springer
15 years 8 months ago
2007
Springer
We consider the problem of maintaining aggregates over recent elements of a massive data stream. Motivated by applications involving network data, we consider asynchronous data str...
94
Voted
STACS
2007
Springer
15 years 8 months ago
2007
Springer
We consider deducibility constraints, which are equivalent to particular Diophantine systems, arising in the automatic verification of security protocols, in presence of associati...
79
Voted
STACS
2007
Springer
15 years 8 months ago
2007
Springer
104
Voted
STACS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Roughgarden and Sundararajan recently introduced an alternative measure of efficiency for cost sharing mechanisms. We study cost sharing methods for combinatorial optimiz...
106
Voted
STACS
2007
Springer
15 years 8 months ago
2007
Springer
We consider commutative string rewriting systems (Vector Addition Systems, Petri nets), i.e., string rewriting systems in which all pairs of letters commute. We are interested in r...
134
Voted
STACS
2007
Springer
15 years 8 months ago
2007
Springer
In this paper, it is shown that the Feedback Vertex Set problem on unweighted, undirected graphs has a kernel of cubic size. I.e., a polynomial time algorithm is described, that, w...
90
Voted
STACS
2007
Springer
15 years 8 months ago
2007
Springer
92
Voted
STACS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Merkle et al. [13] showed that all Kolmogorov-Loveland stochas
79
Voted
STACS
2007
Springer
15 years 8 months ago
2007
Springer
93
Voted
STACS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We give a characterization, in terms of computational complexity, of the family Rec1 of the unary picture languages that are tiling recognizable. We introduce quasi-unary...