Edsger W. Dijkstra

Publication Activity (10 Years)

Years Active: 1959-2005
Publications (10 Years): 0

University of Amsterdam (PHD)

Education History

University of Amsterdam

PHD

Publications

Edsger W. Dijkstra
My recollections of operating system design. ACM SIGOPS Oper. Syst. Rev. 39 (2) (2005)
Edsger W. Dijkstra
EWD1300: The Notational Conventions I Adopted, and Why. Formal Aspects Comput. 14 (2) (2002)
Edsger W. Dijkstra
The end of computing science? Commun. ACM 44 (3) (2001)
Edsger W. Dijkstra
Under the spell of Leibniz's dream. Inf. Process. Lett. 77 (2-4) (2001)
Edsger W. Dijkstra, Jayadev Misra
Designing a Calculational Proof of Cantor's Theorem. Am. Math. Mon. 108 (5) (2001)
Edsger W. Dijkstra
On the transitive closure of a wellfounded relation. The School of Niklaus Wirth (2000)
Edsger W. Dijkstra
The argument about the arithmetic mean and the geometric mean, heuristics included. NATO ASI DPD (1996)
Edsger W. Dijkstra
A bagatelle on Euclid's algorithm. NATO ASI DPD (1996)
Edsger W. Dijkstra
The balance and the coins. NATO ASI DPD (1996)
Edsger W. Dijkstra
A prime is in at most 1 way the sum of 2 squares. NATO ASI DPD (1996)
Edsger W. Dijkstra
Bulterman's theorem on shortest trees. NATO ASI DPD (1996)
Edsger W. Dijkstra
Fibonacci and the greatest common divisor. NATO ASI DPD (1996)
Edsger W. Dijkstra
On two equations that have the same extreme solution. NATO ASI DPD (1996)
Edsger W. Dijkstra
An alternative of the ETAC to EWD1163. NATO ASI DPD (1996)
Edsger W. Dijkstra
Heuristics for a Calculational Proof. Inf. Process. Lett. 53 (3) (1995)
Edsger W. Dijkstra
The Unification of Three Calculi. NATO ASI PDC (1992)
Edsger W. Dijkstra
On the Economy of doing Mathematics. MPC (1992)
Edsger W. Dijkstra
Making a Fair Roulette From a Possibly Biased Coin. Inf. Process. Lett. 36 (4) (1990)
Edsger W. Dijkstra, W. H. J. Feijen
The Linear Search Revisited. Struct. Program. 10 (1) (1989)
Edsger W. Dijkstra
Position paper on "fairness". ACM SIGSOFT Softw. Eng. Notes 13 (2) (1988)
Edsger W. Dijkstra
On Binary Operators and Their Derived Relations. BIT 28 (3) (1988)
Edsger W. Dijkstra
A Heuristic Explanation of Batcher's Baffler. Sci. Comput. Program. 9 (3) (1987)
Edsger W. Dijkstra
A Belated Proof of Self-Stabilization. Distributed Comput. 1 (1) (1986)
Edsger W. Dijkstra, A. J. M. van Gasteren
A Simple Fixpoint Argument Without the Restriction to Continuity. Acta Informatica 23 (1) (1986)
Edsger W. Dijkstra
The fruits of misunderstanding. Elektron. Rechenanlagen 25 (6) (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) (1983)
Edsger W. Dijkstra
Solutions of a Problem in Concurrent Programming Control (Reprint). Commun. ACM 26 (1) (1983)
Edsger W. Dijkstra
The Structure of "THE"-Multiprogramming System (Reprint). Commun. ACM 26 (1) (1983)
Edsger W. Dijkstra
How do we tell truths that might hurt? ACM SIGPLAN Notices 17 (5) (1982)
Edsger W. Dijkstra
Smoothsort, an Alternative for Sorting In Situ. Sci. Comput. Program. 1 (3) (1982)
Edsger W. Dijkstra, A. J. M. van Gasteren
An Introduction to Three Algorithms for Sorting in Situ. Inf. Process. Lett. 15 (3) (1982)
Edsger W. Dijkstra
American programming's plight. ACM SIGSOFT Softw. Eng. Notes 6 (1) (1981)
Edsger W. Dijkstra
A Word of Welcome. Sci. Comput. Program. 1 (1-2) (1981)
Edsger W. Dijkstra, Carel S. Scholten
Termination Detection for Diffusing Computations. Inf. Process. Lett. 11 (1) (1980)
Edsger W. Dijkstra
Some Beautiful Arguments Using Mathematical Induction. Acta Informatica 13 (1980)
Edsger W. Dijkstra
Software Engineering : As It Should Be. ICSE (1979)
Edsger W. Dijkstra
Stationary Behaviour of Some Ternary Networks. Program Construction (1978)
Edsger W. Dijkstra
Program Inversion. Program Construction (1978)
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) (1978)
Edsger W. Dijkstra
On the Foolishness of "Natural Language Programming". Program Construction (1978)
Edsger W. Dijkstra
A More Formal Treatment of a Less Simple Example. Program Construction (1978)
Edsger W. Dijkstra
Finding the Correctness Proof of a Concurrent Program. MFCS (1978)
Edsger W. Dijkstra
On the Interplay between Mathematics and Programming. Program Construction (1978)
Edsger W. Dijkstra
DoD-I: the summing up. ACM SIGPLAN Notices 13 (7) (1978)
Edsger W. Dijkstra
A Theorem about Odd Powers of Odd Integers. Program Construction (1978)
Edsger W. Dijkstra, Richard A. DeMillo, Richard J. Lipton, Alan J. Perlis
On a political pamphlet from the middle ages. ACM SIGSOFT Softw. Eng. Notes 3 (2) (1978)
Edsger W. Dijkstra
Finding the Correctness Proof of a Concurrent Program. Program Construction (1978)
Edsger W. Dijkstra
In Honour of Fibonacci. Program Construction (1978)
Edsger W. Dijkstra
A position paper on software reliability. ACM SIGSOFT Softw. Eng. Notes 2 (5) (1977)
Edsger W. Dijkstra
Programming: From Craft to Scientific Discipline. International Computing Symposium (1977)
Edsger W. Dijkstra
Formal Techniques and Sizeable Programs. ECI (1976)
Edsger W. Dijkstra
On a Gauntlet Thrown by David Gries. Acta Informatica 6 (1976)
Edsger W. Dijkstra
The Effective Arrangement of Logical Systems. MFCS (1976)
Edsger W. Dijkstra
On the teaching of programming, i. e. on the teaching of thinking. Language Hierarchies and Interfaces (1975)
Edsger W. Dijkstra
Guarded commands, non-determinacy and a calculus for the derivation of programs. Reliable Software (1975)
Edsger W. Dijkstra
Guarded Commands, Nondeterminacy and Formal Derivation of Programs. Commun. ACM 18 (8) (1975)
Edsger W. Dijkstra
Guarded commands, non-determinancy and a calculus for the derivation of programs. Language Hierarchies and Interfaces (1975)
Edsger W. Dijkstra
A time-wise hierarchy imposed upon the use of a two-level store. Language Hierarchies and Interfaces (1975)
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)
Edsger W. Dijkstra
Correctness concerns and, among other things, why they are resented. Reliable Software (1975)
Edsger W. Dijkstra
Craftsman or Scientist. ACM Pacific (1975)
Edsger W. Dijkstra
Self-stabilizing Systems in Spite of Distributed Control. Commun. ACM 17 (11) (1974)
Edsger W. Dijkstra
The Humble Programmer. Commun. ACM 15 (10) (1972)
Edsger W. Dijkstra
Information Streams Sharing a Finite Buffer. Inf. Process. Lett. 1 (5) (1972)
Edsger W. Dijkstra
A class of allocation strategies inducing bounded delays only. AFIPS Spring Joint Computing Conference (1972)
Edsger W. Dijkstra
Hierarchical Ordering of Sequential Processes. Acta Informatica 1 (1971)
Edsger W. Dijkstra
Letters to the editor: go to statement considered harmful. Commun. ACM 11 (3) (1968)
Edsger W. Dijkstra
The Structure of "THE"-Multiprogramming System. Commun. ACM 11 (5) (1968)
John R. Rice, Edsger W. Dijkstra
Letters to the editor: The go to statement reconsidered. Commun. ACM 11 (8) (1968)
Edsger W. Dijkstra
The structure of the "THE"-multiprogramming system. SOSP (1967)
Edsger W. Dijkstra
Solution of a problem in concurrent programming control. Commun. ACM 8 (9) (1965)
Edsger W. Dijkstra
Some comments on the aims of MIRFAC. Commun. ACM 7 (3) (1964)
Edsger W. Dijkstra
Operating Experience with ALGOL 60. Comput. J. 5 (2) (1962)
Edsger W. Dijkstra
Some Meditations on Advanced Programming. IFIP Congress (1962)
Edsger W. Dijkstra
Letter to the editor: defense of ALGOL 60. Commun. ACM 4 (11) (1961)
Edsger W. Dijkstra
A note on two problems in connexion with graphs. Numerische Mathematik 1 (1959)
Edsger W. Dijkstra, W. Heise, Alan J. Perlis, Klaus Samelson
ALGOL Sub-Committee Report - Extensions. Commun. ACM 2 (9) (1959)

Edsger W. Dijkstra.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Edsger W. Dijkstra