TCS
2010
13 years 5 months ago
2010
In the context of 2-player removal games, we define the notion of invariant game for which each allowed move is independent of the position it is played from. We present a family ...
TCS
2010
13 years 5 months ago
2010
Motivated by applications that require mechanisms for describing the structure of object-oriented programs, adaptive star grammars are introduced, and their fundamental properties...
TCS
2010
13 years 5 months ago
2010
TCS
2010
13 years 5 months ago
2010
In this work we provide a combinatorial analysis of bucket recursive trees, which have been introduced previously as a natural generalization of the growth model of recursive trees...
TCS
2010
13 years 5 months ago
2010
TCS
2010
13 years 5 months ago
2010
We study the following variant of the bin packing problem. We are given a set of items, where each item has a (non-negative) size and a color. We are also given an integer paramet...
TCS
2010
13 years 5 months ago
2010
We study non-uniform constraint satisfaction problems definable in monadic Datalog stratified by the use of non-linearity. We show how such problems can be described in terms of...
TCS
2010
13 years 5 months ago
2010
TCS
2010
13 years 5 months ago
2010
TCS
2010
13 years 5 months ago
2010
In a left-forbidding grammar, a set of nonterminals is attached to every context-free production, and such a production can rewrite a nonterminal if no symbol from the attached se...