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=67
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the inference of strategies
Charles Swart
,
Dana Richards
Theoretical Computer Science
67
, 1989, pp. 5-18
On deciding confluence of finite string-rewriting systems modulo partial commutativity
Friedrich Otto
Theoretical Computer Science
67
, 1989, pp. 19-35
A geometrical approach to multiset orderings
Ursula Martin
Theoretical Computer Science
67
, 1989, pp. 37-54
Fast generalized Fourier transforms
Michael Clausen
Theoretical Computer Science
67
, 1989, pp. 55-63
Minimal automaton for a factorial, transitive, and rational language
Danièle Beauquier
Theoretical Computer Science
67
, 1989, pp. 65-73
A grammatical characterization of alternating pushdown automata
Etsuro Moriya
Theoretical Computer Science
67
, 1989, pp. 75-85
On a conjecture of Bergstra and Tucker
G. Marongiu
,
S. Tulipani
Theoretical Computer Science
67
, 1989, pp. 87-97
A leaf-size hierarchy of two-dimensional alternating Turing machines
Katsushi Inoue
,
Itsuo Takanami
,
Juraj Hromkovic̑
Theoretical Computer Science
67
, 1989, pp. 99-110
Nondeterministic multicounter machines and complementation
Dana Pardubská
,
Ivana S̑tefáneková
Theoretical Computer Science
67
, 1989, pp. 111-113
Complexity of selection in
X + Y
M. Cosnard
,
J. Duprat
,
A. Ferreira
Theoretical Computer Science
67
, 1989, pp. 115-120
Entropie topologique des systèmes spécifiés
Catherine Petuaud
Theoretical Computer Science
67
, 1989, pp. 121-128
Decidability of the restriction equational theory in the partial
\lambda
-calculus
Ramón Pino Perez
Theoretical Computer Science
67
, 1989, pp. 129-139
About the descriptive power of certain classes of finite string-rewriting systems
Klaus Madlener
,
Friedrich Otto
Theoretical Computer Science
67
, 1989, pp. 143-172
Completion for rewriting modulo a congruence
Leo Bachmair
,
Nachum Dershowitz
Theoretical Computer Science
67
, 1989, pp. 173-201
Complete sets of transformations for general
E
-unification
Jean H. Gallier
,
Wayne Snyder
Theoretical Computer Science
67
, 1989, pp. 203-260
Complexity analysis of term-rewriting systems
C. Choppy
,
S. Kaplan
,
M. Soria
Theoretical Computer Science
67
, 1989, pp. 261-282
Term-rewriting systems with rule priorities
J.C.M. Baeten
,
J.A. Bergstra
,
J.W. Klop
,
W.P. Weijland
Theoretical Computer Science
67
, 1989, pp. 283-301
Schematization of infinite sets of rewrite rules generated by divergent completion processes
Hélène Kirchner
Theoretical Computer Science
67
, 1989, pp. 303-332