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=314
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Dichotomies for classes of homomorphism problems involving unary functions
Tomás Feder
,
Florent Madelaine
,
Iain A. Stewart
Theoretical Computer Science
314
(1-2), 2004, pp. 1-43
Strategies for the Renyi-Ulam game with fixed number of lies
Christian Deppe
Theoretical Computer Science
314
(1-2), 2004, pp. 45-55
From object grammars to ECO systems
Enrica Duchi
,
Jean-Marc Fedou
,
Simone Rinaldi
Theoretical Computer Science
314
(1-2), 2004, pp. 57-95
m
-balanced words: A generalization of balanced words
Shinya Sano
,
Naoto Miyoshi
,
Ryohei Kataoka
Theoretical Computer Science
314
(1-2), 2004, pp. 97-120
Forbidden subgraphs in connected graphs
Vlady Ravelomanana
,
Loÿs Thimonier
Theoretical Computer Science
314
(1-2), 2004, pp. 121-171
Two-dimensional pattern matching with rotations
Amihood Amir
,
Ayelet Butman
,
Maxime Crochemore
,
Gad M. Landau
,
Mary Schaps
Theoretical Computer Science
314
(1-2), 2004, pp. 173-187
Local periods and binary partial words: An algorithm
F. Blanchet-Sadri
,
Ajay Chriscoe
Theoretical Computer Science
314
(1-2), 2004, pp. 189-216
On the complexity of inducing categorical and quantitative association rules
Fabrizio Angiulli
,
Giovambattista Ianni
,
Luigi Palopoli
Theoretical Computer Science
314
(1-2), 2004, pp. 217-249
Some properties of Ising automata
Jia-Yan Yao
Theoretical Computer Science
314
(1-2), 2004, pp. 251-279
On the
P-NP
problem over real matrix rings
A. Rybalov
Theoretical Computer Science
314
(1-2), 2004, pp. 281-285
Sequential computation of linear Boolean mappings
Serge Burckel
,
Marianne Morillon
Theoretical Computer Science
314
(1-2), 2004, pp. 287-292
Routing algorithm for multicast under multi-tree model in optical networks
Jun Gu
,
Xiao-Dong Hu
,
Xiaohua Jia
,
Mu-Hong Zhang
Theoretical Computer Science
314
(1-2), 2004, pp. 293-301
Simple 8-state minimal time solution to the firing squad synchronization problem
Kenichiro Noguchi
Theoretical Computer Science
314
(3), 2004, pp. 303-334
Efficiency and equilibrium in the electronic mail game; The general case
Nicola Dimitri
Theoretical Computer Science
314
(3), 2004, pp. 335-349
Randomness in secret sharing and visual cryptography schemes
Annalisa De Bonis
,
Alfredo De Santis
Theoretical Computer Science
314
(3), 2004, pp. 351-374
Wide-sense nonblocking for symmetric or asymmetric 3-stage Clos networks under various routing strategies
F.H. Chang
,
J.Y. Guo
,
F.K. Hwang
,
C.K. Lin
Theoretical Computer Science
314
(3), 2004, pp. 375-386
Hierarchies of tree series transformations
Zoltán Fülöp
,
Zsolt Gazdag
,
Heiko Vogler
Theoretical Computer Science
314
(3), 2004, pp. 387-429
Linear array and ring embeddings in conditional faulty hypercubes
Chang-Hsiung Tsai
Theoretical Computer Science
314
(3), 2004, pp. 431-443
Context-freeness of the power of context-free languages is undecidable
Henning Bordihn
Theoretical Computer Science
314
(3), 2004, pp. 445-449
Representing recursively enumerable languages by iterated deletion
Michael Domaratzki
,
Alexander Okhotin
Theoretical Computer Science
314
(3), 2004, pp. 451-457
On the sequential access theorem and deque conjecture for splay trees
Amr Elmasry
Theoretical Computer Science
314
(3), 2004, pp. 459-466