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=548
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Motif matching using gapped patterns
Emanuele Giaquinta
,
Kimmo Fredriksson
,
Szymon Grabowski
,
Alexandru I. Tomescu
,
Esko Ukkonen
Theoretical Computer Science
548
, 2014, pp. 1-13
Extensions of rich words
Jetro Vesti
Theoretical Computer Science
548
, 2014, pp. 14-24
Asymptotic expansions for linear homogeneous divide-and-conquer recurrences: Algebraic and analytic approaches collated
Philippe Dumas
Theoretical Computer Science
548
, 2014, pp. 25-53
Extending concurrent signature to multiple parties
Xiao Tan
,
Qiong Huang
,
Duncan S. Wong
Theoretical Computer Science
548
, 2014, pp. 54-67
Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs
Marc Lelarge
,
Hang Zhou
Theoretical Computer Science
548
, 2014, pp. 68-78
Conditional diagnosability of arrangement graphs under the PMC model
Limei Lin
,
Shuming Zhou
,
Li Xu
,
Dajin Wang
Theoretical Computer Science
548
, 2014, pp. 79-97
An approach to conditional diagnosability analysis under the PMC model and its application to torus networks
Hee-Chul Kim
,
Hyeong-Seok Lim
,
Jung-Heum Park
Theoretical Computer Science
548
, 2014, pp. 98-116
Minimal critical exponent of quasiperiodic words
Gwenaƫl Richomme
Theoretical Computer Science
548
, 2014, pp. 117-122