Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
TCS
2008
10 years 2 months ago
On stabilizers of infinite words
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...
Dalia Krieger
TCS
2008
10 years 2 months ago
A unified approach to finding good stable matchings in the hospitals/residents setting
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...
Christine Cheng, Eric McDermid, Ichiro Suzuki
TCS
2008
10 years 2 months ago
Directional dynamics for cellular automata: A sensitivity to initial condition approach
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...
Mathieu Sablik
TCS
2008
10 years 2 months ago
Turing machines and bimachines
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...
John Rhodes, Pedro V. Silva
TCS
2008
10 years 2 months ago
On the structure of graphs in the Caucal hierarchy
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 ...
Achim Blumensath
TCS
2008
10 years 2 months ago
Approximation algorithms for partially covering with edges
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...
Ojas Parekh
TCS
2008
10 years 2 months ago
The role of information in the cop-robber game
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 ...
Volkan Isler, Nikhil Karnad
TCS
2008
10 years 2 months ago
Election and rendezvous with incomparable labels
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...
Jérémie Chalopin
TCS
2008
10 years 2 months ago
Minimum-Energy Broadcast and disk cover in grid wireless networks
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...
Tiziana Calamoneri, Andrea E. F. Clementi, Miriam ...
books