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=72
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Topological invariants of classification problems
Lothar Budach
Theoretical Computer Science
72
, 1990, pp. 3-26
Improved limitedness theorems on finite automata with distance functions
Kosaburo Hashiguchi
Theoretical Computer Science
72
, 1990, pp. 27-38
Non-repetitive words relative to a rewriting system
Arturo Carpi
,
Aldo de Luca
Theoretical Computer Science
72
, 1990, pp. 39-53
Codes and local constraints
Antonio Restivo
Theoretical Computer Science
72
, 1990, pp. 55-64
Factorization forests of finite height
Imre Simon
Theoretical Computer Science
72
, 1990, pp. 65-94
Dynamic maintenance of directed hypergraphs
Giuseppe Ausiello
,
Umberto Nanni
,
Giuseppe F. Italiano
Theoretical Computer Science
72
, 1990, pp. 97-117
Combinatory differential fields
E. Engeler
Theoretical Computer Science
72
, 1990, pp. 119-131
On completeness of narrowing strategies
Rachid Echahed
Theoretical Computer Science
72
, 1990, pp. 133-146
Analysis of dynamic algorithms in Knuth's model
J. Françon
,
B. Randrianarimanana
,
R. Schott
Theoretical Computer Science
72
, 1990, pp. 147-167
Equational completion in order-sorted algebras
Isabelle Gnaedig
,
Claude Kirchner
,
Hélène Kirchner
Theoretical Computer Science
72
, 1990, pp. 169-202
A
^2
CCS: Atomic actions for CCS
Roberto Gorrieri
,
Sergio Marchetti
,
Ugo Montanari
Theoretical Computer Science
72
, 1990, pp. 203-223
Implementing term rewrite languages in Dactl
Richard Kennaway
Theoretical Computer Science
72
, 1990, pp. 225-249
A tight upper bound for the path length of AVL trees
Rolf Klein
,
Derick Wood
Theoretical Computer Science
72
, 1990, pp. 251-264
Proof systems or satisfiabilty in Hennessy-Milner logic with recursion
Kim G. Larsen
Theoretical Computer Science
72
, 1990, pp. 265-288