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=79
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The zig-zag power series: a two-way version of the * operator
M. Anselmo
Theoretical Computer Science
79
, 1991, pp. 3-24
Ranking and formal power series
Alberto Bertoni
,
Danilo Bruschi
,
Massimiliano Goldwurm
Theoretical Computer Science
79
, 1991, pp. 25-35
Automatic average-case analysis of algorithms
Philippe Flajolet
,
Bruno Salvy
,
Paul Zimmermann
Theoretical Computer Science
79
, 1991, pp. 37-109
Some examples of formal series used in non-commutative algebra
Daniel Krob
Theoretical Computer Science
79
, 1991, pp. 111-135
Automata and languages generalized to
\omega
-continuous semirings
Werner Kuich
Theoretical Computer Science
79
, 1991, pp. 137-150
Approximation of nonlinear dynamic systems by rational series
Christiane Hespel
,
Gérard Jacob
Theoretical Computer Science
79
, 1991, pp. 151-162
Evaluation transform
V. Hoang Ngoc Minh
Theoretical Computer Science
79
, 1991, pp. 163-177
A combinatorial approach to nonlinear functional expansions: An introduction with an example
Pierre Leroux
,
Xavier Gérard Viennot
Theoretical Computer Science
79
, 1991, pp. 179-193
Computation, on Macsyma, of the minimal differential representation of noncommutative polynomials
N.E. Oussous
Theoretical Computer Science
79
, 1991, pp. 195-207
Enumeration of polyominoes using Macsyma
M. Delest
Theoretical Computer Science
79
, 1991, pp. 209-226
Orthogonal projection onto the free Lie algebra
Gérard Duchamp
Theoretical Computer Science
79
, 1991, pp. 227-239
Jeux de mots dans les algèbres de Lie libres: quelques bases et formules
Pierre-Vincent Koseleff
Theoretical Computer Science
79
, 1991, pp. 241-256
Shuffle product of generating series
F. Rotella
Theoretical Computer Science
79
, 1991, pp. 257-261
On algebraic generalized zeta functions of formal power series
Juha Honkala
Theoretical Computer Science
79
, 1991, pp. 263-273
Determinism
\rightarrow
(event structure isomorphism = step sequence equivalence)
Frits W. Vaandrager
Theoretical Computer Science
79
, 1991, pp. 275-294
Weak logic theory
Marit Holden
Theoretical Computer Science
79
, 1991, pp. 295-321
Regularity of relations: A measure of uniformity
A. Jaoua
,
A. Mili
,
N. Boudriga
,
J.L. Durieux
Theoretical Computer Science
79
, 1991, pp. 323-339
On strictly arithmetical completeness in logics of programs
Andrzej Szalas
Theoretical Computer Science
79
, 1991, pp. 341-355
Interdefinability of parallel operations in PCF
Allen Stoughton
Theoretical Computer Science
79
, 1991, pp. 357-358
The dependent product construction in various categories of domains
Achim Jung
Theoretical Computer Science
79
, 1991, pp. 359-363
Polymorphic lambda calculus: the Church-Rosser property
George Koletsos
Theoretical Computer Science
79
, 1991, pp. 365-371