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=223
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
New methods for 3-SAT decision and worst-case analysis
O. Kullmann
Theoretical Computer Science
223
(1-2), 1999, pp. 1-72
Palindromes and Sturmian words
Xavier Droubay
,
Giuseppe Pirillo
Theoretical Computer Science
223
(1-2), 1999, pp. 73-85
Independent parallelism in finite copying parallel rewriting systems
Owen Rambow
,
Giorgio Satta
Theoretical Computer Science
223
(1-2), 1999, pp. 87-120
Towards an algorithmic theory of adaptation
Jean-Denis Fouks
Theoretical Computer Science
223
(1-2), 1999, pp. 121-142
HRNCE grammars - A hypergraph generating system with an eNCE way of rewriting
Changwook Kim
,
Tae Eui Jeong
Theoretical Computer Science
223
(1-2), 1999, pp. 143-178
A new planarity test
Wei-Kuan Shih
,
Wen-Lian Hsu
Theoretical Computer Science
223
(1-2), 1999, pp. 179-191
Nontrivial monotone weakly symmetric Boolean functions with six variables are elusive
Sui-Xiang Gao
,
Xiao-Dong Hu
,
Weili Wu
Theoretical Computer Science
223
(1-2), 1999, pp. 193-197