TCS
2008
13 years 11 months ago
2008
The stabilizer of an infinite word w over a finite alphabet is the monoid of morphisms over that fix w. In this paper we study various problems related to stabilizers and their g...
TCS
2008
13 years 11 months ago
2008
The hospitals/residents (HR) problem is a many-to-one generalization of the stable marriage (SM) problem. Researchers have been interested in variants of stable matchings that eit...
TCS
2008
13 years 11 months ago
2008
A cellular automaton is a continuous function F defined on a full-shift AZ which commutes with the shift . Often, to study the dynamics of F one only considers implicitly . Howeve...
TCS
2008
13 years 11 months ago
2008
We associate the iterated block product of a bimachine with a deterministic Turing machine. This allows us to introduce new algebraic notions to study the behavior of the Turing m...
TCS
2008
13 years 11 months ago
2008
We investigate the structure of graphs in the Caucal hierarchy. We provide criteria concerning the degree of vertices or the length of paths which can be used to show that a given ...
TCS
2008
13 years 11 months ago
2008
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
TCS
2008
13 years 11 months ago
2008
TCS
2008
13 years 11 months ago
2008
We investigate the role of the information available to the players on the outcome of the cops and robbers game. This game takes place on a graph and players move along the edges ...
TCS
2008
13 years 11 months ago
2008
In "Can we elect if we cannot compare" (SPAA'03), Barri`ere, Flocchini, Fraigniaud and Santoro consider a qualitative model of distributed computing, where the label...
TCS
2008
13 years 11 months ago
2008
The Minimum-Energy Broadcast problem is to assign a transmission range to every station of an ad-hoc wireless networks so that (i) a given source station is allowed to perform bro...