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=238
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The tree equivalence of linear recursion schemes
V. Sabelfeld
Theoretical Computer Science
238
(1-2), 2000, pp. 1-29
Generating irregular partitionable data structures
Prakash Panangaden
,
Clark Verbrugge
Theoretical Computer Science
238
(1-2), 2000, pp. 31-80
Towards a unified view of bisimulation: A comparative study
Markus Roggenbach
,
Mila Majster-Cederbaum
Theoretical Computer Science
238
(1-2), 2000, pp. 81-130
Type dependencies for logic programs using ACI-unification
Michael Codish
,
Vitaly Lagoon
Theoretical Computer Science
238
(1-2), 2000, pp. 131-159
Process languages and nets
Ludwik Czaja
Theoretical Computer Science
238
(1-2), 2000, pp. 161-181
Confluence of extensional and non-extensional
\lambda
-calculi with explicit substitutions
Delia Kesner
Theoretical Computer Science
238
(1-2), 2000, pp. 183-220
Loop checking in SLD-derivations by well-quasi-ordering of goals
Giuliano Pacini
,
Maria I. Sessa
Theoretical Computer Science
238
(1-2), 2000, pp. 221-246
Congruential complements of ground term rewrite systems
Sándor Vágvölgyi
Theoretical Computer Science
238
(1-2), 2000, pp. 247-274
Fixpoint semantics and simulation
Wim H. Hesselink
,
Albert Thijs
Theoretical Computer Science
238
(1-2), 2000, pp. 275-311
A complexity analysis of bisimilarity for value-passing processes
Michele Boreale
,
Luca Trevisan
Theoretical Computer Science
238
(1-2), 2000, pp. 313-345
A read-once lower bound and a
(1,+k)
-hierarchy for branching programs
P. Savický
,
S. Z̑ak
Theoretical Computer Science
238
(1-2), 2000, pp. 347-362
Generalized filter models
Ines Margaria
,
Maddalena Zacchi
Theoretical Computer Science
238
(1-2), 2000, pp. 363-387
Linda-based applicative and imperative process algebras
Rocco de Nicola
,
Rosario Pugliese
Theoretical Computer Science
238
(1-2), 2000, pp. 389-437
Pattern-matching algorithms based on term rewrite systems
Joost-Pieter Katoen
,
Albert Nymeyer
Theoretical Computer Science
238
(1-2), 2000, pp. 439-464
Weak confluence and
\tau
-inertness
Mingsheng Ying
Theoretical Computer Science
238
(1-2), 2000, pp. 465-475
No feasible monotone interpolation for simple combinatorial reasoning
Noriko H. Arai
Theoretical Computer Science
238
(1-2), 2000, pp. 477-482
Strictly causal functions have unique fixed point
Holger Naundorf
Theoretical Computer Science
238
(1-2), 2000, pp. 483-488
What is a (non-constructive) non-monotone logical system?
Ph. Besnard
,
T. Schaub
Theoretical Computer Science
238
(1-2), 2000, pp. 489-494
DNF tautologies with a limited number of occurrences of every variable
P. Savický
,
Jiȓí Sgall
Theoretical Computer Science
238
(1-2), 2000, pp. 495-498