Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=550
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Energy-efficient multiprocessor scheduling for flow time and makespan
Hongyang Sun
,
Yuxiong He
,
Wen-Jing Hsu
,
Rui Fan
Theoretical Computer Science
550
, 2014, pp. 1-20
Complexity of finding maximum regular induced subgraphs with prescribed degree
Yuichi Asahiro
,
Hiroshi Eto
,
Takehiro Ito
,
Eiji Miyano
Theoretical Computer Science
550
, 2014, pp. 21-35
On non-progressive spread of influence through social networks
MohammadAmin Fazli
,
Mohammad Ghodsi
,
Jafar Habibi
,
Pooya Jalaly
,
Vahab Mirrokni
,
Sina Sadeghian
Theoretical Computer Science
550
, 2014, pp. 36-50
Compact q-gram profiling of compressed strings
Philip Bille
,
Patrick Hagge Cording
,
Inge Li Grtz
Theoretical Computer Science
550
, 2014, pp. 51-58
On the approximability of the exemplar adjacency number problem for genomes with gene repetitions
Zhixiang Chen
,
Bin Fu
,
Randy Goebel
,
Guohui Lin
,
Weitian Tong
,
Jinhui Xu
,
Boting Yang
,
Zhiyu Zhao
,
Binhai Zhu
Theoretical Computer Science
550
, 2014, pp. 59-65
Palindromes in circular words
Jamie Simpson
Theoretical Computer Science
550
, 2014, pp. 66-78
On the maximality of languages with combined types of code properties
Lila Kari
,
Stavros Konstantinidis
,
Steffen Kopecki
Theoretical Computer Science
550
, 2014, pp. 79-89
Decidability of involution hypercodes
Da-Jung Cho
,
Yo-Sub Han
,
Sang-Ki Ko
Theoretical Computer Science
550
, 2014, pp. 90-99
Bounds on Herman's algorithm
John Haslegrave
Theoretical Computer Science
550
, 2014, pp. 100-106
On the structure of Thue-Morse subwords, with an application to dynamical systems
Michel Dekking
Theoretical Computer Science
550
, 2014, pp. 107-112