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
[1]
Hilfe
Suche: Author="Dijkstra, E.W."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A simple fixpoint argument without the restriction to continuity
E.W. Dijkstra
,
A.J.M. van Gasteren
Acta Informatica
23
(1), 1986, pp. 1-7
Derivation of a termination detection algorithm for distributed computations
E.W. Dijkstra
,
W.H.J. Feijen
,
A.J.M. van Gasteren
Information Processing Letters
16
(5), 1983, June, pp. 217-219
An introduction to three algorithms for sorting in situ
E.W. Dijkstra
,
A.J.M. van Gasteren
Information Processing Letters
15
(3), 1982, October, pp. 129-134
Some beautiful arguments using mathematical induction
E.W. Dijkstra
Acta Informatica
13
(1), 1980, January, pp. 1-8
A parallel garbage collector
E.W. Dijkstra
misc, 1975
Guarded commands, nndeterminacy and formal derivation of programs
E.W. Dijkstra
Communications of the ACM
18
(8), 1975, August, pp. 453-457
Hierarchical ordering of sequential processes
E.W. Dijkstra
Acta Informatica
1
, 1971, pp. 115-138
The structure of the ``THE''-multiprogramming system
E.W. Dijkstra
Communications of the ACM
11
(5), 1968, May, pp. 341-346
Cooperating sequential processes
E.W. Dijkstra
Programming Languages, 1968, pp. 43-112
Solution of problem in concurrent programming control
E.W. Dijkstra
Communications of the ACM
8
(9), 1965, September, pp. 569
Self-stabilizing systems in spite of distributed oontrol
E.W. Dijkstra
Communications of the ACM
17
(11), 1965, September, pp. 643-644
A note on two problems in connexion with graphs
E.W. Dijkstra
Numer. Math.
1
, 1959, pp. 269-271