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=13
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An extensional treatment of dataflow deadlock
W.W. Wadge
Theoretical Computer Science
13
, 1981, pp. 3-15
On describing the behavior and implementation of distributed systems
N.A. Lynch
,
M.J. Fischer
Theoretical Computer Science
13
, 1981, pp. 17-43
The temporal semantics of concurrent programs
A. Pnueli
Theoretical Computer Science
13
, 1981, pp. 45-60
Modeling a solution for a control problem in distributed systems by restrictions
A. Maggiolo-Schettini
,
H. Wedde
,
J. Winkowski
Theoretical Computer Science
13
, 1981, pp. 61-83
Petri nets, events structures and domains, Part I
M. Nielsen
,
G. Plotkin
,
G. Winskel
Theoretical Computer Science
13
, 1981, pp. 85-108
Systems modeling with high-level Petri nets
H.J. Genrich
,
K. Lautenbach
Theoretical Computer Science
13
, 1981, pp. 109-136
A generalization of the Schützenberger product of finite monoids
H. Straubing
Theoretical Computer Science
13
, 1981, pp. 137-150
The congruence of two programming language definitions
J.E. Stoy
Theoretical Computer Science
13
, 1981, pp. 151-174
On the total correctness of nondeterministic programs
D. Harel
Theoretical Computer Science
13
, 1981, pp. 175-192
Nondeterministic flowchart programs with recursive procedures: Semantics and correctness I
J.H. Gallier
Theoretical Computer Science
13
, 1981, pp. 193-223
The undecidability of the second-order unification problem (Note)
W.D. Goldfarb
Theoretical Computer Science
13
, 1981, pp. 225-230
Remark on the star-height-problem (Note)
W. Thomas
Theoretical Computer Science
13
, 1981, pp. 231-237
Nondeterministic flowchart programs with recursive procedures: Semantics and correctness II
J.H. Gallier
Theoretical Computer Science
13
, 1981, pp. 239-270
Generalized Galois theory and its applications to complexity
Erwin Engeler
Theoretical Computer Science
13
, 1981, pp. 271-293
The complexity of the equivalence problem for two characterizations of Presburger sets
E.M. Gurari
,
O.H. Ibarra
Theoretical Computer Science
13
, 1981, pp. 295-314
A comparison of two variations of a pebble game on graphs (Note)
F. Meyer auf der Heide
Theoretical Computer Science
13
, 1981, pp. 315-322
Succinct representation of regular languages by Boolean automata (Note)
E. Leiss
Theoretical Computer Science
13
, 1981, pp. 323-330
Linear-time string-matching using only a fixed number of local storage locations (Note)
Z. Galil
,
J. Seiferas
Theoretical Computer Science
13
, 1981, pp. 331-336