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=208
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Relating rewriting techniques on monoids and rings: Congruences on monoids and ideals in monoid rings
Klaus Madlener
,
Birgit Reinert
Theoretical Computer Science
208
(1-2), 1998, pp. 3-31
Rewrite orderings for higher-order terms in
\eta
-long
\beta
-normal form and the recursive path ordering
Jean-Pierre Jouannaud
,
Albert Rubio
Theoretical Computer Science
208
(1-2), 1998, pp. 33-58
Modular aspects of term graph rewriting
M.R.K. Krishna Rao
Theoretical Computer Science
208
(1-2), 1998, pp. 59-86
Semantics and strong sequentiality of priority term rewriting systems
Masahiko Sakai
,
Yoshihito Toyama
Theoretical Computer Science
208
(1-2), 1998, pp. 87-110
A decision algorithm for distributive unification
Manfred Schmidt-Schauss̈
Theoretical Computer Science
208
(1-2), 1998, pp. 111-148
Superposition theorem proving for Abelian groups represented as integer modules
Jürgen Stuber
Theoretical Computer Science
208
(1-2), 1998, pp. 149-177
The first-order theory of linear one-step rewriting is undecidable
Ralf Treinen
Theoretical Computer Science
208
(1-2), 1998, pp. 179-190