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=94
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Semantics of order-sorted specifications
Uwe Waldmann
Theoretical Computer Science
94
, 1992, pp. 1-35
Quantitative domains and infinitary algebras
François Lamarche
Theoretical Computer Science
94
, 1992, pp. 37-62
Domains for logic programming
I. Filippenko
,
F.L. Morris
Theoretical Computer Science
94
, 1992, pp. 63-99
Soundness and completeness of the Birkhoff equational calculus for many-sorted algebras with possibly empty carrier sets
Vincenzo Manca
,
Antonino Salibra
Theoretical Computer Science
94
, 1992, pp. 101-124
Clocks in dataflow languages
Paul Caspi
Theoretical Computer Science
94
, 1992, pp. 125-140
Adequacy-preserving transformations of COSY path programs
Maciej Koutny
Theoretical Computer Science
94
, 1992, pp. 141-158
Pattern spectra, substring enumeration, and automatic sequences
Jean-Paul Allouche
,
Patrick Morton
,
Jeffrey Shallit
Theoretical Computer Science
94
, 1992, pp. 161-174
On a rational approximation problem in the real Hardy space
H_2
L. Baratchart
,
M. Olivi
,
F. Wielonsky
Theoretical Computer Science
94
, 1992, pp. 175-197
Problème de mots dans les gerbes libres
Patrick Dehornoy
Theoretical Computer Science
94
, 1992, pp. 199-213
Tiling the Morse sequence
Sébastien Ferenczi
Theoretical Computer Science
94
, 1992, pp. 215-221
Systèmes de numération linéaires et
\Theta
-représentations
Christiane Frougny
Theoretical Computer Science
94
, 1992, pp. 223-236
Program development in constructive type theory
Didier Galmiche
Theoretical Computer Science
94
, 1992, pp. 237-259
Méthode de col et lois limites en analyse combinatoire
Danièle Gardy
Theoretical Computer Science
94
, 1992, pp. 261-280
Complete extension of general logic programs
Bernhard Gil
Theoretical Computer Science
94
, 1992, pp. 281-294
Artin-Schreier curves, exponential sums, and coding theory
Gilles Lachaud
Theoretical Computer Science
94
, 1992, pp. 295-310
The
\cal NU
system as a development system for concurrent programs:
\delta {\cal NU}
Dominique Méry
Theoretical Computer Science
94
, 1992, pp. 311-334
Recursive programming with proofs
Michel Parigot
Theoretical Computer Science
94
, 1992, pp. 335-356
On positive matrices
Dominique Perrin
Theoretical Computer Science
94
, 1992, pp. 357-366
A note on renewal systems
Antonio Restivo
Theoretical Computer Science
94
, 1992, pp. 367-371
Some studies on the
(p,q)
-type sequences
Zhi-Xiong Wen
,
Zhi-Ying Wen
Theoretical Computer Science
94
, 1992, pp. 373-393