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=244
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Computational ideal theory in finitely generated extension rings
Joachim Apel
Theoretical Computer Science
244
(1-2), 2000, pp. 1-33
Recursive circulants and their embeddings among hypercubes
Jung-Heum Park
,
Kyung-Yong Chwa
Theoretical Computer Science
244
(1-2), 2000, pp. 35-62
The monadic second-order logic of graphs XIII: Graph drawings with edge crossings
Bruno Courcelle
Theoretical Computer Science
244
(1-2), 2000, pp. 63-94
Convexity and logical analysis of data
Oya Ekin
,
Peter L. Hammer
,
Alexander Kogan
Theoretical Computer Science
244
(1-2), 2000, pp. 95-116
On D0L power series
Juha Honkala
Theoretical Computer Science
244
(1-2), 2000, pp. 117-134
Structural measures for games and process control in the branch learning model
Matthias Ott
,
Frank Stephan
Theoretical Computer Science
244
(1-2), 2000, pp. 135-165
The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs
Hans L. Bodlaender
,
Michael R. Fellows
,
Michael T. Hallett
,
H. Todd Wareham
,
Tandy J. Warnow
Theoretical Computer Science
244
(1-2), 2000, pp. 167-188
Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights
Peter Jonsson
Theoretical Computer Science
244
(1-2), 2000, pp. 189-203
A second step towards complexity-theoretic analogs of Rice's theorem
Lane A. Hemaspaandra
,
Jörg Rothe
Theoretical Computer Science
244
(1-2), 2000, pp. 205-217
Investigating topological chaos by elementary cellular automata dynamics
Gianpiero Cattaneo
,
Michele Finelli
,
Luciano Margara
Theoretical Computer Science
244
(1-2), 2000, pp. 219-241
The firing squad synchronization problem on Cayley graphs
Zsuzsanna Róka
Theoretical Computer Science
244
(1-2), 2000, pp. 243-256
Characterizing the existence of one-way permutations
Lane A. Hemaspaandra
,
Jörg Rothe
Theoretical Computer Science
244
(1-2), 2000, pp. 257-261
Applications of the representation of finite fields by matrices
Eric Kern
,
Maurice Mignotte
Theoretical Computer Science
244
(1-2), 2000, pp. 263-265
A short solution for the HDT0L sequence equivalence problem
Juha Honkala
Theoretical Computer Science
244
(1-2), 2000, pp. 267-270
Generalization of automatic sequences for numeration systems on a regular language
Michel Rigo
Theoretical Computer Science
244
(1-2), 2000, pp. 271-281
The zero-one law holds for
\cal BPP
Dieter van Melkebeek
Theoretical Computer Science
244
(1-2), 2000, pp. 283-288
Colonies with limited activation of components
Jozef Kelemen
,
Alica Kelemenová
,
Carlos Martín-Vide
,
Victor Mitrana
Theoretical Computer Science
244
(1-2), 2000, pp. 289-298