#684

Most Influential Person

Dutch computer scientist

According to Wikipedia, Edsger Wybe Dijkstra was a Dutch computer scientist, programmer, software engineer, systems scientist, and science essayist. He received the 1972 Turing Award for fundamental contributions to developing programming languages, and was the Schlumberger Centennial Chair of Computer Sciences at The University of Texas at Austin from 1984 until 2000.

- A note on two problems in connexion with graphs (1959) (22058)
- A Discipline of Programming (1976) (5082)
- Self-stabilizing systems in spite of distributed control (1974) (2176)
- Guarded commands, nondeterminacy and formal derivation of programs (1975) (2020)
- The structure of the “THE”-multiprogramming system (1968) (1205)
- Structured programming (1972) (1126)
- Notes on structured programming (1970) (1016)
- Letters to the editor: go to statement considered harmful (1968) (830)
- Solution of a problem in concurrent programming control (1965) (826)
- Predicate Calculus and Program Semantics (1989) (783)
- The humble programmer (1972) (766)
- Termination Detection for Diffusing Computations (1980) (760)
- Cooperating sequential processes (2002) (759)
- On-the-fly garbage collection: an exercise in cooperation (1975) (604)
- Hierarchical ordering of sequential processes (1971) (510)
- Selected Writings on Computing: A personal Perspective (1982) (474)
- On the Role of Scientific Thought (1982) (471)
- Co-operating sequential processes (1968) (432)
- Derivation of a Termination Detection Algorithm for Distributed Computations (1983) (313)
- Solution of a problem in concurrent programming control (1965) (286)
- A constructive approach to the problem of program correctness (1968) (249)
- Self stabilization in spite of distributed control (1974) (224)
- Ewd 316: a short introduction to the art of programming (1971) (148)
- Guarded commands, non-determinacy and a calculus for the derivation of programs (1975) (143)
- Recursive Programming (1960) (115)
- A method of programming (1988) (114)
- Cooperating Sequential Processes, Technical Report EWD-123 (1965) (108)
- Go to Statement Considered Harmful (Reprint) (2002) (101)
- Programming considered as a human activity (1979) (97)
- A belated proof of self-stabilization (2005) (89)
- How do we tell truths that might hurt? (1982) (87)
- The structure of “THE”-multiprogramming system (1983) (77)
- Program Inversion (1978) (69)
- Formal Development of Programs and Proofs (1990) (64)
- Chapter I: Notes on structured programming (1972) (55)
- Programming as a discipline of mathematical nature (1974) (54)
- Smoothsort, an Alternative for Sorting In Situ (1982) (54)
- The end of computing science? (2001) (49)
- On the Foolishness of "Natural Language Programming" (1978) (40)
- On a cultural gap (1986) (36)
- A Personal Summary of the Gries—Owicki Theory (1982) (33)
- The Mathematics Behind the Banker’s Algorithm (1982) (32)
- A simple axiomatic basis for programming language constructs (1973) (32)
- On a political pamphlet from the middle ages (1978) (32)
- Making a translator for Algol 60 (1963) (31)
- Invariance and non-determinacy (1984) (30)
- Information Streams Sharing a Finite Buffer (1972) (29)
- A class of allocation strategies inducing bounded delays only (1899) (28)
- Making a Fair Roulette From a Possibly Biased Coin (1990) (26)
- The Structure of the "THE"-Multiprogramming (1968) (26)
- Communication with an Automatic Computer (1959) (25)
- Some beautiful arguments using mathematical induction (2004) (25)
- A simple fixpoint argument without the restriction to continuity (1986) (24)
- On the teaching of programming, i. e. on the teaching of thinking (1975) (23)
- A Tutorial on the Split Binary Semaphore (1982) (22)
- On the design of machine independent programming languages (1961) (22)
- A Word of Welcome (1981) (22)
- Primer of Algol 60 Programming (1962) (21)
- Finding the Maximum Strong Components in a Directed Graph (1982) (21)
- Correctness concerns and, among other things, why they are resented (1975) (20)
- Algol 60 translation : An algol 60 translator for the x1 and making a translator for algol 60 (1961) (20)
- Some theorems on spanning subtrees of a graph : (proceedings knaw series a, _6_3(1960), nr 2, indagationes mathematicae, _2_2(1960), p 196-199) (1960) (20)
- The structure of the “THE”-multiprogramming system (1967) (20)
- An Algol 60 translator for the X1 (1963) (20)
- A Correctness Proof for Communicating Processes: A Small Exercise (1982) (19)
- Software Verification (2008) (19)
- EWD391 Self-stabilization in spite of distributed control (1973) (18)
- Software Engineering : As It Should Be (1979) (18)
- Position paper on “fairness" (1988) (18)
- Under the spell of Leibniz's dream (2001) (18)
- The Solution to a Cyclic Relaxation Problem (1982) (18)
- Sequences and their Applications (2002) (17)
- EWD1300: The Notational Conventions I Adopted, and Why (2002) (16)
- EWD 1308: What Led to "Notes on Structured Programming" (2002) (16)
- A Class of Simple Communication Patterns (1982) (15)
- Programming: From Craft to Scientific Discipline (1977) (15)
- Finding the Correctness Proof of a Concurrent Program (1978) (14)
- The distributed snapshot of K.M. Chandy and L. Lamport (1986) (13)
- An Introduction to Three Algorithms for Sorting in Situ (1982) (13)
- The tide, not the waves (1997) (13)
- Letters to the editor: The go to statement reconsidered (1968) (12)
- On Weak and Strong Termination (1982) (11)
- On the Economy of doing Mathematics (1992) (11)
- Stepwise Program Construction (1982) (11)
- On the Interplay between Mathematics and Programming (1978) (10)
- On the Fact that the Atlantic Ocean Has Two Sides (1982) (10)
- Computing Science: achievements and challenges (1999) (10)
- Mathematicians and computing scientists: the cultural gap (1987) (10)
- A Programmer's Early Memories (1980) (9)
- On Making Solutions More and More Fine-Grained (1982) (9)
- A Heuristic Explanation of Batcher's Baffler (1987) (9)
- An Exercise for Dr. R. M. Burstall (1982) (9)
- Some comments on the aims of MIRFAC (1964) (8)
- More About the Function “fusc” (A Sequel to EWD570) (1982) (8)
- The Equivalence of Bounded Nondeterminacy and Continuity (1982) (8)
- On the nature of computing science (1987) (8)
- DoD-I: the summing up (1978) (8)
- The Linear Search Revisited (1989) (8)
- Formal Techniques and Sizeable Programs (1976) (8)
- American programming's plight (1981) (8)
- The Unification of Three Calculi (1992) (8)
- A Case for Agents (2009) (8)
- Craftsman or Scientist (1975) (7)
- In Honour of Fibonacci (1978) (7)
- A computing scientist’s approach to a once-deep theorem of Sylvester’s (1989) (5)
- A simple fix point argument without the restriction to continuity (1986) (5)
- Reasoning about programs (1990) (5)
- “Why is Software So Expensive?” An Explanation to the Hardware Designer (1982) (4)
- The fruits of misunderstanding (1983) (4)
- An Elephant Inspired by the Dutch National Flag (1982) (4)
- Letter to the editor: defense of ALGOL 60 (1961) (4)
- The strongest postcondition (1990) (4)
- My hopes of computing science (EWD709) (1979) (4)
- On our proof format (1990) (4)
- A Somewhat Open Letter to EAA or: Why I Proved the Boundedness of the Nondeterminacy in the Way I Did (1982) (4)
- A New Elephant Built from Mosquitoes Humming in Harmony (1982) (4)
- The Effective Arrangement of Logical Systems (1976) (3)
- Appendix – Two Papers on an ALGOL Translator for the X1 (1963) (3)
- A synthesis emerging (2002) (3)
- On Webster, Users, Bugs, and Aristotle (1982) (3)
- A position paper on software reliability (1977) (3)
- On the design of a simple proof for Morley’s Theorem (1992) (3)
- My recollections of operating system design (2005) (3)
- Operating Experience with ALGOL 60 (1962) (3)
- Programming methodologies : their objectives and their nature (1976) (3)
- On the Design of Machine Independent Programming Languages† †Originally issued as Report M.R.34 of the Mathematics Centre, Amsterdam. (1963) (3)
- The Three Golden Rules for Successful Scientific Research (1982) (3)
- Why Naive Program Transformation Systems Are Unlikely to Work (1982) (3)
- ALGOL Sub-Committee Report - Extensions (1959) (3)
- A Theorem about Odd Powers of Odd Integers (1978) (2)
- The derivation of a proof (1989) (2)
- Well-foundedness and the transitive closure (1992) (2)
- Two Papers on an ALGOL Translator for the X1 (1963) (2)
- On a gauntlet thrown by David Gries (1976) (2)
- On the design of calculational proofs (1994) (2)
- Heuristics for a Calculational Proof (1995) (2)
- Extreme solutions of equations (1987) (2)
- A Collection of Beautiful Proofs (1982) (2)
- Mathematics Inc., a Private Letter from Its Chairman (1982) (2)
- Designing a Calculational Proof of Cantor's Theorem (2001) (2)
- A look back at) go to statement considered harmful (2008) (2)
- Appalling Prose and the Shortest Path (1998) (2)
- Lambek and Moser Revisited (1982) (2)
- Semantics of straight-line programs (1990) (2)
- Fibonacci and the greatest common divisor (1996) (2)
- An attempt to unify the constituent concepts of serial program execution : Paper symposium symbolic language in data processing, rome 1962 (1962) (2)
- The argument about the arithmetic mean and the geometric mean, heuristics included (1996) (2)
- Trip Report E. W. Dijkstra, Summer School Munich, July 25 to August 4, 1973 (1982) (1)
- A “Non Trip Report” from E. W. Dijkstra (1982) (1)
- Monotonic Replacement Algorithms and Their Implementation (1982) (1)
- On Subgoal Induction (1982) (1)
- A Great Improvement (1982) (1)
- Fillers at the YoP Institute (1989) (1)
- The go to statement reconsidered [Letters to the editor] (1968) (1)
- A Letter to My Old Friend Jonathan (1982) (1)
- User-Centered Design Considered Harmful 1 ( with apologies to (2008) (1)
- Speech at the Occasion of an Anniversary (1982) (1)
- Reliability of Complex Services (2006) (1)
- To H. D. Mills, Chairman Software Methodology Panel (1982) (1)
- Oral history interview with Edsger W. Dijkstra (2001) (1)
- The calculus of boolean structures (1990) (1)
- Reasoning about programs (videotape) (1990) (1)
- Trip Report Visit ETH Zurich, 3–4 February 1975 by E. W. Dijkstra (1982) (1)
- More on Hauck’s Warning (1982) (0)
- Heuristics for a very simple Euclidean proof (EWD1180) (1997) (0)
- Example demonstrating the importance of evaluating the primaries in a fixed order (1961) (0)
- A Multidisciplinary Approach to Mathematics (1982) (0)
- Trip Report E. W. Dijkstra, Meeting IFIP W.G.2.3, Munich, 8–14 December 1974 (1982) (0)
- Table of Everett's interpolation coefficients (1955) (0)
- Mathematical induction and computing science (1982) (0)
- A result of rabbit removal (EWD1208) (1997) (0)
- Bulterman’s theorem on shortest trees (EWD1131) (1996) (0)
- A bagatelle on Euclid's algorithm (1996) (0)
- MC-25 informatica symposium : [symposium on the occasion of the 25th anniversary of the Mathematical Centre, Amsterdam, 06-07.01.1972] (1971) (0)
- The formula for sin.(α + β) (EWD1244a) (1997) (0)
- On Two Beautiful Solutions Designed by Martin Rem (1982) (0)
- Courtesy Dr. Birgit Schieder (EWD1215) (1997) (0)
- The evolution of programs: Nachum Dershowitz Volume 5 in: Progress in Computer Science, Birkhäuser, Basel, 1983, 357 pages, Sfr.64.00 (1984) (0)
- Inside “Mathematics Inc.” (1982) (0)
- A Mechanism for Dealing with the types integer, real and complex (1965) (0)
- A Story that Starts with a Very Good Computer (1982) (0)
- On two equations that have the same extreme solution (1996) (0)
- My simplest theorem (EWD1232) (1997) (0)
- Designing the proof of Vizing’s Theorem (1992) (0)
- On a Problem Transmitted by Doug McIlroy (1989) (0)
- A More Formal Treatment of a Less Simple Example (1978) (0)
- A bagatelle on Euclid’s Algorithm (EWD1158) (1996) (0)
- Bulterman's theorem on shortest trees (1996) (0)
- Elementaire cursus programmeren in Algol 60 (1967) (0)
- Acceptance Speech for the AFIPS Harry Goode Memorial Award 1974 (1982) (0)
- Some properties of predicate transformers (1990) (0)
- Craftsman or scientist [Banquet Luncheon Lecture] (1975) (0)
- Trip Report E. W. Dijkstra, Newcastle, 8–12 September 1975 (1982) (0)
- Equations in predicates and their extreme solutions (1990) (0)
- Cursus programmeren in algol 60 (1960) (0)
- Semantics of repetitions (1990) (0)
- Comments at a Symposium (1982) (0)
- The image construction in computerized axial tomography (CAT) (1987) (0)
- Heuristics for a very simple Euclidean proof (1997) (0)
- A time-wise hierarchy imposed upon the use of a two-level store (1975) (0)
- The Introduction of MAES (1982) (0)
- Converse predicate transformers (1990) (0)
- Exercises in Making Programs Robust (1982) (0)
- A method to investigate primality (1957) (0)
- Note on language definition (1964) (0)
- On the transitive closure of a wellfounded relation (2000) (0)
- On the theorem of Pythagoras (EWD 975) (2009) (0)
- Trip Report E. W. Dijkstra, Australia, 16 February 1977–21 March 1977 (1982) (0)
- The marriage agency (EWD1214) (1997) (0)
- For the record: painting the squared plane (EWD1212) (1997) (0)
- The strengths of the academic enterprise (EWD1175) (1997) (0)
- Repaying Our Debts (1982) (0)
- A simple mechanism modelling some features of ALGOL (1964) (0)
- The transitive closure of a wellfounded relation (EWD1241) (1997) (0)
- The balance and the coins (EWD1083) (1996) (0)
- Complete DAGs (EWD1204) (1997) (0)
- A Proof of a Theorem Communicated to Us by S. Ghosh (1982) (0)
- Object-Oriented Analysis and Design (2011) (0)
- On substitution and replacement (1990) (0)
- Erratum and Embellishments of EWD503 (1982) (0)
- A kind of converse of Leibniz’s Principle (EWD1245) (1997) (0)
- 2011 Edsger W. Dijkstra Prize in Distributed Computing Sharing Memory Robustly in Message-passing Systems (2011) (0)
- The image construction in computerized axial tomography (1986) (0)
- Trip Report E. W. Dijkstra, Poland and USSR, 4–25 September 1976 (1982) (0)
- Trip Report E. W. Dijkstra, St. Pierre-de-Chartreuse, 12–19 Dec. 1976 (1982) (0)
- Trip Report E. W. Dijkstra, Newcastle-upon-Tyne, 5–10 Sept. 1977 (1982) (0)
- Fibonacci and the greatest common divisor (EWD1077) (1996) (0)
- The balance and the coins (1996) (0)
- Parallelism in Multi-Record Transactions (1982) (0)
- Trip Report IBM Seminar “Communication and Computers”, Newcastle, Sept. 1973 (1982) (0)
- WLOG, or the misery of the unordered pair (EWD1223) (1997) (0)
- A prime is in at most 1 way the sum of 2 squares (1996) (0)
- A method to investigate primality : (mathematical tables and other aids to computation, _1_1(1957), p 195-196) (1957) (0)
- On functions and equality (1990) (0)
- The derivation of a proof by J.C.S.P. van der Woude (1989) (0)
- An alternative of the ETAC to EWD1163 (1996) (0)
- On binary operators and their derived relations (1988) (0)
- Trip Report E. W. Dijkstra, Tokyo, 28 Sept-3 Oct. 1976 (1982) (0)
- Remark concerning the definition of comments (1961) (0)
- An alternative of the ETAC to EWD1163 (EWD1169) (1996) (0)
- Stationary Behaviour of Some Ternary Networks (1978) (0)
- Control flow and data flow: Concepts of distributed programming (1985) (0)
- On a Warning from E. A. Hauck (1982) (0)
- Trip Report E. W. Dijkstra, ECI-Conference 9–12 August 1976, Amsterdam (1982) (0)
- Trip Report E. W. Dijkstra 16th April/ 7th May, 1975, U.S.A. and Canada (1982) (0)

This paper list is powered by the following services:

Edsger W. Dijkstra is affiliated with the following schools:

This website uses cookies to enhance the user experience. Read the Privacy Policy for more.

Subscribe To Newsletter?Yes!