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=17
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Position-restricted grammar forms and grammars
M. Blattner
,
S. Ginsburg
Theoretical Computer Science
17
, 1982, pp. 1-27
Colour-families are dense
E. Welzl
Theoretical Computer Science
17
, 1982, pp. 29-41
Structure preserving elimination of null productions from context-free grammars
E. Ukkonen
Theoretical Computer Science
17
, 1982, pp. 43-54
Some simplified undecidable and
NP
-hard problems for simple programs
E.M. Gurari
,
O.H. Ibarra
Theoretical Computer Science
17
, 1982, pp. 55-73
A note on natural complete sets and Gödel numberings
J. Hartmanis
Theoretical Computer Science
17
, 1982, pp. 75-89
The subgraph isomorphism problem for outerplanar graphs (Note)
M.M. Sysƚo
Theoretical Computer Science
17
, 1982, pp. 91-97
Decidability of ``Skolem matrix emptiness problem'' entails constructability of exact regular expression (Note)
M. Karpinski
Theoretical Computer Science
17
, 1982, pp. 99-102
On minimal graphs (Note)
W.D. Fellner
Theoretical Computer Science
17
, 1982, pp. 103-110
Floyd's principle, correctness theories and program equivalence
J.A. Bergstra
,
J. Tiuryn
,
J.V. Tucker
Theoretical Computer Science
17
, 1982, pp. 113-149
Epis need not be dense
D. Lehmann
,
A. Pasztor
Theoretical Computer Science
17
, 1982, pp. 151-161
Attribute grammars and recursive Program schemes I
B. Courcelle
,
P. Franchi-Zannettacci
Theoretical Computer Science
17
, 1982, pp. 163-191
A complete logic for reasoning about programs via nonstandard model theory I
H. Andréka
,
I. Németi
,
I. Sain
Theoretical Computer Science
17
, 1982, pp. 193-212
The complexity of a multiprocessor task assignment problem without deadlines (Note)
R.D. Dutton
,
B.C. Brigham
Theoretical Computer Science
17
, 1982, pp. 213-216
Graph theoretic characterization of
G
-schemes and
TL
-schemes (Note)
J.C. Shepherdson
Theoretical Computer Science
17
, 1982, pp. 217-228
A note on representations of a certain monoid (Note)
C. Squier
,
C. Wrathall
Theoretical Computer Science
17
, 1982, pp. 229-231
Attribute grammars and recursive program schemes II
B. Courcelle
,
P. Franchi-Zannettacci
Theoretical Computer Science
17
, 1982, pp. 235-257
A complete logic for reasoning about programs via nonstandard model theory II
H. Andréka
,
I. Németi
,
I. Sain
Theoretical Computer Science
17
, 1982, pp. 259-278
Orderings for term-rewriting systems
N. Dershowitz
Theoretical Computer Science
17
, 1982, pp. 279-301
Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs
J.A. Bergstra
,
J.V. Tucker
Theoretical Computer Science
17
, 1982, pp. 303-315
The theory of functional and template dependencies
F. Sadri
,
J.D. Ullman
Theoretical Computer Science
17
, 1982, pp. 317-331
On a characterization of pushdown permuters (Note)
R.K. Shyamasundar
Theoretical Computer Science
17
, 1982, pp. 333-341
Every free algebra in the variety generated by the representable dynamic algebras is separable and representable (Note)
I. Németi
Theoretical Computer Science
17
, 1982, pp. 343-347