Volume 412; Issue 29

Theoretical Computer Science

Volume 412; Issue 29
1

Return time complexity of Sturmian sequences

Dong Han Kim
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 224 KB
english, 2011
3

Multiplication of polynomials modulo

Murat Cenk, Ferruh Özbudak
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 262 KB
english, 2011
4

Complexity of clique coloring and related problems

Dániel Marx
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 408 KB
english, 2011
5

On the small cycle transversal of planar graphs

Ge Xia, Yong Zhang
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 290 KB
english, 2011
6

Restricted ambiguity of erasing morphisms

Daniel Reidenbach, Johannes C. Schneider
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 334 KB
english, 2011
7

An exact algorithm for minimum distortion embedding

Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 243 KB
english, 2011
8

Approximate string matching with stuck address bits

Amihood Amir, Estrella Eisenberg, Orgad Keller, Avivit Levy, Ely Porat
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 323 KB
english, 2011
12

On the number of higher order Delaunay triangulations

Dieter Mitsche, Maria Saumell, Rodrigo I. Silveira
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 294 KB
english, 2011
13

Connectedness properties of dimension level sets

Daniel Turetsky
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 222 KB
english, 2011
14

Special factors and the combinatorics of suffix and factor automata

Gabriele Fici
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 307 KB
english, 2011
15

Communication complexity in number-conserving and monotone cellular automata

E. Goles, A. Moreira, I. Rapaport
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 515 KB
english, 2011
17

-wide diameters of enhanced pyramid networks

Hsien-Jone Hsieh, Dyi-Rong Duh
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 487 KB
english, 2011
18

Note on powers in three interval exchange transformations

Daniel Lenz, Zuzana Masáková, Edita Pelantová
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 233 KB
english, 2011
20

Compositional synthesis of asynchronous automata

Nicolas Baudru
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 409 KB
english, 2011
21

Video distribution under multiple constraints

Boaz Patt-Shamir, Dror Rawitz
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 330 KB
english, 2011
24

Approximation algorithms for grooming in optical network design

Spyridon Antonakopoulos, Lisa Zhang
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 306 KB
english, 2011
25

Avoiding large squares in partial words

F. Blanchet-Sadri, Ilkyoo Choi, Robert Mercaş
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 231 KB
english, 2011
26

Inapproximability of maximal strip recovery

Minghui Jiang
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 429 KB
english, 2011
27

Editorial Board

Journal:
Theoretical Computer Science
Year:
2011
File:
PDF, 58 KB
2011
28

Dynamic FTSS in asynchronous systems: The case of unison

Swan Dubois, Maria Potop-Butucaru, Sébastien Tixeuil
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 441 KB
english, 2011
29

Recognisability for algebras of infinite trees

Achim Blumensath
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 384 KB
english, 2011
30

An improved lower bound on the sensitivity complexity of graph properties

Xiaoming Sun
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 313 KB
english, 2011
31

Improved lower bound for deterministic broadcasting in radio networks

Carlos Fisch Brito, Shailesh Vaya
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 295 KB
english, 2011
32

On iterated hairpin completion

Steffen Kopecki
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 275 KB
english, 2011
33

On the complexity of interval scheduling with a resource constraint

Enrico Angelelli, Carlo Filippi
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 276 KB
english, 2011
34

Equational tree transformations

Symeon Bozapalidis, Zoltán Fülöp, George Rahonis
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 343 KB
english, 2011
35

Fast minimal triangulation algorithm using minimum degree criterion

Mauro Mezzini
Journal:
Theoretical Computer Science
Year:
2011
Language:
english
File:
PDF, 313 KB
english, 2011