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=237
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The monadic second-order logic of graphs XII: Planar graphs and planar maps
Bruno Courcelle
Theoretical Computer Science
237
(1-2), 2000, pp. 1-32
Resource bounded randomness and computational complexity
Yongge Wang
Theoretical Computer Science
237
(1-2), 2000, pp. 33-55
Decomposition of a hypergraph by partial-edge separators
Francesco Mario Malvestuto
,
Marina Moscarini
Theoretical Computer Science
237
(1-2), 2000, pp. 57-79
Reductions and functors from problems to word problems
Jean-Camille Birget
Theoretical Computer Science
237
(1-2), 2000, pp. 81-104
A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
Petra Schuurman
,
Gerhard J. Woeginger
Theoretical Computer Science
237
(1-2), 2000, pp. 105-122
Some APX-completeness results for cubic graphs
Paola Alimonti
,
Viggo Kann
Theoretical Computer Science
237
(1-2), 2000, pp. 123-134
On the computational power of context-free PC grammar systems
Niculae Mandache
Theoretical Computer Science
237
(1-2), 2000, pp. 135-148
A shrinking lemma for random forbidding context languages
Andries van der Walt
,
Sigrid Ewert
Theoretical Computer Science
237
(1-2), 2000, pp. 149-158
Asymptotically efficient in-place merging
Viliam Geffert
,
Jyrki Katajainen
,
Tomi Pasanen
Theoretical Computer Science
237
(1-2), 2000, pp. 159-181
Leftmove-bounded picture languages
Changwook Kim
,
Ivan Hal Sudborough
Theoretical Computer Science
237
(1-2), 2000, pp. 183-195
Non-cancellative Boolean circuits: A generalization of monotone Boolean circuits
Rimli Sengupta
,
H. Venkateswaran
Theoretical Computer Science
237
(1-2), 2000, pp. 197-212
The Steiner tree problem for terminals on the boundary of a rectilinear polygon
Siu-Wing Cheng
Theoretical Computer Science
237
(1-2), 2000, pp. 213-238
Fast pattern matching in indexed texts
Jean Senellart
Theoretical Computer Science
237
(1-2), 2000, pp. 239-262
Fibonacci arrays and their two-dimensional repetitions
Alberto Apostolico
,
Valentin E. Brimkov
Theoretical Computer Science
237
(1-2), 2000, pp. 263-273
Quantum automata and quantum grammars
Cristopher Moore
,
James P. Crutchfield
Theoretical Computer Science
237
(1-2), 2000, pp. 275-306
Realtime subshifts
Petr Kůrka
,
Alejandro Maass
Theoretical Computer Science
237
(1-2), 2000, pp. 307-325
A space lower bound for
st
-connectivity on node-named JAGs
Chung Keung Poon
Theoretical Computer Science
237
(1-2), 2000, pp. 327-345
Series-parallel languages and the bounded-width property
K. Lodaya
,
P. Weil
Theoretical Computer Science
237
(1-2), 2000, pp. 347-380
Complexity of path discovery game problems
Hiroaki Tohyama
,
Akeo Adachi
Theoretical Computer Science
237
(1-2), 2000, pp. 381-406
On the design of a constructive algorithm to solve the multi-peg towers of Hanoi problem
U.K. Sarkar
Theoretical Computer Science
237
(1-2), 2000, pp. 407-421
Terminating left-hand sides of scattered context productions
Alexander Meduna
Theoretical Computer Science
237
(1-2), 2000, pp. 423-427
On the bottleneck counting argument
Janos Simon
,
Shi-Chun Tsai
Theoretical Computer Science
237
(1-2), 2000, pp. 429-437
The intersection of retracts of
A^*
James A. Anderson
Theoretical Computer Science
237
(1-2), 2000, pp. 439-445
On Hadamard square roots of unity
B. Litow
Theoretical Computer Science
237
(1-2), 2000, pp. 447-454
Improved approximate pattern matching on hypertext
Gonzalo Navarro
Theoretical Computer Science
237
(1-2), 2000, pp. 455-463
Seiten 1
2
>