Edsger W. Dijkstra
According to our database^{1},
Edsger W. Dijkstra
authored at least 77 papers
between 1959 and 2005.
Collaborative distances:
Collaborative distances:
Awards
Turing Prize recipient
Turing Prize 1972, "For fundamental contributions to programming as a high, intellectual challenge; for eloquent insistence and practical demonstration that programs should be composed correctly, not just debugged into correctness; for illuminating perception of problems at the foundations of program design".
ACM Fellow
ACM Fellow 1994, "Edsger Dijkstra was a principal contributor in the late 1950's to the development of the ALGOL, a high level programming language which has become a model of clarity and mathematical rigor. He is one of the principal exponents of the science and art of programming languages in general, and has greatly contributed to our understanding of their structure, representation, and implementation. His fifteen years of publications extend from theoretical articles on graph theory to basic manuals, expository texts, and philosophical contemplations in the field of programming languages.".
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at zbmath.org

at wikidata.org

at scopus.com

at viaf.org

at id.loc.gov

at dnb.info

at isni.org

at dl.acm.org
On csauthors.net:
Bibliography
2005
My recollections of operating system design.
Operating Systems Review, 2005
2002
EWD1300: The Notational Conventions I Adopted, and Why.
Formal Asp. Comput., 2002
Go to Statement Considered Harmful (Reprint).
Proceedings of the Software Pioneers., 2002
Solution of a Problem in Concurrent Programming Control (Reprint).
Proceedings of the Software Pioneers., 2002
EWD 1308: What Led to "Notes on Structured Programming".
Proceedings of the Software Pioneers., 2002
2001
Designing a Calculational Proof of Cantor's Theorem.
Am. Math. Mon., 2001
Under the spell of Leibniz's dream.
Inf. Process. Lett., 2001
The end of computing science?
Commun. ACM, 2001
2000
On the transitive closure of a wellfounded relation.
Proceedings of the School of Niklaus Wirth, "The Art of Simplicity", 2000
1996
The argument about the arithmetic mean and the geometric mean, heuristics included.
Proceedings of the NATO Advanced Study Institute on Deductive Program Design, 1996
An alternative of the ETAC to EWD1163.
Proceedings of the NATO Advanced Study Institute on Deductive Program Design, 1996
On two equations that have the same extreme solution.
Proceedings of the NATO Advanced Study Institute on Deductive Program Design, 1996
A bagatelle on Euclid's algorithm.
Proceedings of the NATO Advanced Study Institute on Deductive Program Design, 1996
A prime is in at most 1 way the sum of 2 squares.
Proceedings of the NATO Advanced Study Institute on Deductive Program Design, 1996
Bulterman's theorem on shortest trees.
Proceedings of the NATO Advanced Study Institute on Deductive Program Design, 1996
The balance and the coins.
Proceedings of the NATO Advanced Study Institute on Deductive Program Design, 1996
Fibonacci and the greatest common divisor.
Proceedings of the NATO Advanced Study Institute on Deductive Program Design, 1996
1995
Heuristics for a Calculational Proof.
Inf. Process. Lett., 1995
1992
The Unification of Three Calculi.
Proceedings of the Program Design Calculi, Proceedings of the NATO Advanced Study Institute on Program Design Calculi, Marktoberdorf, Germany, July 28, 1992
On the Economy of doing Mathematics.
Proceedings of the Mathematics of Program Construction, Second International Conference, Oxford, UK, June 29, 1992
1990
Making a Fair Roulette From a Possibly Biased Coin.
Inf. Process. Lett., 1990
Predicate Calculus and Program Semantics.
Texts and Monographs in Computer Science, Springer, ISBN: 9781461232285, 1990
1989
The Linear Search Revisited.
Struct. Program., 1989
1988
On Binary Operators and Their Derived Relations.
BIT Comput. Sci. Sect., 1988
A method of programming.
AddisonWesley, ISBN: 9780201175363, 1988
1987
A Heuristic Explanation of Batcher's Baffler.
Sci. Comput. Program., 1987
1986
A Belated Proof of SelfStabilization.
Distributed Comput., 1986
A Simple Fixpoint Argument Without the Restriction to Continuity.
Acta Informatica, 1986
1985
Methodik des Programmierens.
Internationale ComputerBibliothek, AddisonWesley, ISBN: 9783925118180, 1985
1983
The fruits of misunderstanding.
Elektron. Rechenanlagen, 1983
Derivation of a Termination Detection Algorithm for Distributed Computations.
Inf. Process. Lett., 1983
The Structure of "THE"Multiprogramming System (Reprint).
Commun. ACM, 1983
Solutions of a Problem in Concurrent Programming Control (Reprint).
Commun. ACM, 1983
1982
How do we tell truths that might hurt?
ACM SIGPLAN Notices, 1982
Smoothsort, an Alternative for Sorting In Situ.
Sci. Comput. Program., 1982
An Introduction to Three Algorithms for Sorting in Situ.
Inf. Process. Lett., 1982
Selected Writings on Computing: A Personal Perspective.
Texts and Monographs in Computer Science, Springer, ISBN: 9781461256953, 1982
1981
A Word of Welcome.
Sci. Comput. Program., 1981
1980
Termination Detection for Diffusing Computations.
Inf. Process. Lett., 1980
Some Beautiful Arguments Using Mathematical Induction.
Acta Informatica, 1980
1979
Software Engineering : As It Should Be.
Proceedings of the 4th International Conference on Software Engineering, 1979
1978
OntheFly Garbage Collection: An Exercise in Cooperation.
Commun. ACM, 1978
Program Inversion.
Proceedings of the Program Construction, International Summer School, July 26, 1978
On the Foolishness of "Natural Language Programming".
Proceedings of the Program Construction, International Summer School, July 26, 1978
In Honour of Fibonacci.
Proceedings of the Program Construction, International Summer School, July 26, 1978
A Theorem about Odd Powers of Odd Integers.
Proceedings of the Program Construction, International Summer School, July 26, 1978
On the Interplay between Mathematics and Programming.
Proceedings of the Program Construction, International Summer School, July 26, 1978
Stationary Behaviour of Some Ternary Networks.
Proceedings of the Program Construction, International Summer School, July 26, 1978
A More Formal Treatment of a Less Simple Example.
Proceedings of the Program Construction, International Summer School, July 26, 1978
Finding the Correctness Proof of a Concurrent Program.
Proceedings of the Mathematical Foundations of Computer Science 1978, 1978
1977
Programming: From Craft to Scientific Discipline.
Proceedings of the International Computing Symposium 1977, 1977
1976
On a Gauntlet Thrown by David Gries.
Acta Informatica, 1976
The Effective Arrangement of Logical Systems.
Proceedings of the Mathematical Foundations of Computer Science 1976, 1976
Formal Techniques and Sizeable Programs.
Proceedings of the ECI Conference 1976, 1976
A Discipline of Programming.
PrenticeHall, ISBN: 013215871X, 1976
1975
Guarded Commands, Nondeterminacy and Formal Derivation of Programs.
Commun. ACM, 1975
Craftsman or Scientist.
Proceedings of the Data: Its Use, 1975
A timewise hierarchy imposed upon the use of a twolevel store.
Proceedings of the Language Hierarchies and Interfaces, International Summer School, Marktoberdorf, Germany, July 23, 1975
Guarded commands, nondeterminancy and a calculus for the derivation of programs.
Proceedings of the Language Hierarchies and Interfaces, International Summer School, Marktoberdorf, Germany, July 23, 1975
On the teaching of programming, i. e. on the teaching of thinking.
Proceedings of the Language Hierarchies and Interfaces, International Summer School, Marktoberdorf, Germany, July 23, 1975
1974
Selfstabilizing Systems in Spite of Distributed Control.
Commun. ACM, 1974
1972
Information Streams Sharing a Finite Buffer.
Inf. Process. Lett., 1972
The Humble Programmer.
Commun. ACM, 1972
A class of allocation strategies inducing bounded delays only.
Proceedings of the American Federation of Information Processing Societies: AFIPS Conference Proceedings: 1972 Spring Joint Computer Conference, 1972
Structured programming.
A.P.I.C. Studies in data processing 8, Academic Press, ISBN: 9780122005503, 1972
1971
Hierarchical Ordering of Sequential Processes.
Acta Informatica, 1971
1968
Letters to the editor: The go to statement reconsidered.
Commun. ACM, 1968
Letters to the editor: go to statement considered harmful.
Commun. ACM, 1968
The Structure of "THE"Multiprogramming System.
Commun. ACM, 1968
1965
Solution of a problem in concurrent programming control.
Commun. ACM, 1965
1964
Some comments on the aims of MIRFAC.
Commun. ACM, 1964
1962
Operating Experience with ALGOL 60.
Comput. J., 1962
Some Meditations on Advanced Programming.
Proceedings of the Information Processing, Proceedings of the 2nd IFIP Congress 1962, Munich, Germany, August 27, 1962
1961
Letter to the editor: defense of ALGOL 60.
Commun. ACM, 1961
1959
Communication with an Automatic Computer
PhD thesis, 1959
A note on two problems in connexion with graphs.
Numerische Mathematik, 1959
ALGOL SubCommittee Report  Extensions.
Commun. ACM, 1959