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=236
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Formalism and method
Egidio Astesiano
,
Gianna Reggio
Theoretical Computer Science
236
(1-2), 2000, pp. 3-34
Specification and proof in membership equational logic
Adel Bouhoula
,
Jean-Pierre Jouannaud
,
José Meseguer
Theoretical Computer Science
236
(1-2), 2000, pp. 35-132
Termination of term rewriting using dependency pairs
Thomas Arts
,
Jürgen Giesl
Theoretical Computer Science
236
(1-2), 2000, pp. 133-178
Maximum packing for
k
-connected partial
k
-trees in polynomial time
Anders Dessmark
,
Andrzej Lingas
,
Andrzej Proskurowski
Theoretical Computer Science
236
(1-2), 2000, pp. 179-191
A characterization of alternating
\log
time by ramified recurrence
Daniel Leivant
,
Jean-Yves Marion
Theoretical Computer Science
236
(1-2), 2000, pp. 193-208
Logicality of conditional rewrite systems
Toshiyuki Yamada
,
Jürgen Avenhaus
,
Carlos Loría-Sáenz
,
Aart Middeldorp
Theoretical Computer Science
236
(1-2), 2000, pp. 209-232