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=77
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Abstract language design
Laurette Bradley
Theoretical Computer Science
77
, 1990, pp. 5-26
Computability problems in the development of algebraic module specifications
Hartmut Ehrig
,
Werner Fey
,
Horst Hansen
,
Michael Löwe
,
Dean Jacobs
,
Francesco Parisi-Presicce
Theoretical Computer Science
77
, 1990, pp. 27-71
Category-sorted algebra-based action semantics
Susan Even
,
David A. Schmidt
Theoretical Computer Science
77
, 1990, pp. 73-95
Transformations of sequential specifications into concurrent specifications by synchronization guards
Ryszard Janicki
,
Tomasz Müldner
Theoretical Computer Science
77
, 1990, pp. 97-129
Equational type logic
V. Manca
,
A. Salibra
,
G. Scollo
Theoretical Computer Science
77
, 1990, pp. 131-159
Data types over multiple-valued logics
Don Pigozzi
Theoretical Computer Science
77
, 1990, pp. 161-194
An algebraically specified language for data directed design
Eric W. Wagner
Theoretical Computer Science
77
, 1990, pp. 195-219
Positive relativizations for log space computability
Seinosuke Toda
Theoretical Computer Science
77
(3), 1990, December, pp. 221-235
Constructions effective sur les séries formelles d'arbres
Symeon Bozapalides
Theoretical Computer Science
77
(3), 1990, December, pp. 237-247
On the inference of approximate programs
Carl H. Smith
,
Mahendran Velauthapillai
Theoretical Computer Science
77
(3), 1990, December, pp. 249-266
Pushout-complements and basic concepts of grammars in toposes
Yasuo Kawahara
Theoretical Computer Science
77
(3), 1990, December, pp. 267-289
Efficient and optimal query answering on independent schemes
Paolo Atzeni
,
Edward P.F. Chan
Theoretical Computer Science
77
, 1990, December, pp. 291-308
The fixed point of logic programs with Herbrand base
N
William F. Dowling
,
Robert Kline
Theoretical Computer Science
77
, 1990, December, pp. 309-319
Analysis of Petri nets by partitioning: Splitting transitions
Hossam Mahmoud Ahmad Fahmy
Theoretical Computer Science
77
, 1990, December, pp. 321-330
Construction of Voronoi diagrams in the plane by using maps
Mounir Elbaz
,
Jean-Claude Spehner
Theoretical Computer Science
77
, 1990, December, pp. 331-343