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=259
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Theory of genetic algorithms
Lothar M. Schmitt
Theoretical Computer Science
259
(1-2), 2001, pp. 1-61
The complexity of multiple sequence alignment with
SP
-score that is a metric
Paola Bonizzoni
,
Gianluca Della Vedova
Theoretical Computer Science
259
(1-2), 2001, pp. 63-79
Reconstructing polyatomic structures from discrete X-rays:
NP
-completeness proof for three atoms
Marek Chrobak
,
Christoph Dürr
Theoretical Computer Science
259
(1-2), 2001, pp. 81-98
NP
-problems are tractable in the space of cellular automata in the hyperbolic plane
Maurice Margenstern
,
Kenichi Morita
Theoretical Computer Science
259
(1-2), 2001, pp. 99-128
On time optimal solutions of the firing squad synchronization problem for two-dimensional paths
Kojiro Kobayashi
Theoretical Computer Science
259
(1-2), 2001, pp. 129-143
Words and special factors
Arturo Carpi
,
Aldo de Luca
Theoretical Computer Science
259
(1-2), 2001, pp. 145-182
New types of automata to solve fixed point problems
Ines Klimann
Theoretical Computer Science
259
(1-2), 2001, pp. 183-197
Determining presentations of sofic shifts
Paul Trow
Theoretical Computer Science
259
(1-2), 2001, pp. 199-216
On the parallel approximability of a subclass of quadratic programming
Maria Serna
,
Fatos Xhafa
Theoretical Computer Science
259
(1-2), 2001, pp. 217-231
Finding houses and holes in graphs
Chính T. Hoàng
,
R. Sritharan
Theoretical Computer Science
259
(1-2), 2001, pp. 233-244
Applications quasi-affines et pavages du plan discret
Marie-Andrée Jacob-Da Col
Theoretical Computer Science
259
(1-2), 2001, pp. 245-269
Kolmogorov complexity and cellular automata classification
J.-C. Dubacq
,
B. Durand
,
E. Formenti
Theoretical Computer Science
259
(1-2), 2001, pp. 271-285
Dynamic algorithms for classes of constraint satisfaction problems
Daniele Frigioni
,
Alberto Marchetti-Spaccamela
,
Umberto Nanni
Theoretical Computer Science
259
(1-2), 2001, pp. 287-305
The giant component threshold for random regular graphs with edge faults
Andreas Goerdt
Theoretical Computer Science
259
(1-2), 2001, pp. 307-321
Approximation of some
NP
-hard optimization problems by finite machines, in probability
Dawei Hong
,
Jean-Camille Birget
Theoretical Computer Science
259
(1-2), 2001, pp. 323-339
Nesting of prime substructures in
k
-ary relations
Paola Bonizzoni
,
Ross M. McConnell
Theoretical Computer Science
259
(1-2), 2001, pp. 341-357
Concurrent multicast in weighted networks
Gianluca de Marco
,
Luisa Gargano
,
Ugo Vaccaro
Theoretical Computer Science
259
(1-2), 2001, pp. 359-377
Decimation-invariant sequences and their automaticity
A. Barbé
,
G. Skordev
Theoretical Computer Science
259
(1-2), 2001, pp. 379-403
Hybrid modes in cooperating distributed grammar systems: Internal versus external hybridization
H. Fernau
,
M. Holzer
,
R. Freund
Theoretical Computer Science
259
(1-2), 2001, pp. 405-426
Robust learning with infinite additional information
Susanne Kaufmann
,
Frank Stephan
Theoretical Computer Science
259
(1-2), 2001, pp. 427-454
Costs of general purpose learning
John Case
,
Keh-Jiann Chen
,
Sanjay Jain
Theoretical Computer Science
259
(1-2), 2001, pp. 455-473
Alternation for sublogarithmic space-bounded alternating pushdown automata
Jianliang Xu
,
Tsunehiro Yoshinaga
,
Katsushi Inoue
,
Yue Wang
,
Akira Ito
Theoretical Computer Science
259
(1-2), 2001, pp. 475-492
Efficient algorithms for chemical threshold testing problems
Annalisa de Bonis
,
Luisa Gargano
,
Ugo Vaccaro
Theoretical Computer Science
259
(1-2), 2001, pp. 493-511
Long words: The theory of concatenation and
\omega
-power
Stepehn L. Bloom
,
Christian Choffrut
Theoretical Computer Science
259
(1-2), 2001, pp. 533-548
Monotone term decision lists
David Guijarro
,
Víctor Lavín
,
Vijay Raghavan
Theoretical Computer Science
259
(1-2), 2001, pp. 549-575
Seiten 1
2
>