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=521
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Recognizing some complementary products
Márcia R. Cappelle
,
Lucia Penso
,
Dieter Rautenbach
Theoretical Computer Science
521
, 2014, pp. 1-7
Tree shuffle
Sándor Vágvölgyi
Theoretical Computer Science
521
, 2014, pp. 8-28
Extracting powers and periods in a word from its runs structure
M. Crochemore
,
C.S. Iliopoulos
,
M. Kubica
,
J. Radoszewski
,
W. Rytter
,
T. Waleń
Theoretical Computer Science
521
, 2014, pp. 29-41
One-dimensional approximate point set pattern matching with
L_p
-norm
Hung-Lung Wang
,
Kuan-Yu Chen
Theoretical Computer Science
521
, 2014, pp. 42-50
UNO is hard, even for a single player
Erik D. Demaine
,
Martin L. Demaine
,
Nicholas J.A. Harvey
,
Ryuhei Uehara
,
Takeaki Uno
,
Yushi Uno
Theoretical Computer Science
521
, 2014, pp. 51-61
Semi-online scheduling with two GoS levels and unit processing time
Taibo Luo
,
Yinfeng Xu
,
Li Luo
,
Changzheng He
Theoretical Computer Science
521
, 2014, pp. 62-72
Alternating traps in Muller and parity games
Andrey Grinshpun
,
Pakawat Phalitnonkiat
,
Sasha Rubin
,
Andrei Tarfulea
Theoretical Computer Science
521
, 2014, pp. 73-91
The guarding game is E-complete
R. S̑ámal
,
T. Valla
Theoretical Computer Science
521
, 2014, pp. 92-106
On the hardness of network design for bottleneck routing games
Dimitris Fotakis
,
Alexis C. Kaporis
,
Thanasis Lianeas
,
Paul G. Spirakis
Theoretical Computer Science
521
, 2014, pp. 107-122
Inefficiency of Nash Equilibrium for scheduling games with constrained jobs: A parametric analysis
Ling Lin
,
Zhiyi Tan
Theoretical Computer Science
521
, 2014, pp. 123-134