Edsger W. Dijkstra

Edsger W. Dijkstra: My recollections of operating system design. Operating Systems Review 39(2): 4-40 (2005)

Edsger W. Dijkstra: EWD1300: The Notational Conventions I Adopted, and Why. Formal Asp. Comput. 14(2): 99-107 (2002)

Edsger W. Dijkstra: The end of computing science? Commun. ACM 44(3): 92 (2001)

Edsger W. Dijkstra: Under the spell of Leibniz's dream. Inf. Process. Lett. 77(2-4): 53-61 (2001)

Edsger W. Dijkstra, Jayadev Misra: Designing a Calculational Proof of Cantor's Theorem. The American Mathematical Monthly 108(5): 440-443 (2001)

Edsger W. Dijkstra: On the transitive closure of a wellfounded relation. The School of Niklaus Wirth 2000: 31-40

Edsger W. Dijkstra: Fibonacci and the greatest common divisor. NATO ASI DPD 1996: 7-10

Edsger W. Dijkstra: The balance and the coins. NATO ASI DPD 1996: 11-13

Edsger W. Dijkstra: Bulterman's theorem on shortest trees. NATO ASI DPD 1996: 15-16

Edsger W. Dijkstra: A prime is in at most 1 way the sum of 2 squares. NATO ASI DPD 1996: 17-20

Edsger W. Dijkstra: A bagatelle on Euclid's algorithm. NATO ASI DPD 1996: 21-23

Edsger W. Dijkstra: On two equations that have the same extreme solution. NATO ASI DPD 1996: 25-26

Edsger W. Dijkstra: An alternative of the ETAC to EWD1163. NATO ASI DPD 1996: 27-28

Edsger W. Dijkstra: The argument about the arithmetic mean and the geometric mean, heuristics included. NATO ASI DPD 1996: 29-32

Edsger W. Dijkstra: Heuristics for a Calculational Proof. Inf. Process. Lett. 53(3): 141-143 (1995)

Edsger W. Dijkstra: On the Economy of doing Mathematics. MPC 1992: 2-10

Edsger W. Dijkstra, Carel S. Scholten: Predicate calculus and program semantics. Texts and monographs in computer science, Springer 1990, isbn 978-3-540-96957-0, pp. I-X, 1-220

Edsger W. Dijkstra: Making a Fair Roulette From a Possibly Biased Coin. Inf. Process. Lett. 36(4): 193 (1990)

Edsger W. Dijkstra, W. H. J. Feijen: The Linear Search Revisited. Structured Programming 10(1): 5-9 (1989)

Edsger W. Dijkstra, W. H. J. Feijen: A method of programming. Addison-Wesley 1988, isbn 978-0-201-17536-3, pp. I-VIII, 1-188

Edsger W. Dijkstra: On Binary Operators and Their Derived Relations. BIT 28(3): 378-382 (1988)

Edsger W. Dijkstra: A Heuristic Explanation of Batcher's Baffler. Sci. Comput. Program. 9(3): 213-220 (1987)

Edsger W. Dijkstra, A. J. M. van Gasteren: A Simple Fixpoint Argument Without the Restriction to Continuity. Acta Inf. 23(1): 1-7 (1986)

Edsger W. Dijkstra: A Belated Proof of Self-Stabilization. Distributed Computing 1(1): 5-6 (1986)

Edsger W. Dijkstra: Solutions of a Problem in Concurrent Programming Control (Reprint). Commun. ACM 26(1): 21-22 (1983)

Edsger W. Dijkstra: The Structure of "THE"-Multiprogramming System (Reprint). Commun. ACM 26(1): 49-52 (1983)

Edsger W. Dijkstra, W. H. J. Feijen, A. J. M. van Gasteren: Derivation of a Termination Detection Algorithm for Distributed Computations. Inf. Process. Lett. 16(5): 217-219 (1983)

Edsger W. Dijkstra: The fruits of misunderstanding. Elektronische Rechenanlagen 25(6): 10-13 (1983)

Edsger W. Dijkstra: Selected writings on computing - a personal perspective. Texts and monographs in computer science, Springer 1982, isbn 978-3-540-90652-0, pp. I-XVII, 1-362

Edsger W. Dijkstra, A. J. M. van Gasteren: An Introduction to Three Algorithms for Sorting in Situ. Inf. Process. Lett. 15(3): 129-134 (1982)

Edsger W. Dijkstra: Smoothsort, an Alternative for Sorting In Situ. Sci. Comput. Program. 1(3): 223-233 (1982)

Edsger W. Dijkstra: How do we tell truths that might hurt? SIGPLAN Notices 17(5): 13-15 (1982)

Edsger W. Dijkstra: A Word of Welcome. Sci. Comput. Program. 1(1-2): 3-4 (1981)

Edsger W. Dijkstra: Some Beautiful Arguments Using Mathematical Induction. Acta Inf. 13: 1-8 (1980)

Edsger W. Dijkstra, Carel S. Scholten: Termination Detection for Diffusing Computations. Inf. Process. Lett. 11(1): 1-4 (1980)

Edsger W. Dijkstra: Software Engineering : As It Should Be. ICSE 1979: 442-448

Edsger W. Dijkstra, Leslie Lamport, Alain J. Martin, Carel S. Scholten, Elisabeth F. M. Steffens: On-the-Fly Garbage Collection: An Exercise in Cooperation. Commun. ACM 21(11): 966-975 (1978)

Edsger W. Dijkstra: Finding the Correctness Proof of a Concurrent Program. MFCS 1978: 31-38

Edsger W. Dijkstra: A More Formal Treatment of a Less Simple Example. Program Construction 1978: 2-20

Edsger W. Dijkstra: Stationary Behaviour of Some Ternary Networks. Program Construction 1978: 21-23

Edsger W. Dijkstra: Finding the Correctness Proof of a Concurrent Program. Program Construction 1978: 24-34

Edsger W. Dijkstra: On the Interplay between Mathematics and Programming. Program Construction 1978: 35-46

Edsger W. Dijkstra: A Theorem about Odd Powers of Odd Integers. Program Construction 1978: 47-48

Edsger W. Dijkstra: In Honour of Fibonacci. Program Construction 1978: 49-50

Edsger W. Dijkstra: On the Foolishness of "Natural Language Programming". Program Construction 1978: 51-53

Edsger W. Dijkstra: Program Inversion. Program Construction 1978: 54-57

Edsger W. Dijkstra: Programming: From Craft to Scientific Discipline. International Computing Symposium 1977: 23-30

Edsger W. Dijkstra: A Discipline of Programming. Prentice-Hall 1976

Edsger W. Dijkstra: On a Gauntlet Thrown by David Gries. Acta Inf. 6: 357-359 (1976)

Edsger W. Dijkstra: Formal Techniques and Sizeable Programs. ECI 1976: 225-235

Edsger W. Dijkstra: The Effective Arrangement of Logical Systems. MFCS 1976: 39-51

Edsger W. Dijkstra: Guarded Commands, Nondeterminacy and Formal Derivation of Programs. Commun. ACM 18(8): 453-457 (1975)

Edsger W. Dijkstra: On the teaching of programming, i. e. on the teaching of thinking. Language Hierarchies and Interfaces 1975: 1-10

Edsger W. Dijkstra, Leslie Lamport, Alain J. Martin, Carel S. Scholten, Elisabeth F. M. Steffens: On-the-fly garbage collection: an exercise in cooperation. Language Hierarchies and Interfaces 1975: 43-56

Edsger W. Dijkstra: Guarded commands, non-determinancy and a calculus for the derivation of programs. Language Hierarchies and Interfaces 1975: 111-124

Edsger W. Dijkstra: A time-wise hierarchy imposed upon the use of a two-level store. Language Hierarchies and Interfaces 1975: 345-357

Edsger W. Dijkstra: Craftsman or Scientist. ACM Pacific 1975: 217-223

Edsger W. Dijkstra: Self-stabilizing Systems in Spite of Distributed Control. Commun. ACM 17(11): 643-644 (1974)

Edsger W. Dijkstra: The Humble Programmer. Commun. ACM 15(10): 859-866 (1972)

Edsger W. Dijkstra: Information Streams Sharing a Finite Buffer. Inf. Process. Lett. 1(5): 179-180 (1972)

Edsger W. Dijkstra: A class of allocation strategies inducing bounded delays only. AFIPS Spring Joint Computing Conference 1972: 933-936

Edsger W. Dijkstra: Hierarchical Ordering of Sequential Processes. Acta Inf. 1: 115-138 (1971)

Edsger W. Dijkstra: Letters to the editor: go to statement considered harmful. Commun. ACM 11(3): 147-148 (1968)

Edsger W. Dijkstra: The Structure of "THE"-Multiprogramming System. Commun. ACM 11(5): 341-346 (1968)

John R. Rice, Edsger W. Dijkstra: Letters to the editor: The go to statement reconsidered. Commun. ACM 11(8): 538 (1968)

Edsger W. Dijkstra: Solution of a problem in concurrent programming control. Commun. ACM 8(9): 569 (1965)

Edsger W. Dijkstra: Some comments on the aims of MIRFAC. Commun. ACM 7(3): 190 (1964)

Edsger W. Dijkstra: Some Meditations on Advanced Programming. IFIP Congress 1962: 535-538

Edsger W. Dijkstra: Letter to the editor: defense of ALGOL 60. Commun. ACM 4(11): 502-503 (1961)

Edsger W. Dijkstra: Communication with an Automatic Computer. Excelsior University of Amsterdam 1959

Edsger W. Dijkstra, W. Heise, Alan J. Perlis, Klaus Samelson: ALGOL Sub-Committee Report - Extensions. Commun. ACM 2(9): 24 (1959)