**EWD number** |
**Size (KB)** |
**Title** |

**700** |
60 |
An examination exercise, designed by W.H.J.Feijen |

**701** |
47 |
Two theorems on (what I have called) continuously mixed sequences |

**702** |
277 |
In reaction to Ernest Chang's ``Deadlock Detection'' |

**703** |
189 |
A tutorial on the split binary semaphore |

**704** |
51 |
A machine for image construction in tomography |

**705** |
92 |
Verkavelde berekeningen, hun mogelijkheden en moeilijkheden |

**706** |
244 |
Image reconstruction in two-dimensional tomography |

**707** |
37 |
Dear Mr.X of Company Y |

**708** |
76 |
When messages may crawl |

**709** |
344 |
My hopes of computing science |

**710** |
64 |
When messages may crawl, II (A sequel to EWD708) |

**711** |
151 |
Trip report E.W.Dijkstra, Ithaca, Albany, Austin (Texas), 26/5 - 10/6 1979 |

**712** |
58 |
Trip report E.W.Dijkstra, Antwerp, 24-29 June 1979 |

**713** |
41 |
On a problem posed by W.H.J.Feijen |

**714** |
268 |
Trip report E.W.Dijkstra, Mission Viejo, Santa Cruz, Austin, 29 July - 8 September 1979 |

**715** |
109 |
Trip report E.W.Dijkstra, Munich - London, 16-29 September 1979 |

**716** |
118 |
A short talk to my students about money |

**717** |
75 |
An exercise in exposition |

**718** |
272 |
Assembly conventions for the EDSAC |

**719** |
267 |
On not duplicating volatile information |

**720** |
258 |
Why correctness must be a mathematical concern |

**721** |
199 |
The design of a state space with a useful structure (I) |

**722** |
74 |
A book review for the IBM Systems Journal |

**723** |
98 |
On W.H.J.Feijen's solution for the lexicographic minimum of a circular list |

**724** |
62 |
Een gotspe |

**724E** |
78 |
A chutspa |

**725** |
108 |
Trip report E.W.Dijkstra, Liege, Nov.-Dec.1979 |

**726** |
57 |
How Dutch Informatics fell between two chairs |

**727** |
192 |
Trip report E.W.Dijkstra, U.S.A. 12 Jan. - 2 Feb. 1980 |

**728** |
24 |
A problem solved by Netty van Gasteren and me |

**729** |
143 |
On well-shaped mathematical arguments |

**730** |
63 |
On two types of infinite sets of infinite sequences (by the Tuesday Afternoon Club) |

**731** |
103 |
An experiment in mathematical exposition |

**732** |
247 |
The teachability of mathematical thinking (Draft contribution to ``Mathematics Tomorrow'') |

**733** |
96 |
Naar aanleiding van ``Experimentele post-propadeuse opleiding voor informatica-ingenieur aan de THE'' (Eindhoven februari 1980 SOO/jc/sdb) |

**734** |
104 |
The superfluity of the general semaphore |

**735** |
207 |
A mild variant of Combinatory Logic |

**736** |
92 |
Recording the structure of trees in their leaves |

**737** |
93 |
A notational alternative for quantification |

**738** |
67 |
More mathematical folklore |

**739** |
39 |
A somewhat open letter to the Editor-in-Chief of Acta Informatica |

**740** |
22 |
A short proof of one of Fermat's theorems |

**741** |
20 |
Partitioning the edges of the complete graphs into trees or cycles (by the Tuesday Afternoon Club) |

**742** |
24 |
A sequel to EWD740 |

**743** |
109 |
A new policy for Mathematics Inc.? |

**744** |
207 |
A short note on symmetric distributed arbitration |

**745** |
353 |
Trip report E.W.Dijkstra, Los Angeles, Austin (Texas), and Portland, 6-28 August 1980 |

**746** |
171 |
Trip report E.W.Dijkstra, Newcastle-upon-Tyne, 1-5 Sep. 1980 |

**747** |
237 |
Comments on MIL-STD-1862, 28 May 1980 |

**748** |
134 |
A somewhat open letter to Wladislaw M.Turski |

**749** |
175 |
On the productivity of recursive definitions |

**750** |
97 |
American programming's plight |

**751** |
77 |
Mainly on the omission of parentheses |

**752** |
539 |
Distributed Arbitration (DRAFT, with C.S.Scholten) |

**753** |
56 |
On a theorem by Lambek and Moser |

**754** |
24 |
An error in EWD744 |

**755** |
137 |
Very elementary number theory redone |

**756** |
39 |
A postscript to EWD755 |

**757** |
173 |
A misguided educational effort |

**758** |
58 |
An intriguing example |

**759** |
40 |
A somewhat open letter to D.A.Turner |

**760** |
91 |
A somewhat open letter to F.Kroeger |

**761** |
81 |
Een kanttekening |

**762** |
85 |
We mathematicians are losing the race |

**763** |
29 |
A proof by Rutger M.Dijkstra and me |

**764** |
303 |
Repaying our debts |

**765** |
95 |
A Hungarian problem |

**766** |
41 |
An educational stupidity |

**767** |
27 |
A.J.Martin's solution of the Hungarian problem |

**768** |
132 |
Largely on nomenclature |

**770** |
104 |
D.A.Turner's reply |

**771** |
26 |
About 2-coloured 6-graphs |

**772** |
75 |
A methodological sequel to EWD771 |

**773** |
90 |
Trip report E.W.Dijkstra, Han-sur-Lesse, 7-12 Jan. 1981 |

**774** |
152 |
Trip report E.W.Dijkstra, California, 17-31 January 1981 |

**775** |
65 |
On Kleinrock's Theorem |

**776** |
99 |
Lambek and Moser revisited |

**777** |
71 |
A word of welcome (Draft) |

**778** |
45 |
A somewhat open letter to Nils J.Nilsson |

**779** |
109 |
An assertional proof of a program by G.L.Peterson |

**780** |
73 |
Proving the existence of the Euler line (with A.J.M. van Gasteren) |

**781** |
371 |
About the presentation of programs (with A.J.M. van Gasteren) |

**782** |
89 |
A stupid notation |

**783** |
114 |
The administration as social disease |

**784** |
44 |
My mother's contribution to Honsberger's collection |

**785** |
92 |
Our presentation of K.A.Post's proof of R.Stanley's theorem (with A.J.M. van Gasteren) |

**786** |
93 |
Trip report E.W.Dijkstra, England, 23 April 1981 |

**786a** |
54 |
Sets are Unibags |

**787** |
45 |
A (new?) proof of a theorem of Euler's on partitions |

**788** |
242 |
What we seem to have learned (with A.J.M. van Gasteren) |

**789** |
71 |
A minor improvement of Heapsort |

**789a** |
122 |
A minor improvement of Heapsort |

**789b** |
140 |
A minor improvement of Heapsort |

**790** |
58 |
Trip report E.W.Dijkstra, Muenchen, 19 May 1981 |

**791** |
157 |
The psychology of the user |

**792** |
95 |
Hamming's exercise in SASL |

**793** |
51 |
The analysis of a two-person game |

**794** |
153 |
Heapsort (with A.J.M. van Gasteren and W.H.J.Feijen) |

**795** |
96 |
An alternative to heapsort for sorting in situ |

**796** |
323 |
Smoothsort, an alternative for sorting in situ |

**796a** |
330 |
Smoothsort, an alternative for sorting in situ |

**797** |
159 |
Fibonacci numbers and Leonardo numbers |

**798** |
138 |
Trip report E.W.Dijkstra, Newcastle, 19-25 July 1981 |

**799** |
188 |
Trip report E.W.Dijkstra, Marktoberdorf, 26/7-10/8/81 |