default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdsger W. Dijkstra
Person information
- award (1972): Turing Award
- award (2002): Dijkstra Prize
- award (1974): Harry H. Goode Memorial Award
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1990
[b7]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- 1988
- [b6]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 - 1985
- [b5]Edsger W. Dijkstra, Wim H. J. Feijen:
Methodik des Programmierens. Internationale Computer-Bibliothek, Addison-Wesley 1985, ISBN 978-3-925118-18-0, pp. 1-239 - 1982
- [b4]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 - 1976
- [b3]Edsger W. Dijkstra:
A Discipline of Programming. Prentice-Hall 1976, ISBN 013215871X, pp. I-XVII, 1-217 - 1972
- [b2]Ole-Johan Dahl, Edsger W. Dijkstra, Charles Antony Richard Hoare:
Structured programming. A.P.I.C. Studies in data processing 8, Academic Press 1972, ISBN 978-0-12-200550-3, pp. I-VIII, 1-220 - 1959
- [b1]Edsger W. Dijkstra:
Communication with an Automatic Computer. University of Amsterdam, Excelsior 1959
Journal Articles
- 2005
- [j43]Edsger W. Dijkstra:
My recollections of operating system design. ACM SIGOPS Oper. Syst. Rev. 39(2): 4-40 (2005) - 2002
- [j42]Edsger W. Dijkstra:
EWD1300: The Notational Conventions I Adopted, and Why. Formal Aspects Comput. 14(2): 99-107 (2002) - 2001
- [j41]Edsger W. Dijkstra:
The end of computing science? Commun. ACM 44(3): 92 (2001) - [j40]Edsger W. Dijkstra:
Under the spell of Leibniz's dream. Inf. Process. Lett. 77(2-4): 53-61 (2001) - [j39]Edsger W. Dijkstra, Jayadev Misra:
Designing a Calculational Proof of Cantor's Theorem. Am. Math. Mon. 108(5): 440-443 (2001) - 1995
- [j38]Edsger W. Dijkstra:
Heuristics for a Calculational Proof. Inf. Process. Lett. 53(3): 141-143 (1995) - 1990
- [j37]Edsger W. Dijkstra:
Making a Fair Roulette From a Possibly Biased Coin. Inf. Process. Lett. 36(4): 193 (1990) - 1989
- [j36]Edsger W. Dijkstra, W. H. J. Feijen:
The Linear Search Revisited. Struct. Program. 10(1): 5-9 (1989) - 1988
- [j35]Edsger W. Dijkstra:
On Binary Operators and Their Derived Relations. BIT 28(3): 377-382 (1988) - [j34]Edsger W. Dijkstra:
Position paper on "fairness". ACM SIGSOFT Softw. Eng. Notes 13(2): 18-20 (1988) - 1987
- [j33]Edsger W. Dijkstra:
A Heuristic Explanation of Batcher's Baffler. Sci. Comput. Program. 9(3): 213-220 (1987) - 1986
- [j32]Edsger W. Dijkstra, A. J. M. van Gasteren:
A Simple Fixpoint Argument Without the Restriction to Continuity. Acta Informatica 23(1): 1-7 (1986) - [j31]Edsger W. Dijkstra:
A Belated Proof of Self-Stabilization. Distributed Comput. 1(1): 5-6 (1986) - 1983
- [j30]Edsger W. Dijkstra:
Solutions of a Problem in Concurrent Programming Control (Reprint). Commun. ACM 26(1): 21-22 (1983) - [j29]Edsger W. Dijkstra:
The Structure of "THE"-Multiprogramming System (Reprint). Commun. ACM 26(1): 49-52 (1983) - [j28]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) - [j27]Edsger W. Dijkstra:
The fruits of misunderstanding. Elektron. Rechenanlagen 25(6): 10-13 (1983) - 1982
- [j26]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) - [j25]Edsger W. Dijkstra:
Smoothsort, an Alternative for Sorting In Situ. Sci. Comput. Program. 1(3): 223-233 (1982) - [j24]Edsger W. Dijkstra:
How do we tell truths that might hurt? ACM SIGPLAN Notices 17(5): 13-15 (1982) - 1981
- [j23]Edsger W. Dijkstra:
A Word of Welcome. Sci. Comput. Program. 1(1-2): 3-4 (1981) - [j22]Edsger W. Dijkstra:
American programming's plight. ACM SIGSOFT Softw. Eng. Notes 6(1): 5 (1981) - 1980
- [j21]Edsger W. Dijkstra:
Some Beautiful Arguments Using Mathematical Induction. Acta Informatica 13: 1-8 (1980) - [j20]Edsger W. Dijkstra, Carel S. Scholten:
Termination Detection for Diffusing Computations. Inf. Process. Lett. 11(1): 1-4 (1980) - 1978
- [j19]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) - [j18]Edsger W. Dijkstra:
DoD-I: the summing up. ACM SIGPLAN Notices 13(7): 21-26 (1978) - [j17]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): 14-16 (1978) - 1977
- [j16]Edsger W. Dijkstra:
A position paper on software reliability. ACM SIGSOFT Softw. Eng. Notes 2(5): 3-5 (1977) - 1976
- [j15]Edsger W. Dijkstra:
On a Gauntlet Thrown by David Gries. Acta Informatica 6: 357-359 (1976) - 1975
- [j14]Edsger W. Dijkstra:
Guarded Commands, Nondeterminacy and Formal Derivation of Programs. Commun. ACM 18(8): 453-457 (1975) - 1974
- [j13]Edsger W. Dijkstra:
Self-stabilizing Systems in Spite of Distributed Control. Commun. ACM 17(11): 643-644 (1974) - 1972
- [j12]Edsger W. Dijkstra:
The Humble Programmer. Commun. ACM 15(10): 859-866 (1972) - [j11]Edsger W. Dijkstra:
Information Streams Sharing a Finite Buffer. Inf. Process. Lett. 1(5): 179-180 (1972) - 1971
- [j10]Edsger W. Dijkstra:
Hierarchical Ordering of Sequential Processes. Acta Informatica 1: 115-138 (1971) - 1968
- [j9]Edsger W. Dijkstra:
Letters to the editor: go to statement considered harmful. Commun. ACM 11(3): 147-148 (1968) - [j8]Edsger W. Dijkstra:
The Structure of "THE"-Multiprogramming System. Commun. ACM 11(5): 341-346 (1968) - [j7]John R. Rice, Edsger W. Dijkstra:
Letters to the editor: The go to statement reconsidered. Commun. ACM 11(8): 538 (1968) - 1965
- [j6]Edsger W. Dijkstra:
Solution of a problem in concurrent programming control. Commun. ACM 8(9): 569 (1965) - 1964
- [j5]Edsger W. Dijkstra:
Some comments on the aims of MIRFAC. Commun. ACM 7(3): 190 (1964) - 1962
- [j4]Edsger W. Dijkstra:
Operating Experience with ALGOL 60. Comput. J. 5(2): 125-127 (1962) - 1961
- [j3]Edsger W. Dijkstra:
Letter to the editor: defense of ALGOL 60. Commun. ACM 4(11): 502-503 (1961) - 1959
- [j2]Edsger W. Dijkstra, W. Heise, Alan J. Perlis, Klaus Samelson:
ALGOL Sub-Committee Report - Extensions. Commun. ACM 2(9): 24 (1959) - [j1]Edsger W. Dijkstra:
A note on two problems in connexion with graphs. Numerische Mathematik 1: 269-271 (1959)
Conference and Workshop Papers
- 2000
- [c34]Edsger W. Dijkstra:
On the transitive closure of a wellfounded relation. The School of Niklaus Wirth 2000: 31-40 - 1996
- [c33]Edsger W. Dijkstra:
Fibonacci and the greatest common divisor. NATO ASI DPD 1996: 7-10 - [c32]Edsger W. Dijkstra:
The balance and the coins. NATO ASI DPD 1996: 11-13 - [c31]Edsger W. Dijkstra:
Bulterman's theorem on shortest trees. NATO ASI DPD 1996: 15-16 - [c30]Edsger W. Dijkstra:
A prime is in at most 1 way the sum of 2 squares. NATO ASI DPD 1996: 17-20 - [c29]Edsger W. Dijkstra:
A bagatelle on Euclid's algorithm. NATO ASI DPD 1996: 21-23 - [c28]Edsger W. Dijkstra:
On two equations that have the same extreme solution. NATO ASI DPD 1996: 25-26 - [c27]Edsger W. Dijkstra:
An alternative of the ETAC to EWD1163. NATO ASI DPD 1996: 27-28 - [c26]Edsger W. Dijkstra:
The argument about the arithmetic mean and the geometric mean, heuristics included. NATO ASI DPD 1996: 29-32 - 1992
- [c25]Edsger W. Dijkstra:
On the Economy of doing Mathematics. MPC 1992: 2-10 - [c24]Edsger W. Dijkstra:
The Unification of Three Calculi. NATO ASI PDC 1992: 197-231 - 1979
- [c23]Edsger W. Dijkstra:
Software Engineering : As It Should Be. ICSE 1979: 442-448 - 1978
- [c22]Edsger W. Dijkstra:
Finding the Correctness Proof of a Concurrent Program. MFCS 1978: 31-38 - [c21]Edsger W. Dijkstra:
A More Formal Treatment of a Less Simple Example. Program Construction 1978: 2-20 - [c20]Edsger W. Dijkstra:
Stationary Behaviour of Some Ternary Networks. Program Construction 1978: 21-23 - [c19]Edsger W. Dijkstra:
Finding the Correctness Proof of a Concurrent Program. Program Construction 1978: 24-34 - [c18]Edsger W. Dijkstra:
On the Interplay between Mathematics and Programming. Program Construction 1978: 35-46 - [c17]Edsger W. Dijkstra:
A Theorem about Odd Powers of Odd Integers. Program Construction 1978: 47-48 - [c16]Edsger W. Dijkstra:
In Honour of Fibonacci. Program Construction 1978: 49-50 - [c15]Edsger W. Dijkstra:
On the Foolishness of "Natural Language Programming". Program Construction 1978: 51-53 - [c14]Edsger W. Dijkstra:
Program Inversion. Program Construction 1978: 54-57 - 1977
- [c13]Edsger W. Dijkstra:
Programming: From Craft to Scientific Discipline. International Computing Symposium 1977: 23-30 - 1976
- [c12]Edsger W. Dijkstra:
Formal Techniques and Sizeable Programs. ECI 1976: 225-235 - [c11]Edsger W. Dijkstra:
The Effective Arrangement of Logical Systems. MFCS 1976: 39-51 - 1975
- [c10]Edsger W. Dijkstra:
On the teaching of programming, i. e. on the teaching of thinking. Language Hierarchies and Interfaces 1975: 1-10 - [c9]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 - [c8]Edsger W. Dijkstra:
Guarded commands, non-determinancy and a calculus for the derivation of programs. Language Hierarchies and Interfaces 1975: 111-124 - [c7]Edsger W. Dijkstra:
A time-wise hierarchy imposed upon the use of a two-level store. Language Hierarchies and Interfaces 1975: 345-357 - [c6]Edsger W. Dijkstra:
Craftsman or Scientist. ACM Pacific 1975: 217-223 - [c5]Edsger W. Dijkstra:
Guarded commands, non-determinacy and a calculus for the derivation of programs. Reliable Software 1975: 2 - [c4]Edsger W. Dijkstra:
Correctness concerns and, among other things, why they are resented. Reliable Software 1975: 546 - 1972
- [c3]Edsger W. Dijkstra:
A class of allocation strategies inducing bounded delays only. AFIPS Spring Joint Computing Conference 1972: 933-936 - 1967
- [c2]Edsger W. Dijkstra:
The structure of the "THE"-multiprogramming system. SOSP 1967 - 1962
- [c1]Edsger W. Dijkstra:
Some Meditations on Advanced Programming. IFIP Congress 1962: 535-538
Parts in Books or Collections
- 2022
- [p13]Edsger W. Dijkstra:
The Humble Programmer. Edsger Wybe Dijkstra 2022: 5-18 - [p12]Edsger W. Dijkstra:
A Note on Two Problems in Connexion with Graphs. Edsger Wybe Dijkstra 2022: 287-290 - [p11]Edsger W. Dijkstra:
Recursive Programming. Edsger Wybe Dijkstra 2022: 291-300 - [p10]Edsger W. Dijkstra:
Some Meditations on Advanced Programming. Edsger Wybe Dijkstra 2022: 301-310 - [p9]Edsger W. Dijkstra:
Solution of a Problem in Concurrent Programming Control. Edsger Wybe Dijkstra 2022: 311-314 - [p8]Edsger W. Dijkstra:
Go To Statement Considered Harmful. Edsger Wybe Dijkstra 2022: 315-318 - [p7]Edsger W. Dijkstra:
The Structure of the "THE"-Multiprogramming System. Edsger Wybe Dijkstra 2022: 319-332 - [p6]Edsger W. Dijkstra:
Self-stabilizing Systems in Spite of Distributed Control. Edsger Wybe Dijkstra 2022: 333-338 - [p5]Edsger W. Dijkstra, Leslie Lamport, Alain J. Martin, Carel S. Scholten, Elisabeth F. M. Steffens:
On-the-Fly Garbage Collection: An Exercise in Cooperation. Edsger Wybe Dijkstra 2022: 339-358 - [p4]Edsger W. Dijkstra:
On the Reliability of Programs. Edsger Wybe Dijkstra 2022: 359-370 - 2002
- [p3]Edsger W. Dijkstra:
EWD 1308: What Led to "Notes on Structured Programming". Software Pioneers 2002: 340-346 - [p2]Edsger W. Dijkstra:
Solution of a Problem in Concurrent Programming Control (Reprint). Software Pioneers 2002: 347-350 - [p1]Edsger W. Dijkstra:
Go to Statement Considered Harmful (Reprint). Software Pioneers 2002: 351-355
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
