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=437
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An analysis of optimal link bombs
Sibel Adalı
,
Tina Liu
,
Malik Magdon-Ismail
Theoretical Computer Science
437
, 2012, pp. 1-20
Parameterized longest previous factor
Richard Beal
,
Donald Adjeroh
Theoretical Computer Science
437
, 2012, pp. 21-34
The complexity of approximately counting stable matchings
Prasad Chebolu
,
Leslie Ann Goldberg
,
Russell Martin
Theoretical Computer Science
437
, 2012, pp. 35-68
Fibonacci word patterns in two-way infinite Fibonacci words
Wai-Fong Chuan
,
Fang-Yi Liao
,
Hui-Ling Ho
,
Fei Yu
Theoretical Computer Science
437
, 2012, pp. 69-81
State complexity of combined operations with two basic operations
Bo Cui
,
Yuan Gao
,
Lila Kari
,
Sheng Yu
Theoretical Computer Science
437
, 2012, pp. 82-102