Thematic Index

This is a broad archive index, not the curated research reading map. For the curated path, return to Research Reading Map or Home.

Programming Methodology and Structured Programming

  1. 32 Some meditations on Advanced Programming 1962–1964
  2. 51 Multiprogramming and the X8 Needs review 1962–1964
  3. 54 Multiprogramming and the X8, Part 2 Needs review 1962–1964
  4. 57 EWD57 — Translation pending 1962–1964
  5. 62 EWD62 — Translation pending 1962–1964
  6. 117 Programming considered as a human activity 1964–1967
  7. 126 The multiprogramming system for the EL X8 THE 1964–1967
  8. 196 The structure of the “THE”-multiprogramming system 1964–1967
  9. 232 EWD232 — Translation pending 1967–1970
  10. 237 A preliminary investigation into Computer Assisted Programming 1967–1970
  11. 241 Towards correct programs 1967–1970
  12. 246 EWD246 — Translation pending 1967–1970
  13. 249 Notes on Structured Programming 1967–1970
  14. 251 Requirements of programming tools 1967–1970
  15. 252a EWD252a — Translation pending 1967–1970
  16. 253a EWD253a — Translation pending 1967–1970
  17. 254 EWD254 — Translation pending 1967–1970
  18. 259 EWD259 — Translation pending 1967–1970
  19. 261 EWD261 — Translation pending 1967–1970
  20. 264 On understanding programs 1967–1970
  21. 268 Structured programming 1967–1970
  22. 272 EWD272 — Translation pending 1967–1970
  23. 273 The programming task considered as an intellectual challenge 1967–1970
  24. 278 EWD278 — Translation pending 1967–1970
  25. 279 The programming laboratory project 1967–1970
  26. 282 A tree-structured system 1967–1970
  27. 287 Sans titre (but most definitely a predecessor to EWD316, “A short introduction into the art of programming”) 1967–1970
  28. 295 EWD295 — Translation pending 1967–1970
  29. 298 EWD298 — Translation pending 1967–1970
  30. 300 EWD300 — Translation pending 1971–1973
  31. 303 On the reliability of programs 1971–1973
  32. 316 A short introduction to the art of programming 1971–1973
  33. 317 On a methodology of design 1971–1973
  34. 340 The humble programmer 1971–1973
  35. 361 Programming as a discipline of mathematical nature 1971–1973
  36. 372 A simple axiomatic basis for programming language constructs 1971–1973
  37. 395 Trip report E.W.Dijkstra IFIP Working Group W.G.2.3 “On Programming Methodology”, 21st–26th October 1973, Blanchland, England 1971–1973
  38. 418 Guarded commands, non-determinacy and a calculus for the derivation of programs 1973–1975
  39. 469 Programming methodologies, their objectives and their nature 1973–1975
  40. 472 Guarded commands, non-determinacy and formal derivation of programs 1973–1975
  41. 473 On the teaching of programming, i.e. on the teaching of thinking 1973–1975
  42. 476 Concurrent programming: a preliminary investigation 1973–1975
  43. 482 Exercises in making programs robust 1973–1975
  44. 485 Marketing questionnaire “A Discipline of Programming” 1973–1975
  45. 524 Review of “On the Feasibility of Software Certification” 1975–1976
  46. 540 Two views of programming 1975–1976
  47. 563 Formal techniques and sizeable programs 1975–1976
  48. 566 Programming: from craft to scientific discipline 1975–1976
  49. 568 A programmer’s early memories 1975–1976
  50. 575 To H.D.Mills, Chairman Software Methodology Panel 1975–1976
  51. 626 EWD626 — Translation pending 1976–1979
  52. 627 A position paper on Software Reliability 1976–1979
  53. 631 Re: “Formal derivation of strongly correct parallel programs” by Axel van Lamsweerde and M.Sintzoff 1976–1979
  54. 641 On the interplay between mathematics and programming 1976–1979
  55. 648 “Why is software so expensive?” An explanation to the hardware designer 1976–1979
  56. 667 On the foolishness of “natural language programming” 1976–1979
  57. 750 American programming’s plight 1979–1981
  58. 781 About the presentation of programs (with A.J.M. van Gasteren) 1979–1981
  59. 803 Lecture notes on the structure of programs and proofs 1981–1984
  60. 825 About the correctness of a few SASL programs 1981–1984
  61. 829 EWD829 — Translation pending 1981–1984
  62. 833 An In-Depth Seminar on Proven Tools & Techniques of Structured Methodology for Effective Software Configuration Management 1981–1984
  63. 869 EWD869 — Translation pending 1981–1984
  64. 881 A review of “The Evolution of Programs” 1981–1984
  65. 910 Semantics of straight-line programs (Draft Chap.4) 1984–1987
  66. 962 Introducing a course on mathematical methodology 1984–1987
  67. 988 On the phenomenon of scientific disciplines 1984–1987
  68. 1011 Introducing my fall 1987 course on Mathematical Methodology 1987–1991
  69. 1043 A few comments on “Computing as a discipline” 1987–1991
  70. 1059 0 Preface (Mathematical Methodology) 1987–1991
  71. 1063 An introductory example (Mathematical Methodology) 1987–1991
  72. 1067 A very first introductory example (Mathematical Methodology) 1987–1991
  73. 1068 On the quality criteria for mathematical writing (Mathematical Methodology) 1987–1991
  74. 1070 For brevity’s sake (Mathematical Methodology) 1987–1991
  75. 1078 Leibniz’s Principle (Mathematical Methodology) 1987–1991
  76. 1090 The design of a proof of equality (Mathematical Methodology) 1987–1991
  77. 1091 More equality proofs with instantiated definitions (Mathematical Methodology) 1987–1991
  78. 1094 The undeserved status of the pigeon-hole principle (Mathematical Methodology) 1987–1991
  79. 1220 Honors course “Mathematical Methodology”, Spring 1996 1995–2000
  80. 1256 Mathematical Methodology, Spring 1997 1995–2000
  81. 1305 Answers to questions from students of Software Engineering 2000–2002
  82. 1308 What led to “Notes on Structured Programming” 2000–2002

Correctness, Proofs, and Program Derivation

  1. 209 A constructive approach to the problem of program correctness 1967–1970
  2. 209A A constructive approach to the problem of program correctness 1967–1970
  3. 288 Concern for correctness as a guiding principle for program construction 1967–1970
  4. 360 On the Necessity of Correctness Proofs 1971–1973
  5. 375 A non algebraic example of a constructive correctness proof 1971–1973
  6. 415 A beautiful proof of a probably useless theorem (with W.H.J.Feijen) 1973–1975
  7. 418 Guarded commands, non-determinacy and a calculus for the derivation of programs 1973–1975
  8. 450 Correctness concerns and, among other things, why they are resented 1973–1975
  9. 472 Guarded commands, non-determinacy and formal derivation of programs 1973–1975
  10. 538 A collection of beautiful proofs 1975–1976
  11. 582 A proof of a theorem communicated to us by S.Ghosh (with C.S.Scholten) 1975–1976
  12. 607 A correctness proof for communicating processes: a small exercise 1976–1979
  13. 631 Re: “Formal derivation of strongly correct parallel programs” by Axel van Lamsweerde and M.Sintzoff 1976–1979
  14. 640 Finding the correctness proof of a concurrent program 1976–1979
  15. 640a Finding the correctness proof of a concurrent program 1976–1979
  16. 668 On the correctness of a design by Alain J.Martin 1976–1979
  17. 720 Why correctness must be a mathematical concern 1979–1981
  18. 740 A short proof of one of Fermat’s theorems 1979–1981
  19. 763 A proof by Rutger M.Dijkstra and me 1979–1981
  20. 779 An assertional proof of a program by G.L.Peterson 1979–1981
  21. 785 Our presentation of K.A.Post’s proof of R.Stanley’s theorem (with A.J.M. van Gasteren) 1979–1981
  22. 787 A (new?) proof of a theorem of Euler’s on partitions 1979–1981
  23. 803 Lecture notes on the structure of programs and proofs 1981–1984
  24. 813 About predicate transformers in general (with C.S.Scholten) 1981–1984
  25. 816 Weakest preconditions, liberal and not (with C.S.Scholten) 1981–1984
  26. 818 A nice theorem on monotonic predicate sequences 1981–1984
  27. 821 From predicate transformers to predicates (Dedicated by the Tuesday Afternoon Club to C.A.R. Hoare at the occasion of his being elected Fellow of the Royal Society.) 1981–1984
  28. 825 About the correctness of a few SASL programs 1981–1984
  29. 834 Elementary predicates and elimination (with A.J.M. van Gasteren) 1981–1984
  30. 835 Lecture notes “Predicate transformers” (Draft) 1981–1984
  31. 840 Derivation of a termination detection algorithm for distributed computations (with W.H.J.Feijen and A.J.M. van Gasteren) 1981–1984
  32. 846 The maximum length of a segment satisfying a monotonic predicate (with A.J.M. van Gasteren) 1981–1984
  33. 863 Predicate calculus revisited 1981–1984
  34. 866 An analytical proof of the Butterfly Theorem 1981–1984
  35. 870 My mother’s proof of the Butterfly Theorem (see EWD866) 1981–1984
  36. 882 The regularity calculus: a first trial 1981–1984
  37. 894 On partitioning predicates 1981–1984
  38. 897 A formal program derivation for the record 1981–1984
  39. 902 The regularity calculus: a second trial 1984–1987
  40. 905 Mainly on our use of the predicate calculus (Draft Ch.2) 1984–1987
  41. 908 Predicate transformers (Draft Ch.3) 1984–1987
  42. 922 A belated proof of self-stabilization 1984–1987
  43. 946 The proof of the pudding 1984–1987
  44. 948 Misra’s proof of Lamport’s mutual exclusion 1984–1987
  45. 955 Partitioning predicates and substitution; diabolical and angelical nondeterminism 1984–1987
  46. 957 Partitioning predicates and punctual functions (see EWD955) 1984–1987
  47. 960 On a proof I learned from prof. dr. J. Haantjes 1984–1987
  48. 982 Relational Calculus according to ATAC 1984–1987
  49. 999 Our proof format 1984–1987
  50. 1001 The calculus of boolean structures (Part 0) 1987–1991
  51. 1002 The calculus of boolean structures (Part 1) 1987–1991
  52. 1020 The derivation of a proof by J.C.S.P. van der Woude 1987–1991
  53. 1048 ATAC’s proof of Scholten’s theorem 1987–1991
  54. 1050 On the design of a simple proof for Morley’s Theorem 1987–1991
  55. 1060 “Predicate Calculus and Program Semantics”, fall 1989 1987–1991
  56. 1061 Composition, lambda-calculus, and some more 1987–1991
  57. 1065 An example of how to lengthen formal proofs 1987–1991
  58. 1075 Constructing the proof of Vizing’s Theorem (with J.R. Rao) 1987–1991
  59. 1082 Designing the proof of Vizing’s Theorem (with J.R. Rao) 1987–1991
  60. 1082a Designing the proof of Vizing’s Theorem (with J.R. Rao) 1987–1991
  61. 1090 The design of a proof of equality (Mathematical Methodology) 1987–1991
  62. 1091 More equality proofs with instantiated definitions (Mathematical Methodology) 1987–1991
  63. 1096 Potter’s proof of disjunction’s symmetry 1987–1991
  64. 1099 Inspired by Peter Auer’s proof 1987–1991
  65. 1109 Simplifying a proof in our book 1991–1995
  66. 1114 Well-foundedness and the relational calculus 1991–1995
  67. 1116 More pointless relational calculus: the transitive closure 1991–1995
  68. 1124 On a proof of Kaplansky’s Theorem 1991–1995
  69. 1136 A comparison of relational proofs 1991–1995
  70. 1141 Notational considerations and the relational calculus 1991–1995
  71. 1143 Some annotated proofs 1991–1995
  72. 1144 More annotated proofs (a sequel to 1143) 1991–1995
  73. 1147 More on monotonic predicate transformers and the introduction of dummies (see EWD1117) 1991–1995
  74. 1149 Perry Moerland’s proof of Carel Scholten’s theorem 1991–1995
  75. 1150 On the design of calculational proofs 1991–1995
  76. 1154 A derivation of a proof by D. Zagier 1991–1995
  77. 1162 A detailed derivation of a very simple program 1991–1995
  78. 1174 The heuristics of a proof by Jan L.A. van de Snepscheut and Richard S. Bird 1991–1995
  79. 1174a Heuristics for a calculational proof 1991–1995
  80. 1180 Heuristics for a very simple Euclidean proof 1991–1995
  81. 1219 “I have a proof that ....” 1995–2000
  82. 1221b Calculational proof design; an experiment 1995–2000
  83. 1225 Misra’s weakest fair buffer 1995–2000
  84. 1269 A simple proof of Hall’s Theorem 1995–2000
  85. 1280 A tough experiment with the triangle calculus 1995–2000
  86. 1294a Designing a calculational proof of Cantor’s theorem 1995–2000
  87. 1315 Indirect equality enriched (and a proof by Netty) 2000–2002

Concurrency, Operating Systems, and Distributed Control

  1. 51 Multiprogramming and the X8 Needs review 1962–1964
  2. 54 Multiprogramming and the X8, Part 2 Needs review 1962–1964
  3. 57 EWD57 — Translation pending 1962–1964
  4. 126 The multiprogramming system for the EL X8 THE 1964–1967
  5. 196 The structure of the “THE”-multiprogramming system 1964–1967
  6. 214 EWD214 — Translation pending 1967–1970
  7. 232 EWD232 — Translation pending 1967–1970
  8. 275 Structure of an extendable operating system 1967–1970
  9. 374 The analysis of multiprogrammed systems of unspecified degree of parallellism 1971–1973
  10. 391 Self-stabilization in spite of distributed control 1971–1973
  11. 397 Self-stabilizing systems with distributed control 1971–1973
  12. 405 Synchronization and sequencing Translation pending 1973–1975
  13. 426 Self-stabilizing systems in spite of distributed control 1973–1975
  14. 435 Associons: an effort towards accomodating potentially ultra-high concurrency (with W.H.J.Feijen and M.Rem) 1973–1975
  15. 476 Concurrent programming: a preliminary investigation 1973–1975
  16. 640 Finding the correctness proof of a concurrent program 1976–1979
  17. 640a Finding the correctness proof of a concurrent program 1976–1979
  18. 702 In reaction to Ernest Chang’s “Deadlock Detection” 1979–1981
  19. 703 A tutorial on the split binary semaphore 1979–1981
  20. 734 The superfluity of the general semaphore 1979–1981
  21. 744 A short note on symmetric distributed arbitration 1979–1981
  22. 752 Distributed Arbitration (DRAFT, with C.S.Scholten) 1979–1981
  23. 828 Distributed termination detection revisited 1981–1984
  24. 840 Derivation of a termination detection algorithm for distributed computations (with W.H.J.Feijen and A.J.M. van Gasteren) 1981–1984
  25. 851 Reducing control traffic in a distributed implementation of mutual exclusion 1981–1984
  26. 851a Reducing control traffic in a distributed implementation of mutual exclusion 1981–1984
  27. 851b Reducing control traffic in a distributed implementation of mutual exclusion 1981–1984
  28. 864 The distributed snapshot of Chandy/Lamport/Misra 1981–1984
  29. 864a The Distributed Snapshot of K.M.Chandy and L. Lamport 1981–1984
  30. 1127n Referee’s Report on "A transformational approach to specifying recovery in asynchronous communicating systems" by Zhiming Liu and Mathai Joseph, University of Warwick. Paper No. 40 ( withdrawn ) 1991–1995
  31. 1303 My recollections of operating system design 2000–2002

Formal Methods, Predicate Transformers, and Notation

  1. 89 EWD89 — Translation pending 1962–1964
  2. 147 Proposal for the input and the notation of the system 1964–1967
  3. 363 EWD363 — Translation pending 1971–1973
  4. 367 On the axiomatic definition of semantics 1971–1973
  5. 401 The characterization of semantics 1973–1975
  6. 413 The formal treatment of some small examples. 1973–1975
  7. 418 Guarded commands, non-determinacy and a calculus for the derivation of programs 1973–1975
  8. 472 Guarded commands, non-determinacy and formal derivation of programs 1973–1975
  9. 550 A more formal treatment of a less simple example 1975–1976
  10. 563 Formal techniques and sizeable programs 1975–1976
  11. 631 Re: “Formal derivation of strongly correct parallel programs” by Axel van Lamsweerde and M.Sintzoff 1976–1979
  12. 655 Essays on the nature and role of mathematical elegance (3): On notation (A sequel to EWD619) 1976–1979
  13. 737 A notational alternative for quantification 1979–1981
  14. 782 A stupid notation 1979–1981
  15. 813 About predicate transformers in general (with C.S.Scholten) 1981–1984
  16. 815 Remarks on notation (with A.J.M. van Gasteren) 1981–1984
  17. 821 From predicate transformers to predicates (Dedicated by the Tuesday Afternoon Club to C.A.R. Hoare at the occasion of his being elected Fellow of the Royal Society.) 1981–1984
  18. 835 Lecture notes “Predicate transformers” (Draft) 1981–1984
  19. 859 Semantics of recursive procedures (with C.S.Scholten) 1981–1984
  20. 863 Predicate calculus revisited 1981–1984
  21. 882 The regularity calculus: a first trial 1981–1984
  22. 897 A formal program derivation for the record 1981–1984
  23. 902 The regularity calculus: a second trial 1984–1987
  24. 905 Mainly on our use of the predicate calculus (Draft Ch.2) 1984–1987
  25. 908 Predicate transformers (Draft Ch.3) 1984–1987
  26. 910 Semantics of straight-line programs (Draft Chap.4) 1984–1987
  27. 950 On notation (with A.J.M. van Gasteren) 1984–1987
  28. 950a On notation (with A.J.M. van Gasteren) 1984–1987
  29. 982 Relational Calculus according to ATAC 1984–1987
  30. 1001 The calculus of boolean structures (Part 0) 1987–1991
  31. 1002 The calculus of boolean structures (Part 1) 1987–1991
  32. 1060 “Predicate Calculus and Program Semantics”, fall 1989 1987–1991
  33. 1061 Composition, lambda-calculus, and some more 1987–1991
  34. 1064 On the selection of dummies: a notational freedom 1987–1991
  35. 1065 An example of how to lengthen formal proofs 1987–1991
  36. 1114 Well-foundedness and the relational calculus 1991–1995
  37. 1116 More pointless relational calculus: the transitive closure 1991–1995
  38. 1141 Notational considerations and the relational calculus 1991–1995
  39. 1147 More on monotonic predicate transformers and the introduction of dummies (see EWD1117) 1991–1995
  40. 1280 A tough experiment with the triangle calculus 1995–2000
  41. 1300 The notational conventions I adopted, and why 2000–2002

Algorithms and Mathematical Arguments

  1. 108 An algorithm for preventing deadly embrace Needs review 1964–1967
  2. 116 The banker’s algorithm and refinements thereof Needs review 1964–1967
  3. 360 On the Necessity of Correctness Proofs 1971–1973
  4. 361 Programming as a discipline of mathematical nature 1971–1973
  5. 375 A non algebraic example of a constructive correctness proof 1971–1973
  6. 376 Finding the maximum strong components in a directed graph 1971–1973
  7. 415 A beautiful proof of a probably useless theorem (with W.H.J.Feijen) 1973–1975
  8. 442 Inside “Mathematics Inc” 1973–1975
  9. 443 A multidisciplinary approach to mathematics 1973–1975
  10. 453 Finding the maximal strong components in a directed graph. 1973–1975
  11. 465 Monotonic replacement algorithms and their implementation 1973–1975
  12. 538 A collection of beautiful proofs 1975–1976
  13. 539 Mathematics Inc., a private letter from its chairman 1975–1976
  14. 582 A proof of a theorem communicated to us by S.Ghosh (with C.S.Scholten) 1975–1976
  15. 607 A correctness proof for communicating processes: a small exercise 1976–1979
  16. 619 Essays on the nature and role of mathematical elegance 1976–1979
  17. 623 The mathematics behind the Banker's Algorithm 1976–1979
  18. 640 Finding the correctness proof of a concurrent program 1976–1979
  19. 640a Finding the correctness proof of a concurrent program 1976–1979
  20. 641 On the interplay between mathematics and programming 1976–1979
  21. 642 A special sorting elephant 1976–1979
  22. 646 A not so simple theorem about undirected graphs 1976–1979
  23. 655 Essays on the nature and role of mathematical elegance (3): On notation (A sequel to EWD619) 1976–1979
  24. 695 Mathematics in an easy chair 1976–1979
  25. 697 Some beautiful arguments using mathematical induction 1976–1979
  26. 704 A machine for image construction in tomography 1979–1981
  27. 706 Image reconstruction in two-dimensional tomography 1979–1981
  28. 720 Why correctness must be a mathematical concern 1979–1981
  29. 723 On W.H.J.Feijen’s solution for the lexicographic minimum of a circular list 1979–1981
  30. 729 On well-shaped mathematical arguments 1979–1981
  31. 731 An experiment in mathematical exposition 1979–1981
  32. 732 The teachability of mathematical thinking (Draft contribution to “Mathematics Tomorrow”) 1979–1981
  33. 738 More mathematical folklore 1979–1981
  34. 740 A short proof of one of Fermat’s theorems 1979–1981
  35. 741 Partitioning the edges of the complete graphs into trees or cycles (by the Tuesday Afternoon Club) 1979–1981
  36. 743 A new policy for Mathematics Inc.? 1979–1981
  37. 763 A proof by Rutger M.Dijkstra and me 1979–1981
  38. 771 About 2-coloured 6-graphs 1979–1981
  39. 779 An assertional proof of a program by G.L.Peterson 1979–1981
  40. 785 Our presentation of K.A.Post’s proof of R.Stanley’s theorem (with A.J.M. van Gasteren) 1979–1981
  41. 787 A (new?) proof of a theorem of Euler’s on partitions 1979–1981
  42. 789 A minor improvement of Heapsort 1979–1981
  43. 789a A minor improvement of Heapsort 1979–1981
  44. 789b A minor improvement of Heapsort 1979–1981
  45. 794 Heapsort (with A.J.M. van Gasteren and W.H.J.Feijen) 1979–1981
  46. 795 An alternative to heapsort for sorting in situ 1979–1981
  47. 796 Smoothsort, an alternative for sorting in situ 1979–1981
  48. 796a Smoothsort, an alternative for sorting in situ 1979–1981
  49. 803 Lecture notes on the structure of programs and proofs 1981–1984
  50. 809 An introductory essay on three algorithms for sorting in situ (with A.J.M. van Gasteren) 1981–1984
  51. 810 Fast image construction in computerized axial tomography (CAT) (with A.J.M. van Gasteren) 1981–1984
  52. 810a Fast image construction in computerized axial tomography (CAT) (with A.J.M. van Gasteren) 1981–1984
  53. 817 An introduction to three algorithms for sorting in situ (with A.J.M. van Gasteren) 1981–1984
  54. 817a An introduction to three algorithms for sorting in situ (with A.J.M. van Gasteren) 1981–1984
  55. 819 Mathematical induction and computing science 1981–1984
  56. 840 Derivation of a termination detection algorithm for distributed computations (with W.H.J.Feijen and A.J.M. van Gasteren) 1981–1984
  57. 841a [Reflections on “A note on two problems in connexion with graphs” 1981–1984
  58. 866 An analytical proof of the Butterfly Theorem 1981–1984
  59. 870 My mother’s proof of the Butterfly Theorem (see EWD866) 1981–1984
  60. 889 User-friendly Mathematics 1981–1984
  61. 922 A belated proof of self-stabilization 1984–1987
  62. 932 Some simple theorems on incremental sorting 1984–1987
  63. 932a The streamlining of the mathematical argument 1984–1987
  64. 932b Some simple lemmata on incremental sorting 1984–1987
  65. 932c The streamlining of the mathematical argument 1984–1987
  66. 939 Incremental sorting once more 1984–1987
  67. 946 The proof of the pudding 1984–1987
  68. 948 Misra’s proof of Lamport’s mutual exclusion 1984–1987
  69. 960 On a proof I learned from prof. dr. J. Haantjes 1984–1987
  70. 962 Introducing a course on mathematical methodology 1984–1987
  71. 964 Node degree and the size of disconnected subgraphs 1984–1987
  72. 966 Management and Mathematics 1984–1987
  73. 987 On a class of graphs with modest diameter 1984–1987
  74. 987a On a class of graphs with modest diameter 1984–1987
  75. 999 Our proof format 1984–1987
  76. 1003 Graphs of modest diameter and degrees 1987–1991
  77. 1004 A methodological remark on mathematical induction 1987–1991
  78. 1010 A much neglected mathematical object 1987–1991
  79. 1011 Introducing my fall 1987 course on Mathematical Methodology 1987–1991
  80. 1020 The derivation of a proof by J.C.S.P. van der Woude 1987–1991
  81. 1021 A symmetry in the sorting task 1987–1991
  82. 1028 Euclid, Netty, and the prime numbers 1987–1991
  83. 1048 ATAC’s proof of Scholten’s theorem 1987–1991
  84. 1050 On the design of a simple proof for Morley’s Theorem 1987–1991
  85. 1059 0 Preface (Mathematical Methodology) 1987–1991
  86. 1063 An introductory example (Mathematical Methodology) 1987–1991
  87. 1065 An example of how to lengthen formal proofs 1987–1991
  88. 1067 A very first introductory example (Mathematical Methodology) 1987–1991
  89. 1068 On the quality criteria for mathematical writing (Mathematical Methodology) 1987–1991
  90. 1070 For brevity’s sake (Mathematical Methodology) 1987–1991
  91. 1073 How Computing Science created a new mathematical style 1987–1991
  92. 1075 Constructing the proof of Vizing’s Theorem (with J.R. Rao) 1987–1991
  93. 1076 From “Discrete Mathematics with Applications” by Susanna S. Epp 1987–1991
  94. 1078 Leibniz’s Principle (Mathematical Methodology) 1987–1991
  95. 1081 Mathematical induction and universal quantification 1987–1991
  96. 1082 Designing the proof of Vizing’s Theorem (with J.R. Rao) 1987–1991
  97. 1082a Designing the proof of Vizing’s Theorem (with J.R. Rao) 1987–1991
  98. 1090 The design of a proof of equality (Mathematical Methodology) 1987–1991
  99. 1091 More equality proofs with instantiated definitions (Mathematical Methodology) 1987–1991
  100. 1094 The undeserved status of the pigeon-hole principle (Mathematical Methodology) 1987–1991
  101. 1096 Potter’s proof of disjunction’s symmetry 1987–1991
  102. 1099 Inspired by Peter Auer’s proof 1987–1991
  103. 1101 Triangles in graphs: a sharp bound 1991–1995
  104. 1109 Simplifying a proof in our book 1991–1995
  105. 1120 Manipulating mathematical macros 1991–1995
  106. 1124 On a proof of Kaplansky’s Theorem 1991–1995
  107. 1128 Mathematical induction synthesized 1991–1995
  108. 1130 On the economy of doing mathematics 1991–1995
  109. 1136 A comparison of relational proofs 1991–1995
  110. 1143 Some annotated proofs 1991–1995
  111. 1144 More annotated proofs (a sequel to 1143) 1991–1995
  112. 1149 Perry Moerland’s proof of Carel Scholten’s theorem 1991–1995
  113. 1150 On the design of calculational proofs 1991–1995
  114. 1154 A derivation of a proof by D. Zagier 1991–1995
  115. 1155 A prime is in at most 1 way the sum of 2 squares 1991–1995
  116. 1155a A prime is in at most 1 way the sum of 2 squares 1991–1995
  117. 1158 A bagatelle on Euclid’s Algorithm 1991–1995
  118. 1174 The heuristics of a proof by Jan L.A. van de Snepscheut and Richard S. Bird 1991–1995
  119. 1174a Heuristics for a calculational proof 1991–1995
  120. 1180 Heuristics for a very simple Euclidean proof 1991–1995
  121. 1190 Problem 10406 from The American Mathematical Monthly, Volume 101, Number 8 / October 1994 1991–1995
  122. 1202 The complete ( n + 1)-graph in n -dimensional space 1995–2000
  123. 1203 Primes once more (re Kac & Ulam) 1995–2000
  124. 1219 “I have a proof that ....” 1995–2000
  125. 1220 Honors course “Mathematical Methodology”, Spring 1996 1995–2000
  126. 1221b Calculational proof design; an experiment 1995–2000
  127. 1224 Hm++, a new Professional Standard (From the desk of the chairman of the Board of Mathematics Inc.) 1995–2000
  128. 1253 Mathematical induction’s fixpoint 1995–2000
  129. 1256 Mathematical Methodology, Spring 1997 1995–2000
  130. 1268 The Mathematical Divide 1995–2000
  131. 1269 A simple proof of Hall’s Theorem 1995–2000
  132. 1273 On Dijkstra’s Lemma and Kruskal’s Algorithm 1995–2000
  133. 1274 For the record: Yossi Shiloach’s Algorithm 1995–2000
  134. 1277 Society’s role in mathematics 1995–2000
  135. 1282 On graphs whose nodes are Black or White 1995–2000
  136. 1294a Designing a calculational proof of Cantor’s theorem 1995–2000
  137. 1302 Once more bichrome triangles in complete graphs 2000–2002
  138. 1315 Indirect equality enriched (and a proof by Netty) 2000–2002

Languages, Compilers, and Programming Systems

  1. 91 EWD91 — Translation pending 1962–1964
  2. 200 The variable size machine 1967–1970
  3. 230 To the EDITOR ALGOL 68 1967–1970
  4. 270 EWD270 — Translation pending 1967–1970
  5. 372 A simple axiomatic basis for programming language constructs 1971–1973
  6. 392 Self-stabilization with four-state machines 1971–1973
  7. 396 Self-stabilization with three-state machines 1971–1973
  8. 514 On a language proposal for the Department of Defense 1975–1976
  9. 658 On language constraints enforceable by translators (An open letter to Lt.Col. William A.Whitaker) 1976–1979
  10. 659 On the BLUE Language submitted to DoD 1976–1979
  11. 660 On the GREEN Language submitted to the DoD 1976–1979
  12. 661 On the RED Language submitted to the DoD 1976–1979
  13. 662 On the YELLOW Language submitted to the DoD 1976–1979
  14. 667 On the foolishness of “natural language programming” 1976–1979
  15. 704 A machine for image construction in tomography 1979–1981

Education, Research Practice, and Essays

  1. 254 EWD254 — Translation pending 1967–1970
  2. 267 EWD267 — Translation pending 1967–1970
  3. 272 EWD272 — Translation pending 1967–1970
  4. 295 EWD295 — Translation pending 1967–1970
  5. 473 On the teaching of programming, i.e. on the teaching of thinking 1973–1975
  6. 477 EWD477 — Translation pending 1973–1975
  7. 481 EWD481 — Translation pending 1973–1975
  8. 483 EWD483 — Translation pending 1973–1975
  9. 486 EWD486 — Translation pending 1973–1975
  10. 489 EWD489 — Translation pending 1973–1975
  11. 494a EWD494a — Translation pending 1973–1975
  12. 495 EWD495 — Translation pending 1973–1975
  13. 499 EWD499 — Translation pending 1973–1975
  14. 543 EWD543 — Translation pending 1975–1976
  15. 548 EWD548 — Translation pending 1975–1976
  16. 549 EWD549 — Translation pending 1975–1976
  17. 551 EWD551 — Translation pending 1975–1976
  18. 552 EWD552 — Translation pending 1975–1976
  19. 556 EWD556 — Translation pending 1975–1976
  20. 557 EWD557 — Translation pending 1975–1976
  21. 558 EWD558 — Translation pending 1975–1976
  22. 559 EWD559 — Translation pending 1975–1976
  23. 560 EWD560 — Translation pending 1975–1976
  24. 565 EWD565 — Translation pending 1975–1976
  25. 567 EWD567 — Translation pending 1975–1976
  26. 569 EWD569 — Translation pending 1975–1976
  27. 583 EWD583 — Translation pending 1975–1976
  28. 586 EWD586 — Translation pending 1975–1976
  29. 587 EWD587 — Translation pending 1975–1976
  30. 588 EWD588 — Translation pending 1975–1976
  31. 589 EWD589 — Translation pending 1975–1976
  32. 593 EWD593 — Translation pending 1975–1976
  33. 599 EWD599 — Translation pending 1975–1976
  34. 604 Paying logical conscience-money to the fair demon 1976–1979
  35. 606 EWD606 — Translation pending 1976–1979
  36. 609 EWD609 — Translation pending 1976–1979
  37. 612 EWD612 — Translation pending 1976–1979
  38. 615 EWD615 — Translation pending 1976–1979
  39. 616 EWD616 — Translation pending 1976–1979
  40. 617 EWD617 — Translation pending 1976–1979
  41. 620 EWD620 — Translation pending 1976–1979
  42. 621 EWD621 — Translation pending 1976–1979
  43. 626 EWD626 — Translation pending 1976–1979
  44. 637 The Three Golden Rules for Successful Scientific Research 1976–1979
  45. 682 The nature of Computer Science (first draft) 1976–1979
  46. 692 A review of the 1977 Turing Award Lecture by John Backus 1976–1979
  47. 698 Trip report E.W.Dijkstra, Oxford University, 10–15 Jan. 1979 1976–1979
  48. 709 My hopes of computing science 1979–1981
  49. 716 A short talk to my students about money 1979–1981
  50. 757 A misguided educational effort 1979–1981
  51. 766 An educational stupidity 1979–1981
  52. 803 Lecture notes on the structure of programs and proofs 1981–1984
  53. 819 Mathematical induction and computing science 1981–1984
  54. 835 Lecture notes “Predicate transformers” (Draft) 1981–1984
  55. 861 Research proposal: Our plans for the years to come (with A.J.M. van Gasteren) 1981–1984
  56. 868 Computers and General Education: a position paper 1981–1984
  57. 896 On the nature of computing science 1981–1984
  58. 898 The threats to computing science 1981–1984
  59. 920 Can computing science save the computer industry? 1984–1987
  60. 936 On anthropomorphism in science 1984–1987
  61. 952 Science fiction and science reality in computing 1984–1987
  62. 956 Address to my students 1984–1987
  63. 963 Visuals for BP’s Venture Research Conference 1984–1987
  64. 977 An address to my students (16.9.1986) 1984–1987
  65. 981 Address to my students (23.9.1986) 1984–1987
  66. 988a How experimental is computing science? 1984–1987
  67. 993 The nature of my research and why I do it 1984–1987
  68. 997 Computing Science in the United Kingdom 1984–1987
  69. 1008 What computing science is about 1987–1991
  70. 1024 A new science, from birth to maturity 1987–1991
  71. 1036 On the cruelty of really teaching computing science 1987–1991
  72. 1073 How Computing Science created a new mathematical style 1987–1991
  73. 1115 A manuscript for the Coahuila student chapter of the ACM 1991–1995
  74. 1127n Referee’s Report on "A transformational approach to specifying recovery in asynchronous communicating systems" by Zhiming Liu and Mathai Joseph, University of Warwick. Paper No. 40 ( withdrawn ) 1991–1995
  75. 1209 Why American Computing Science seems incurable 1995–2000
  76. 1284 Computing Science: Achievements and Challenges 1995–2000
  77. 1304 The end of computing science? 2000–2002
  78. 1305 Answers to questions from students of Software Engineering 2000–2002

Letters, Reports, Reviews, and Miscellany

  1. 37 A review of the IBM 1620 Data Processing System 1962–1964
  2. 131 EWD131 — Translation pending 1964–1967
  3. 137 EWD137 — Translation pending 1964–1967
  4. 222 EWD222 — Translation pending 1967–1970
  5. 252 EWD252 — Translation pending 1967–1970
  6. 257 EWD257 — Translation pending 1967–1970
  7. 286 EWD286 — Translation pending 1967–1970
  8. 288a EWD288a — Translation pending 1967–1970
  9. 292 Letter to professor C.A.R. Hoare (31 August 1970) 1967–1970
  10. 308 EWD308 — Translation pending 1971–1973
  11. 311 [Review of] Bauer, Goos: “Informatik, Erster Teil” Heidelberger Taschenbuecher, Band 80 Springer Verlag, 1971 1971–1973
  12. 312 EWD312 — Translation pending 1971–1973
  13. 316A EWD316A — Translation pending 1971–1973
  14. 330 [Book review of: Bauer-Goos, Informatik, Zweiter Teil] 1971–1973
  15. 341 EWD341 — Translation pending 1971–1973
  16. 343 EWD343 — Translation pending 1971–1973
  17. 348 EWD348 — Translation pending 1971–1973
  18. 351 EWD351 — Translation pending 1971–1973
  19. 368 EWD368 — Translation pending 1971–1973
  20. 385 Trip report E.W.Dijkstra Summer School Munich, July 25 to August 4, 1973 1971–1973
  21. 387 Trip report IBM Seminar “Communication and Computers”, Newcastle, Sept. 1973 1971–1973
  22. 389 Trip report I.U.C.C. Colloquium, Canterbury, 18th–21st Sept. 1973 1971–1973
  23. 398 Sequencing primitives revisited 1971–1973
  24. 399 An immediate sequel to EWD398: “Sequencing primitives revisited” 1971–1973
  25. 404 A trip to France: 13th–20th December 1973 1973–1975
  26. 406 A trip to the U.S.A., 5th–25th January 1974 1973–1975
  27. 407 Acceptance speech for the AFIPS Harry Goode Memorial Award 1974 1973–1975
  28. 420 Tripreport E.W.Dijkstra, Luxembourg, 7–12 April 1974 1973–1975
  29. 423 Trip report E.W.Dijkstra, W.G.2.3 Meeting “Boldern” 28th April–3rd May 1974 1973–1975
  30. 425 Trip report E.W.Dijkstra, USA and Canada, 5th–25th May 1974 1973–1975
  31. 427 Speech at the occasion of an anniversary 1973–1975
  32. 432 [A letter to C.A.R. Hoare, 13 July 1974] 1973–1975
  33. 448 Trip report E.W.Dijkstra, Edinburgh and Newcastle, 1–6 September 1974 1973–1975
  34. 454 [Letter to Dr. H.Bekic, 8 October 1974] 1973–1975
  35. 466 Trip report E.W.Dijkstra, Meeting IFIP W.G.2.3., Munich, 8–14 December 1974 1973–1975
  36. 470 Letter to the referees of EWD418 1973–1975
  37. 474 Trip report visit ETH Zurich, 3–4 February 1975 by E.W.Dijkstra 1973–1975
  38. 475 A letter to my old friend Jonathan 1973–1975
  39. 484 Tripreport E.W.Dijkstra, London, 9–10 March 1975 1973–1975
  40. 487 Letter to the Burroughs recipients of the EWD-series 1973–1975
  41. 493 EWD493 — Translation pending 1973–1975
  42. 494 Trip report E.W.Dijkstra 16th April/7th May, U.S.A. and Canada 1973–1975
  43. 501 Variations on a theme: an open letter to C.A.R. Hoare 1975–1976
  44. 506 Tripreport E.W.Dijkstra: NATO Summer School Marktoberdorf 1975 1975–1976
  45. 509 First speech, autumn 1975 1975–1976
  46. 511 Tripreport E.W.Dijkstra W.G.2.3, Baden, 1–5 September 1975 1975–1976
  47. 513 Tripreport E.W.Dijkstra Newcastle, 8–12 September 1975 1975–1976
  48. 515 September 20, 1975 1975–1976
  49. 516 EWD516 — Translation pending 1975–1976
  50. 518 EWD518 — Translation pending 1975–1976
  51. 521 EWD521 — Translation pending 1975–1976
  52. 522 EWD522 — Translation pending 1975–1976
  53. 523 EWD523 — Translation pending 1975–1976
  54. 529 EWD529 — Translation pending 1975–1976
  55. 530 Negende toespraak, najaar 1975 1975–1976
  56. 531 EWD531 — Translation pending 1975–1976
  57. 532 An open letter to L.Bass 1975–1976
  58. 534 EWD534 — Translation pending 1975–1976
  59. 537 EWD537 — Translation pending 1975–1976
  60. 541 EWD541 — Translation pending 1975–1976
  61. 542 EWD542 — Translation pending 1975–1976
  62. 544 An open letter to Ross Honsberger 1975–1976
  63. 547 Tripreport E.W.Dijkstra, England and USA, 3-26 January 1976 1975–1976
  64. 561 A “non trip report” from E.W.Dijkstra 1975–1976
  65. 572 Tripreport E.W.Dijkstra, U.S.A. and U.K., 8 June - 10 July 1976 1975–1976
  66. 574 A letter to Professor Zohar Manna, 26 July 1976 1975–1976
  67. 577 Tripreport E.W.Dijkstra, ECI-conference 9–12 August 1976, Amsterdam 1975–1976
  68. 581 A somewhat open letter to Professor John McCarthy 1975–1976
  69. 584 Tripreport E.W.Dijkstra, Poland and USSR, 4-25 September 1976 1975–1976
  70. 585 Tripreport E.W.Dijkstra, Tokyo, 28 Sep.—3 Oct. 1976 1975–1976
  71. 596a Tripreport E.W.Dijkstra, Copenhagen 10–12 Nov. 1976 1975–1976
  72. 601 Tripreport E.W.Dijkstra, Munich 24–26 November 1976 1976–1979
  73. 603 Tripreport E.W.Dijkstra, St.Pierre-de-Chartreuse, 12–19 Dec.1976 1976–1979
  74. 605 Tripreport E.W.Dijkstra, Columbus - Pittsburgh - Paoli, 12–22 January 1977 1976–1979
  75. 613 Tripreport E.W.Dijkstra, Australia, 16 February 1977 – 21 March 1977 1976–1979
  76. 614 A somewhat open letter to EAA or: why I proved the boundedness of the non-determinacy in the way I did 1976–1979
  77. 633 Tripreport E.W.Dijkstra, 29 July – 21 August 1977 1976–1979
  78. 635 Tripreport E.W.Dijkstra, Newcastle-upon-Tyne, 5–10 Sept. 1977 1976–1979
  79. 644 Letter to J. Arsac 1976–1979
  80. 645 Tripreport E.W.Dijkstra, USA 19–30 October 1977 1976–1979
  81. 665 Trip report E.W.Dijkstra, U.K. – Bahamas – U.S.A., 11–30 April 1978 1976–1979
  82. 669 A book review 1976–1979
  83. 674 Tripreport E.W.Dijkstra, Zürich, 2–7 July 1978 1976–1979
  84. 676 Tripreport E.W.Dijkstra, Marktoberdorf 24 July – 6 August 1978 1976–1979
  85. 679 Tripreport E.W.Dijkstra, Newcastle-London-Lancaster, 4–13 Sep. 1978 1976–1979
  86. 680 A book review 1976–1979
  87. 689 Tripreport E.W.Dijkstra, Valley Forge, 28 Oct. – 2 Nov. 1978 1976–1979
  88. 691 On improving the state of the art (A somewhat open letter to dr. Martin Rem) 1976–1979
  89. 694 Tripreport E.W.Dijkstra, Detroit, Austin, Philadelphia, 25 Nov. – 9 Dec. 1978 1976–1979
  90. 711 Trip report E.W.Dijkstra, Ithaca, Albany, Austin (Texas), 26/5 – 10/6 1979 1979–1981
  91. 712 Trip report E.W.Dijkstra, Antwerp, 24–29 June 1979 1979–1981
  92. 714 Trip report E.W.Dijkstra, Mission Viejo, Santa Cruz, Austin, 29 July – 8 September 1979 1979–1981
  93. 715 Trip report E.W.Dijkstra, Munich – London, 16–29 September 1979 1979–1981
  94. 722 A book review for the IBM Systems Journal 1979–1981
  95. 725 Trip report E.W.Dijkstra, Liege, Nov.–Dec.1979 1979–1981
  96. 727 Trip report E.W.Dijkstra, U.S.A. 12 Jan. – 2 Feb. 1980 1979–1981
  97. 739 A somewhat open letter to the Editor-in-Chief of Acta Informatica 1979–1981
  98. 745 Trip report E.W.Dijkstra, Los Angeles, Austin (Texas), and Portland, 6–28 August 1980 1979–1981
  99. 746 Trip report E.W.Dijkstra, Newcastle-upon-Tyne, 1–5 Sep. 1980 1979–1981
  100. 748 A somewhat open letter to Wladislaw M.Turski 1979–1981
  101. 759 A somewhat open letter to D.A.Turner 1979–1981
  102. 760 A somewhat open letter to F.Kroeger 1979–1981
  103. 773 Trip report E.W.Dijkstra, Han-sur-Lesse, 7–12 Jan. 1981 1979–1981
  104. 774 Trip report E.W.Dijkstra, California, 17–31 January 1981 1979–1981
  105. 776 Lambek and Moser revisited 1979–1981
  106. 778 A somewhat open letter to Nils J.Nilsson 1979–1981
  107. 786 Trip report E.W.Dijkstra, England, 23 April 1981 1979–1981
  108. 790 Trip report E.W.Dijkstra, München, 19 May 1981 1979–1981
  109. 798 Trip report E.W.Dijkstra, Newcastle, 19–25 July 1981 1979–1981
  110. 799 Trip report E.W.Dijkstra, Marktoberdorf, 26/7–10/8/81 1979–1981
  111. 802 Trip report E.W.Dijkstra, Scotland, Newcastle 31 Aug.–15 Sep. 1981 1981–1984
  112. 805 Trip report E.W.Dijkstra, Amsterdam, 26–29 Oct. 1981 1981–1984
  113. 806 Trip report E.W.Dijkstra, USA, 1–27 Nov. 1981 1981–1984
  114. 814 A review of a book on PEARL 1981–1984
  115. 826 Trip report E.W.Dijkstra, USA, 20 May 1982 – 14 June 1982 1981–1984
  116. 837 Trip report E.W.Dijkstra, Newcastle-upon Tyne, 6–10 Sep. 1982 1981–1984
  117. 838 Trip report E.W.Dijkstra, Copenhagen, 10–16 Sep. 1982 1981–1984
  118. 839 Trip report E.W.Dijkstra, Utrecht 30 Sep.–1 Oct. 1982 1981–1984
  119. 844 A universal quantification revisited (with C.S.Scholten) 1981–1984
  120. 847 Trip report E.W.Dijkstra, Australia, 19 Jan.1983 – 12 Feb.1983 1981–1984
  121. 850 Trip report E.W.Dijkstra, Helsinki, 1–4 March 1983 1981–1984
  122. 855 Trip report E.W.Dijkstra, Barcelona 5–7 June 1983 1981–1984
  123. 858 Trip report E.W.Dijkstra, USA, 10 June–3 July 1983 1981–1984
  124. 865 Trip report E.W.Dijkstra, Brasil & USA, 17 Oct.– 6 Nov. 1983 1981–1984
  125. 873 Trip report E.W.Dijkstra, London and Colchester, 16–20 Jan. 1984 1981–1984
  126. 879 Trip report E.W.Dijkstra, London, 14–17 February 1984 1981–1984
  127. 885 Trip report E.W.Dijkstra, Muenchen, 12–14 April 1984 1981–1984
  128. 887 Trip report E.W.Dijkstra, USA, 23 April –10 May 1984 1981–1984
  129. 888 Trip report E.W.Dijkstra, Zürich, 22–24 May 1984 1981–1984
  130. 891 Well-founded sets revisited 1981–1984
  131. 892 Trip report E.W.Dijkstra, London, 12–14 June 1984 1981–1984
  132. 893 Trip report E.W.Dijkstra, USA, 17–26 June 1984 1981–1984
  133. 895 Trip report E.W.Dijkstra, Marktoberdorf, 30 July – 12 Aug. 1984 1981–1984
  134. 899 A review of a paper in AI 1981–1984
  135. 906 Trip report E.W.Dijkstra, Nuenen & London, 10 Dec.’84 – 10 Jan.’85 1984–1987
  136. 907 Trip report E.W.Dijkstra, Netherlands, Austria, 23–31 Jan. 1985 1984–1987
  137. 909 Trip report E.W.Dijkstra, Westboro-Boston, 14–17 Feb. 1985 1984–1987
  138. 911 Trip report E.W.Dijkstra, Tulsa, 1–6 March 1985 1984–1987
  139. 923 Trip report E.W.Dijkstra, Ithaca, Newport, 30 May – 13 June 1985 1984–1987
  140. 925 Trip report E.W.Dijkstra, London, 25–27 June 1985 1984–1987
  141. 947 A letter to a typewriter manufacturer 1984–1987
  142. 951 Trip report E.W.Dijkstra, Europe, 13.12.1985 – 10.1.1986 1984–1987
  143. 968 Trip report E.W.Dijkstra, Marktoberdorf, 29 July – 10 Aug l986 1984–1987
  144. 1006 Trip report E.W.Dijkstra, Stanford/Palo Alto, 26–29 March l987 1987–1991
  145. 1014 A monotonicity argument revisited 1987–1991
  146. 1026 Trip report E.W.Dijkstra, Marktoberdorf 1988 1987–1991
  147. 1029 The linear search revisited (with W.H.J.Feijen) 1987–1991
  148. 1033 Trip report E.W.Dijkstra, Zürich, 15–20 Oct. 1988 1987–1991
  149. 1049 A somewhat open letter to Uri Leron 1987–1991
  150. 1087 A conversion routine revisited 1987–1991
  151. 1113 A somewhat open letter to Ben Kuipers 1991–1995
  152. 1145 A somewhat open letter to Cathleen Synge Morawetz 1991–1995
  153. 1172 Pythagorean triples, or the design of a theorem 1991–1995
  154. 1205 A trip to Harvard Law School, 10–11 April 1995 1995–2000
  155. 1217 Comments on a Review of the Department 1995–2000
  156. 1227 A somewhat open letter to David Gries 1995–2000
  157. 1252 Convocation speech, December 8, 1996 1995–2000
  158. 1310 Three trip reports rolled into one: 2001.04.16 – 2001.07.06 2000–2002