Numerical Index

This is the complete numerical archive index. For the curated research reading map, return to Research Reading Map or Home.

0 to 99

  1. 28 Substitution processes 1962–1964
  2. 32 Some meditations on Advanced Programming 1962–1964
  3. 35 About the sequentiality of process descriptions 1962–1964
  4. 37 A review of the IBM 1620 Data Processing System 1962–1964
  5. 41 My main concerns for the time being are Needs review 1962–1964
  6. 51 Multiprogramming and the X8 Needs review 1962–1964
  7. 54 Multiprogramming and the X8, Part 2 Needs review 1962–1964
  8. 57 EWD57 — Translation pending 1962–1964
  9. 62 EWD62 — Translation pending 1962–1964
  10. 65 EWD65 — Translation pending 1962–1964
  11. 68 Some comments on the aims of MIRFAC 1962–1964
  12. 69 EWD69 — Translation pending 1962–1964
  13. 70 EWD70 — Translation pending 1962–1964
  14. 71 EWD71 — Translation pending 1962–1964
  15. 72 EWD72 — Translation pending 1962–1964
  16. 74 EWD74 — Translation pending 1962–1964
  17. 75 EWD75 — Translation pending 1962–1964
  18. 77 EWD77 — Translation pending 1962–1964
  19. 82 EWD82 — Translation pending 1962–1964
  20. 84 EWD84 — Translation pending 1962–1964
  21. 86 EWD86 — Translation pending 1962–1964
  22. 89 EWD89 — Translation pending 1962–1964
  23. 91 EWD91 — Translation pending 1962–1964
  24. 96 Embedding complex arithmetic 1962–1964

100 to 199

  1. 101 Description of the object program 1964–1967
  2. 102 Description of the object program, II 1964–1967
  3. 105 Description of the object program (a sequel to EWD102) 1964–1967
  4. 108 An algorithm for preventing deadly embrace Needs review 1964–1967
  5. 111 EWD111 — Translation pending 1964–1967
  6. 112 EWD112 — Translation pending 1964–1967
  7. 113 Segment control 1964–1967
  8. 116 The banker’s algorithm and refinements thereof Needs review 1964–1967
  9. 117 Programming considered as a human activity 1964–1967
  10. 118 EWD118 — Translation pending 1964–1967
  11. 123 Cooperating sequential processes 1964–1967
  12. 126 The multiprogramming system for the EL X8 THE 1964–1967
  13. 130 A sequel to EWD126 1964–1967
  14. 131 EWD131 — Translation pending 1964–1967
  15. 132 An Experiment with the “record class” as suggested by C.A.R.Hoare 1964–1967
  16. 137 EWD137 — Translation pending 1964–1967
  17. 139 EWD139 — Translation pending 1964–1967
  18. 140 EWD140 — Translation pending 1964–1967
  19. 145 EWD145 — Translation pending 1964–1967
  20. 147 Proposal for the input and the notation of the system 1964–1967
  21. 149 EWD149 — Translation pending 1964–1967
  22. 150 EWD150 — Translation pending 1964–1967
  23. 155 Context dependent names 1964–1967
  24. 157 EWD157 — Translation pending 1964–1967
  25. 158 EWD158 — Translation pending 1964–1967
  26. 161 EWD161 — Translation pending 1964–1967
  27. 163 EWD163 — Translation pending 1964–1967
  28. 164 EWD164 — Translation pending 1964–1967
  29. 167 EWD167 — Translation pending 1964–1967
  30. 184 EWD184 — Translation pending 1964–1967
  31. 188 EWD188 — Translation pending 1964–1967
  32. 190 EWD190 — Translation pending 1964–1967
  33. 191 EWD191 — Translation pending 1964–1967
  34. 194 EWD194 — Translation pending 1964–1967
  35. 196 The structure of the “THE”-multiprogramming system 1964–1967
  36. 198 An effort towards structuring of programmed processes 1964–1967

200 to 299

  1. 200 The variable size machine 1967–1970
  2. 201 A sequel to EWD200 1967–1970
  3. 206 A sequel to EWD201 1967–1970
  4. 209 A constructive approach to the problem of program correctness 1967–1970
  5. 209A A constructive approach to the problem of program correctness 1967–1970
  6. 214 EWD214 — Translation pending 1967–1970
  7. 215 A case against the GO TO statement 1967–1970
  8. 221 [Raw code for computing De Bruijn-sequences] 1967–1970
  9. 222 EWD222 — Translation pending 1967–1970
  10. 224 EWD224 — Translation pending 1967–1970
  11. 227 Stepwise program construction 1967–1970
  12. 229 EWD229 — Translation pending 1967–1970
  13. 230 To the EDITOR ALGOL 68 1967–1970
  14. 231 EWD231 — Translation pending 1967–1970
  15. 232 EWD232 — Translation pending 1967–1970
  16. 235 EWD235 — Translation pending 1967–1970
  17. 236 Complexity controlled by hierarchical ordering of function and variability 1967–1970
  18. 237 A preliminary investigation into Computer Assisted Programming 1967–1970
  19. 238 Computation versus program 1967–1970
  20. 239 On trading storage against computation time 1967–1970
  21. 240 The moral of EWD237 – EWD239 1967–1970
  22. 241 Towards correct programs 1967–1970
  23. 242 EWD242 — Translation pending 1967–1970
  24. 243 EWD243 — Translation pending 1967–1970
  25. 244 EWD244 — Translation pending 1967–1970
  26. 245 On useful structuring 1967–1970
  27. 246 EWD246 — Translation pending 1967–1970
  28. 247 [“Journal for half-baked Ideas”] 1967–1970
  29. 247a EWD247a — Translation pending 1967–1970
  30. 249 Notes on Structured Programming 1967–1970
  31. 251 Requirements of programming tools 1967–1970
  32. 252 EWD252 — Translation pending 1967–1970
  33. 252a EWD252a — Translation pending 1967–1970
  34. 253 EWD253 — Translation pending 1967–1970
  35. 253a EWD253a — Translation pending 1967–1970
  36. 254 EWD254 — Translation pending 1967–1970
  37. 254a EWD254a — Translation pending 1967–1970
  38. 255 EWD255 — Translation pending 1967–1970
  39. 257 EWD257 — Translation pending 1967–1970
  40. 259 EWD259 — Translation pending 1967–1970
  41. 260 Plotting a curve with a printer 1967–1970
  42. 261 EWD261 — Translation pending 1967–1970
  43. 264 On understanding programs 1967–1970
  44. 267 EWD267 — Translation pending 1967–1970
  45. 268 Structured programming 1967–1970
  46. 270 EWD270 — Translation pending 1967–1970
  47. 272 EWD272 — Translation pending 1967–1970
  48. 273 The programming task considered as an intellectual challenge 1967–1970
  49. 275 Structure of an extendable operating system 1967–1970
  50. 278 EWD278 — Translation pending 1967–1970
  51. 279 The programming laboratory project 1967–1970
  52. 281 EWD281 — Translation pending 1967–1970
  53. 282 A tree-structured system 1967–1970
  54. 286 EWD286 — Translation pending 1967–1970
  55. 287 Sans titre (but most definitely a predecessor to EWD316, “A short introduction into the art of programming”) 1967–1970
  56. 288 Concern for correctness as a guiding principle for program construction 1967–1970
  57. 288a EWD288a — Translation pending 1967–1970
  58. 292 Letter to professor C.A.R. Hoare (31 August 1970) 1967–1970
  59. 295 EWD295 — Translation pending 1967–1970
  60. 298 EWD298 — Translation pending 1967–1970

300 to 399

  1. 300 EWD300 — Translation pending 1971–1973
  2. 301 EWD301 — Translation pending 1971–1973
  3. 302 Design considerations in more detail 1971–1973
  4. 303 On the reliability of programs 1971–1973
  5. 306 EWD306 — Translation pending 1971–1973
  6. 307 EWD307 — Translation pending 1971–1973
  7. 308 EWD308 — Translation pending 1971–1973
  8. 309 EWD309 — Translation pending 1971–1973
  9. 310 Hierarchical ordering of sequential processes 1971–1973
  10. 311 [Review of] Bauer, Goos: “Informatik, Erster Teil” Heidelberger Taschenbuecher, Band 80 Springer Verlag, 1971 1971–1973
  11. 312 EWD312 — Translation pending 1971–1973
  12. 316 A short introduction to the art of programming 1971–1973
  13. 316A EWD316A — Translation pending 1971–1973
  14. 317 On a methodology of design 1971–1973
  15. 319 A class of allocation strategies inducing bounded delays only 1971–1973
  16. 325 EWD325 — Translation pending 1971–1973
  17. 329 Information streams sharing a finite buffer 1971–1973
  18. 330 [Book review of: Bauer-Goos, Informatik, Zweiter Teil] 1971–1973
  19. 338 Parallelism in multi-record transactions (with C.S.Scholten) 1971–1973
  20. 340 The humble programmer 1971–1973
  21. 341 EWD341 — Translation pending 1971–1973
  22. 343 EWD343 — Translation pending 1971–1973
  23. 345 EWD345 — Translation pending 1971–1973
  24. 348 EWD348 — Translation pending 1971–1973
  25. 349 EWD349 — Translation pending 1971–1973
  26. 351 EWD351 — Translation pending 1971–1973
  27. 353 EWD353 — Translation pending 1971–1973
  28. 356 Advanced Course on Computer Systems Architecture (Grenoble, December 1972) 1971–1973
  29. 360 On the Necessity of Correctness Proofs 1971–1973
  30. 361 Programming as a discipline of mathematical nature 1971–1973
  31. 362 EWD362 — Translation pending 1971–1973
  32. 363 EWD363 — Translation pending 1971–1973
  33. 364 EWD364 — Translation pending 1971–1973
  34. 365 A parabel 1971–1973
  35. 366 EWD366 — Translation pending 1971–1973
  36. 367 On the axiomatic definition of semantics 1971–1973
  37. 368 EWD368 — Translation pending 1971–1973
  38. 372 A simple axiomatic basis for programming language constructs 1971–1973
  39. 374 The analysis of multiprogrammed systems of unspecified degree of parallellism 1971–1973
  40. 375 A non algebraic example of a constructive correctness proof 1971–1973
  41. 376 Finding the maximum strong components in a directed graph 1971–1973
  42. 379 On a connection pattern between 2** N elements 1971–1973
  43. 384 EWD384 — Translation pending 1971–1973
  44. 385 Trip report E.W.Dijkstra Summer School Munich, July 25 to August 4, 1973 1971–1973
  45. 386 The solution to a cyclic relaxation problem 1971–1973
  46. 387 Trip report IBM Seminar “Communication and Computers”, Newcastle, Sept. 1973 1971–1973
  47. 389 Trip report I.U.C.C. Colloquium, Canterbury, 18th–21st Sept. 1973 1971–1973
  48. 391 Self-stabilization in spite of distributed control 1971–1973
  49. 392 Self-stabilization with four-state machines 1971–1973
  50. 393 On representational abstraction 1971–1973
  51. 395 Trip report E.W.Dijkstra IFIP Working Group W.G.2.3 “On Programming Methodology”, 21st–26th October 1973, Blanchland, England 1971–1973
  52. 396 Self-stabilization with three-state machines 1971–1973
  53. 397 Self-stabilizing systems with distributed control 1971–1973
  54. 398 Sequencing primitives revisited 1971–1973
  55. 399 An immediate sequel to EWD398: “Sequencing primitives revisited” 1971–1973

400 to 499

  1. 401 The characterization of semantics 1973–1975
  2. 404 A trip to France: 13th–20th December 1973 1973–1975
  3. 405 Synchronization and sequencing Translation pending 1973–1975
  4. 406 A trip to the U.S.A., 5th–25th January 1974 1973–1975
  5. 407 Acceptance speech for the AFIPS Harry Goode Memorial Award 1974 1973–1975
  6. 408 A time-wise hierarchy imposed upon the use of a two-level store 1973–1975
  7. 413 The formal treatment of some small examples. 1973–1975
  8. 415 A beautiful proof of a probably useless theorem (with W.H.J.Feijen) 1973–1975
  9. 416 On avoiding the infinite 1973–1975
  10. 417 On the abolishment of the subscripted variable 1973–1975
  11. 418 Guarded commands, non-determinacy and a calculus for the derivation of programs 1973–1975
  12. 420 Tripreport E.W.Dijkstra, Luxembourg, 7–12 April 1974 1973–1975
  13. 423 Trip report E.W.Dijkstra, W.G.2.3 Meeting “Boldern” 28th April–3rd May 1974 1973–1975
  14. 425 Trip report E.W.Dijkstra, USA and Canada, 5th–25th May 1974 1973–1975
  15. 426 Self-stabilizing systems in spite of distributed control 1973–1975
  16. 427 Speech at the occasion of an anniversary 1973–1975
  17. 428 Array variables. 1973–1975
  18. 429 A generalization of the Sheffer Stroke for n-valued logic (by C.S.Scholten) 1973–1975
  19. 432 [A letter to C.A.R. Hoare, 13 July 1974] 1973–1975
  20. 435 Associons: an effort towards accomodating potentially ultra-high concurrency (with W.H.J.Feijen and M.Rem) 1973–1975
  21. 439 Associons continued (with W.H.J.Feijen and M.Rem) 1973–1975
  22. 440 The problem of the most isolated villages. 1973–1975
  23. 442 Inside “Mathematics Inc” 1973–1975
  24. 443 A multidisciplinary approach to mathematics 1973–1975
  25. 447 On the role of scientific thought 1973–1975
  26. 448 Trip report E.W.Dijkstra, Edinburgh and Newcastle, 1–6 September 1974 1973–1975
  27. 449 EWD449 — Translation pending 1973–1975
  28. 450 Correctness concerns and, among other things, why they are resented 1973–1975
  29. 451 Lord, deliver us from charlatans 1973–1975
  30. 452 About robustness and the like 1973–1975
  31. 453 Finding the maximal strong components in a directed graph. 1973–1975
  32. 454 [Letter to Dr. H.Bekic, 8 October 1974] 1973–1975
  33. 456 Determinism and recursion versus non-determinism and the transitive closure 1973–1975
  34. 458 On non-determinacy being bounded. 1973–1975
  35. 459 The pattern matching problem. 1973–1975
  36. 462 A time-wise hierarchy imposed upon the use of a two-level store 1973–1975
  37. 463 Some questions 1973–1975
  38. 464 A new elephant built from mosquitos humming in harmony 1973–1975
  39. 465 Monotonic replacement algorithms and their implementation 1973–1975
  40. 466 Trip report E.W.Dijkstra, Meeting IFIP W.G.2.3., Munich, 8–14 December 1974 1973–1975
  41. 469 Programming methodologies, their objectives and their nature 1973–1975
  42. 470 Letter to the referees of EWD418 1973–1975
  43. 471 EWD471 — Translation pending 1973–1975
  44. 472 Guarded commands, non-determinacy and formal derivation of programs 1973–1975
  45. 473 On the teaching of programming, i.e. on the teaching of thinking 1973–1975
  46. 474 Trip report visit ETH Zurich, 3–4 February 1975 by E.W.Dijkstra 1973–1975
  47. 475 A letter to my old friend Jonathan 1973–1975
  48. 476 Concurrent programming: a preliminary investigation 1973–1975
  49. 477 EWD477 — Translation pending 1973–1975
  50. 478 On one-sided smoothing of event sequences 1973–1975
  51. 479 EWD479 — Translation pending 1973–1975
  52. 480 “Craftsman or scientist?” 1973–1975
  53. 481 EWD481 — Translation pending 1973–1975
  54. 482 Exercises in making programs robust 1973–1975
  55. 483 EWD483 — Translation pending 1973–1975
  56. 484 Tripreport E.W.Dijkstra, London, 9–10 March 1975 1973–1975
  57. 485 Marketing questionnaire “A Discipline of Programming” 1973–1975
  58. 486 EWD486 — Translation pending 1973–1975
  59. 487 Letter to the Burroughs recipients of the EWD-series 1973–1975
  60. 489 EWD489 — Translation pending 1973–1975
  61. 492 On-the-fly garbage collection: an exercise in multiprocessing 1973–1975
  62. 493 EWD493 — Translation pending 1973–1975
  63. 494 Trip report E.W.Dijkstra 16th April/7th May, U.S.A. and Canada 1973–1975
  64. 494a EWD494a — Translation pending 1973–1975
  65. 495 EWD495 — Translation pending 1973–1975
  66. 496A On-the-fly garbage collection: an exercise in cooperation (preliminary version) (with Leslie Lamport, A.J.Martin, C.S.Scholten, and E.F.M.Steffens) 1973–1975
  67. 496B On-the-fly garbage collection: an exercise in cooperation (with Leslie Lamport, A.J.Martin, C.S.Scholten, and E.F.M.Steffens) 1973–1975
  68. 497 A challenge to memory designers? 1973–1975
  69. 498 How do we tell truths that might hurt? 1973–1975
  70. 499 EWD499 — Translation pending 1973–1975

500 to 599

  1. 500 After many a sobering experience 1975–1976
  2. 501 Variations on a theme: an open letter to C.A.R. Hoare 1975–1976
  3. 502 On a gauntlet thrown by David Gries 1975–1976
  4. 503 A post-scriptum to EWD501 1975–1976
  5. 504 Erratum and embellishments of EWD503 1975–1976
  6. 506 Tripreport E.W.Dijkstra: NATO Summer School Marktoberdorf 1975 1975–1976
  7. 507 On a gauntlet thrown by David Gries 1975–1976
  8. 508 A synthesis emerging? 1975–1976
  9. 509 First speech, autumn 1975 1975–1976
  10. 511 Tripreport E.W.Dijkstra W.G.2.3, Baden, 1–5 September 1975 1975–1976
  11. 512 Comments at a symposium 1975–1976
  12. 513 Tripreport E.W.Dijkstra Newcastle, 8–12 September 1975 1975–1976
  13. 514 On a language proposal for the Department of Defense 1975–1976
  14. 515 September 20, 1975 1975–1976
  15. 516 EWD516 — Translation pending 1975–1976
  16. 518 EWD518 — Translation pending 1975–1976
  17. 520 On-the-fly garbage collection: an exercise in cooperation (with Leslie Lamport, A.J.Martin, C.S.Scholten, E.F.M.Steffens) 1975–1976
  18. 521 EWD521 — Translation pending 1975–1976
  19. 522 EWD522 — Translation pending 1975–1976
  20. 523 EWD523 — Translation pending 1975–1976
  21. 524 Review of “On the Feasibility of Software Certification” 1975–1976
  22. 525 On a warning from E.A.Hauck 1975–1976
  23. 526 Comments on “Woodenman” HOL Requirements for the DoD 1975–1976
  24. 527 On units of consistency 1975–1976
  25. 528 More on Hauck's warning 1975–1976
  26. 529 EWD529 — Translation pending 1975–1976
  27. 530 Negende toespraak, najaar 1975 1975–1976
  28. 531 EWD531 — Translation pending 1975–1976
  29. 532 An open letter to L.Bass 1975–1976
  30. 533 HOMO COGITANS 1975–1976
  31. 534 EWD534 — Translation pending 1975–1976
  32. 535 An answer to Jack Mazola 1975–1976
  33. 536 A sequel to EWD535 1975–1976
  34. 537 EWD537 — Translation pending 1975–1976
  35. 538 A collection of beautiful proofs 1975–1976
  36. 539 Mathematics Inc., a private letter from its chairman 1975–1976
  37. 540 Two views of programming 1975–1976
  38. 541 EWD541 — Translation pending 1975–1976
  39. 542 EWD542 — Translation pending 1975–1976
  40. 543 EWD543 — Translation pending 1975–1976
  41. 544 An open letter to Ross Honsberger 1975–1976
  42. 547 Tripreport E.W.Dijkstra, England and USA, 3-26 January 1976 1975–1976
  43. 548 EWD548 — Translation pending 1975–1976
  44. 549 EWD549 — Translation pending 1975–1976
  45. 550 A more formal treatment of a less simple example 1975–1976
  46. 551 EWD551 — Translation pending 1975–1976
  47. 552 EWD552 — Translation pending 1975–1976
  48. 553 On a gauntlet thrown by David Gries 1975–1976
  49. 554 A personal summary of the Gries-Owicki theory 1975–1976
  50. 555 EWD555 — Translation pending 1975–1976
  51. 556 EWD556 — Translation pending 1975–1976
  52. 557 EWD557 — Translation pending 1975–1976
  53. 558 EWD558 — Translation pending 1975–1976
  54. 559 EWD559 — Translation pending 1975–1976
  55. 560 EWD560 — Translation pending 1975–1976
  56. 561 A “non trip report” from E.W.Dijkstra 1975–1976
  57. 562 The effective arrangement of logical systems 1975–1976
  58. 563 Formal techniques and sizeable programs 1975–1976
  59. 564 A superficial book 1975–1976
  60. 564a EWD564a — Translation pending 1975–1976
  61. 565 EWD565 — Translation pending 1975–1976
  62. 566 Programming: from craft to scientific discipline 1975–1976
  63. 567 EWD567 — Translation pending 1975–1976
  64. 568 A programmer’s early memories 1975–1976
  65. 569 EWD569 — Translation pending 1975–1976
  66. 570 An exercise for Dr.R.M.Burstall 1975–1976
  67. 571 A simple consideration with far-reaching consequences (DRAFT) 1975–1976
  68. 572 Tripreport E.W.Dijkstra, U.S.A. and U.K., 8 June - 10 July 1976 1975–1976
  69. 573 A great improvement 1975–1976
  70. 574 A letter to Professor Zohar Manna, 26 July 1976 1975–1976
  71. 575 To H.D.Mills, Chairman Software Methodology Panel 1975–1976
  72. 576 On subgoal induction 1975–1976
  73. 577 Tripreport E.W.Dijkstra, ECI-conference 9–12 August 1976, Amsterdam 1975–1976
  74. 578 More about the function “fusc” (A sequel to EWD570) 1975–1976
  75. 580 EWD580 — Translation pending 1975–1976
  76. 581 A somewhat open letter to Professor John McCarthy 1975–1976
  77. 582 A proof of a theorem communicated to us by S.Ghosh (with C.S.Scholten) 1975–1976
  78. 583 EWD583 — Translation pending 1975–1976
  79. 584 Tripreport E.W.Dijkstra, Poland and USSR, 4-25 September 1976 1975–1976
  80. 585 Tripreport E.W.Dijkstra, Tokyo, 28 Sep.—3 Oct. 1976 1975–1976
  81. 586 EWD586 — Translation pending 1975–1976
  82. 587 EWD587 — Translation pending 1975–1976
  83. 588 EWD588 — Translation pending 1975–1976
  84. 589 EWD589 — Translation pending 1975–1976
  85. 590 A first investigation of the crossflow computer 1975–1976
  86. 591 The problem of the maximum length of an ascending subsequence 1975–1976
  87. 592 A small note on the additive composition of variant functions 1975–1976
  88. 593 EWD593 — Translation pending 1975–1976
  89. 594 A parable 1975–1976
  90. 595 On-the-fly garbage collection: an exercise in cooperation (with Leslie Lamport, A.J.Martin, C.S.Scholten, E.F.M.Steffens) 1975–1976
  91. 596 “On a problem from Aho, Hopcroft, and Ullman” 1975–1976
  92. 596a Tripreport E.W.Dijkstra, Copenhagen 10–12 Nov. 1976 1975–1976
  93. 597 Yet another note about termination 1975–1976
  94. 598 A bug in my book! 1975–1976
  95. 599 EWD599 — Translation pending 1975–1976

600 to 699

  1. 600 A sequel to EWD592 1976–1979
  2. 601 Tripreport E.W.Dijkstra, Munich 24–26 November 1976 1976–1979
  3. 602 Comments on Arbeitsblatt 3 from o.Prof.Dr.F.L.Bauer (with C.S.Scholten) 1976–1979
  4. 603 Tripreport E.W.Dijkstra, St.Pierre-de-Chartreuse, 12–19 Dec.1976 1976–1979
  5. 604 Paying logical conscience-money to the fair demon 1976–1979
  6. 605 Tripreport E.W.Dijkstra, Columbus - Pittsburgh - Paoli, 12–22 January 1977 1976–1979
  7. 606 EWD606 — Translation pending 1976–1979
  8. 607 A correctness proof for communicating processes: a small exercise 1976–1979
  9. 608 An elephant inspired by the Dutch National Flag 1976–1979
  10. 609 EWD609 — Translation pending 1976–1979
  11. 611 On the fact that the Atlantic Ocean has two sides 1976–1979
  12. 612 EWD612 — Translation pending 1976–1979
  13. 613 Tripreport E.W.Dijkstra, Australia, 16 February 1977 – 21 March 1977 1976–1979
  14. 614 A somewhat open letter to EAA or: why I proved the boundedness of the non-determinacy in the way I did 1976–1979
  15. 615 EWD615 — Translation pending 1976–1979
  16. 616 EWD616 — Translation pending 1976–1979
  17. 617 EWD617 — Translation pending 1976–1979
  18. 618 On Webster, users, bugs and Aristotle 1976–1979
  19. 619 Essays on the nature and role of mathematical elegance 1976–1979
  20. 620 EWD620 — Translation pending 1976–1979
  21. 621 EWD621 — Translation pending 1976–1979
  22. 622 On making solutions more and more fine-grained (In gratitude dedicated to C.A.R.Hoare, D.E.Knuth, and J.F.Traub.) 1976–1979
  23. 623 The mathematics behind the Banker's Algorithm 1976–1979
  24. 624 Stationary behaviour of some ternary networks 1976–1979
  25. 625 Two starvation-free solutions of a general exclusion problem 1976–1979
  26. 626 EWD626 — Translation pending 1976–1979
  27. 627 A position paper on Software Reliability 1976–1979
  28. 628 EWD628 — Translation pending 1976–1979
  29. 629 On two beautiful solutions designed by Martin Rem 1976–1979
  30. 630 On-the-fly garbage collection: an exercise in cooperation (with L. Lamport, A.J. Martin, C.S.Scholten, E.F.M. Steffens) 1976–1979
  31. 631 Re: “Formal derivation of strongly correct parallel programs” by Axel van Lamsweerde and M.Sintzoff 1976–1979
  32. 633 Tripreport E.W.Dijkstra, 29 July – 21 August 1977 1976–1979
  33. 634 Position paper on the impact of microprocessors (IFIP77) 1976–1979
  34. 635 Tripreport E.W.Dijkstra, Newcastle-upon-Tyne, 5–10 Sept. 1977 1976–1979
  35. 636 Why naive program transformation systems are unlikely to work 1976–1979
  36. 637 The Three Golden Rules for Successful Scientific Research 1976–1979
  37. 638 A political pamphlet from the Middle Ages 1976–1979
  38. 639 The introduction of MAES 1976–1979
  39. 640 Finding the correctness proof of a concurrent program 1976–1979
  40. 640a Finding the correctness proof of a concurrent program 1976–1979
  41. 641 On the interplay between mathematics and programming 1976–1979
  42. 642 A special sorting elephant 1976–1979
  43. 643 A class of simple communication patterns (with C.S.Scholten) 1976–1979
  44. 644 Letter to J. Arsac 1976–1979
  45. 645 Tripreport E.W.Dijkstra, USA 19–30 October 1977 1976–1979
  46. 646 A not so simple theorem about undirected graphs 1976–1979
  47. 647 EWD647 — Translation pending 1976–1979
  48. 648 “Why is software so expensive?” An explanation to the hardware designer 1976–1979
  49. 649 A supplement to EWD591 “The problem of the maximum length of an ascending subsequence” 1976–1979
  50. 650 A theorem about odd powers of odd integers 1976–1979
  51. 651 A strong P/V-implementation of conditional critical regions 1976–1979
  52. 652 A correction on EWD651 1976–1979
  53. 653 Exploiting contiguity in a linear store 1976–1979
  54. 654 In honour of Fibonacci 1976–1979
  55. 655 Essays on the nature and role of mathematical elegance (3): On notation (A sequel to EWD619) 1976–1979
  56. 656 An introduction to implementation issues 1976–1979
  57. 657 On leaves and nodes: a simplification of EWD653 1976–1979
  58. 658 On language constraints enforceable by translators (An open letter to Lt.Col. William A.Whitaker) 1976–1979
  59. 659 On the BLUE Language submitted to DoD 1976–1979
  60. 660 On the GREEN Language submitted to the DoD 1976–1979
  61. 661 On the RED Language submitted to the DoD 1976–1979
  62. 662 On the YELLOW Language submitted to the DoD 1976–1979
  63. 663 The summing-up 1976–1979
  64. 665 Trip report E.W.Dijkstra, U.K. – Bahamas – U.S.A., 11–30 April 1978 1976–1979
  65. 666 A problem solved in my head 1976–1979
  66. 667 On the foolishness of “natural language programming” 1976–1979
  67. 668 On the correctness of a design by Alain J.Martin 1976–1979
  68. 669 A book review 1976–1979
  69. 670 Sequencing and the discriminated union 1976–1979
  70. 671 Program inversion 1976–1979
  71. 672 More on A.J.Martin's design (A sequel to EWD668) 1976–1979
  72. 673 On weak and strong termination 1976–1979
  73. 674 Tripreport E.W.Dijkstra, Zürich, 2–7 July 1978 1976–1979
  74. 675 The equivalence of bounded nondeterminacy and continuity 1976–1979
  75. 676 Tripreport E.W.Dijkstra, Marktoberdorf 24 July – 6 August 1978 1976–1979
  76. 677 On one of Cayley's theorems 1976–1979
  77. 678 A story that starts with a very good computer 1976–1979
  78. 679 Tripreport E.W.Dijkstra, Newcastle-London-Lancaster, 4–13 Sep. 1978 1976–1979
  79. 680 A book review 1976–1979
  80. 682 The nature of Computer Science (first draft) 1976–1979
  81. 683 To a new member of The Tuesday Afternoon Club 1976–1979
  82. 684 Termination detection for diffusing computations (with C.S.Scholten) 1976–1979
  83. 685 The problem of the Swiss football players 1976–1979
  84. 687 Termination detection for diffusing computations (with C.S.Scholten) 1976–1979
  85. 687a Termination detection for diffusing computations (with C.S.Scholten) 1976–1979
  86. 688 A trifle 1976–1979
  87. 689 Tripreport E.W.Dijkstra, Valley Forge, 28 Oct. – 2 Nov. 1978 1976–1979
  88. 690 The pragmatic engineer versus the scientific designer 1976–1979
  89. 691 On improving the state of the art (A somewhat open letter to dr. Martin Rem) 1976–1979
  90. 692 A review of the 1977 Turing Award Lecture by John Backus 1976–1979
  91. 693 About polygons in Detroit 1976–1979
  92. 694 Tripreport E.W.Dijkstra, Detroit, Austin, Philadelphia, 25 Nov. – 9 Dec. 1978 1976–1979
  93. 695 Mathematics in an easy chair 1976–1979
  94. 696 Written in anger 1976–1979
  95. 697 Some beautiful arguments using mathematical induction 1976–1979
  96. 698 Trip report E.W.Dijkstra, Oxford University, 10–15 Jan. 1979 1976–1979
  97. 699 EWD699 — Translation pending 1976–1979

700 to 799

  1. 700 An examination exercise, designed by W.H.J.Feijen 1979–1981
  2. 701 Two theorems on (what I have called) continuously mixed sequences 1979–1981
  3. 702 In reaction to Ernest Chang’s “Deadlock Detection” 1979–1981
  4. 703 A tutorial on the split binary semaphore 1979–1981
  5. 704 A machine for image construction in tomography 1979–1981
  6. 705 EWD705 — Translation pending 1979–1981
  7. 706 Image reconstruction in two-dimensional tomography 1979–1981
  8. 707 Dear Mr.X of Company Y 1979–1981
  9. 708 When messages may crawl 1979–1981
  10. 709 My hopes of computing science 1979–1981
  11. 710 When messages may crawl, II (A sequel to EWD708) 1979–1981
  12. 711 Trip report E.W.Dijkstra, Ithaca, Albany, Austin (Texas), 26/5 – 10/6 1979 1979–1981
  13. 712 Trip report E.W.Dijkstra, Antwerp, 24–29 June 1979 1979–1981
  14. 713 On a problem posed by W.H.J.Feijen 1979–1981
  15. 714 Trip report E.W.Dijkstra, Mission Viejo, Santa Cruz, Austin, 29 July – 8 September 1979 1979–1981
  16. 715 Trip report E.W.Dijkstra, Munich – London, 16–29 September 1979 1979–1981
  17. 716 A short talk to my students about money 1979–1981
  18. 717 An exercise in exposition 1979–1981
  19. 718 Assembly conventions for the EDSAC 1979–1981
  20. 719 On not duplicating volatile information 1979–1981
  21. 720 Why correctness must be a mathematical concern 1979–1981
  22. 721 The design of a state space with a useful structure (I) 1979–1981
  23. 722 A book review for the IBM Systems Journal 1979–1981
  24. 723 On W.H.J.Feijen’s solution for the lexicographic minimum of a circular list 1979–1981
  25. 724 EWD724 — Translation pending 1979–1981
  26. 724E A chutspa 1979–1981
  27. 725 Trip report E.W.Dijkstra, Liege, Nov.–Dec.1979 1979–1981
  28. 726 How Dutch Informatics fell between two chairs 1979–1981
  29. 727 Trip report E.W.Dijkstra, U.S.A. 12 Jan. – 2 Feb. 1980 1979–1981
  30. 728 A problem solved by Netty van Gasteren and me 1979–1981
  31. 729 On well-shaped mathematical arguments 1979–1981
  32. 730 On two types of infinite sets of infinite sequences (by the Tuesday Afternoon Club) 1979–1981
  33. 731 An experiment in mathematical exposition 1979–1981
  34. 732 The teachability of mathematical thinking (Draft contribution to “Mathematics Tomorrow”) 1979–1981
  35. 733 EWD733 — Translation pending 1979–1981
  36. 734 The superfluity of the general semaphore 1979–1981
  37. 735 A mild variant of Combinatory Logic 1979–1981
  38. 736 Recording the structure of trees in their leaves 1979–1981
  39. 737 A notational alternative for quantification 1979–1981
  40. 738 More mathematical folklore 1979–1981
  41. 739 A somewhat open letter to the Editor-in-Chief of Acta Informatica 1979–1981
  42. 740 A short proof of one of Fermat’s theorems 1979–1981
  43. 741 Partitioning the edges of the complete graphs into trees or cycles (by the Tuesday Afternoon Club) 1979–1981
  44. 742 A sequel to EWD740 1979–1981
  45. 743 A new policy for Mathematics Inc.? 1979–1981
  46. 744 A short note on symmetric distributed arbitration 1979–1981
  47. 745 Trip report E.W.Dijkstra, Los Angeles, Austin (Texas), and Portland, 6–28 August 1980 1979–1981
  48. 746 Trip report E.W.Dijkstra, Newcastle-upon-Tyne, 1–5 Sep. 1980 1979–1981
  49. 747 Comments on MIL–STD–1862, 28 May 1980 1979–1981
  50. 748 A somewhat open letter to Wladislaw M.Turski 1979–1981
  51. 749 On the productivity of recursive definitions 1979–1981
  52. 750 American programming’s plight 1979–1981
  53. 751 Mainly on the omission of parentheses 1979–1981
  54. 752 Distributed Arbitration (DRAFT, with C.S.Scholten) 1979–1981
  55. 753 On a theorem by Lambek and Moser 1979–1981
  56. 754 An error in EWD744 1979–1981
  57. 755 Very elementary number theory redone 1979–1981
  58. 756 A postscript to EWD755 1979–1981
  59. 757 A misguided educational effort 1979–1981
  60. 758 An intriguing example 1979–1981
  61. 759 A somewhat open letter to D.A.Turner 1979–1981
  62. 760 A somewhat open letter to F.Kroeger 1979–1981
  63. 761 EWD761 — Translation pending 1979–1981
  64. 762 We mathematicians are losing the race 1979–1981
  65. 763 A proof by Rutger M.Dijkstra and me 1979–1981
  66. 764 Repaying our debts 1979–1981
  67. 765 A Hungarian problem 1979–1981
  68. 766 An educational stupidity 1979–1981
  69. 767 A.J.Martin’s solution of the Hungarian problem 1979–1981
  70. 768 Largely on nomenclature 1979–1981
  71. 770 D.A.Turner’s reply 1979–1981
  72. 771 About 2-coloured 6-graphs 1979–1981
  73. 772 A methodological sequel to EWD771 1979–1981
  74. 773 Trip report E.W.Dijkstra, Han-sur-Lesse, 7–12 Jan. 1981 1979–1981
  75. 774 Trip report E.W.Dijkstra, California, 17–31 January 1981 1979–1981
  76. 775 On Kleinrock’s Theorem 1979–1981
  77. 776 Lambek and Moser revisited 1979–1981
  78. 777 A word of welcome (Draft) 1979–1981
  79. 778 A somewhat open letter to Nils J.Nilsson 1979–1981
  80. 779 An assertional proof of a program by G.L.Peterson 1979–1981
  81. 780 Proving the existence of the Euler line (with A.J.M. van Gasteren) 1979–1981
  82. 781 About the presentation of programs (with A.J.M. van Gasteren) 1979–1981
  83. 782 A stupid notation 1979–1981
  84. 783 The administration as social disease 1979–1981
  85. 784 My mother’s contribution to Honsberger’s collection 1979–1981
  86. 785 Our presentation of K.A.Post’s proof of R.Stanley’s theorem (with A.J.M. van Gasteren) 1979–1981
  87. 786 Trip report E.W.Dijkstra, England, 23 April 1981 1979–1981
  88. 786a Sets are Unibags 1979–1981
  89. 787 A (new?) proof of a theorem of Euler’s on partitions 1979–1981
  90. 788 What we seem to have learned (with A.J.M. van Gasteren) 1979–1981
  91. 789 A minor improvement of Heapsort 1979–1981
  92. 789a A minor improvement of Heapsort 1979–1981
  93. 789b A minor improvement of Heapsort 1979–1981
  94. 790 Trip report E.W.Dijkstra, München, 19 May 1981 1979–1981
  95. 791 The psychology of the user 1979–1981
  96. 792 Hamming’s exercise in SASL 1979–1981
  97. 793 The analysis of a two-person game 1979–1981
  98. 794 Heapsort (with A.J.M. van Gasteren and W.H.J.Feijen) 1979–1981
  99. 795 An alternative to heapsort for sorting in situ 1979–1981
  100. 796 Smoothsort, an alternative for sorting in situ 1979–1981
  101. 796a Smoothsort, an alternative for sorting in situ 1979–1981
  102. 797 Fibonacci numbers and Leonardo numbers 1979–1981
  103. 798 Trip report E.W.Dijkstra, Newcastle, 19–25 July 1981 1979–1981
  104. 799 Trip report E.W.Dijkstra, Marktoberdorf, 26/7–10/8/81 1979–1981

800 to 899

  1. 800 A bagatelle for the left hand 1981–1984
  2. 801 Distances from the root in skew trees (with C.S.Scholten) 1981–1984
  3. 802 Trip report E.W.Dijkstra, Scotland, Newcastle 31 Aug.–15 Sep. 1981 1981–1984
  4. 803 Lecture notes on the structure of programs and proofs 1981–1984
  5. 804 On equality of propositions 1981–1984
  6. 805 Trip report E.W.Dijkstra, Amsterdam, 26–29 Oct. 1981 1981–1984
  7. 806 Trip report E.W.Dijkstra, USA, 1–27 Nov. 1981 1981–1984
  8. 807 The Fast Fourier Transform and the Perfect Shuffle 1981–1984
  9. 808 Canonical string reduction 1981–1984
  10. 809 An introductory essay on three algorithms for sorting in situ (with A.J.M. van Gasteren) 1981–1984
  11. 810 Fast image construction in computerized axial tomography (CAT) (with A.J.M. van Gasteren) 1981–1984
  12. 810a Fast image construction in computerized axial tomography (CAT) (with A.J.M. van Gasteren) 1981–1984
  13. 811 An alternative ending for AvG16/ EWD809 1981–1984
  14. 812 A personal summary of Jonkers’s program transformation 1981–1984
  15. 813 About predicate transformers in general (with C.S.Scholten) 1981–1984
  16. 814 A review of a book on PEARL 1981–1984
  17. 815 Remarks on notation (with A.J.M. van Gasteren) 1981–1984
  18. 816 Weakest preconditions, liberal and not (with C.S.Scholten) 1981–1984
  19. 817 An introduction to three algorithms for sorting in situ (with A.J.M. van Gasteren) 1981–1984
  20. 817a An introduction to three algorithms for sorting in situ (with A.J.M. van Gasteren) 1981–1984
  21. 818 A nice theorem on monotonic predicate sequences 1981–1984
  22. 819 Mathematical induction and computing science 1981–1984
  23. 820 On iteration and recursion 1981–1984
  24. 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
  25. 822 A summary of formulae (and of some theory) 1981–1984
  26. 823 A sequel to EWD822 (with C.S.Scholten) 1981–1984
  27. 824 Linearization of a two-dimensional search 1981–1984
  28. 825 About the correctness of a few SASL programs 1981–1984
  29. 826 Trip report E.W.Dijkstra, USA, 20 May 1982 – 14 June 1982 1981–1984
  30. 827 A very simple exercise in SASL 1981–1984
  31. 828 Distributed termination detection revisited 1981–1984
  32. 829 EWD829 — Translation pending 1981–1984
  33. 830 On different notions of termination (with C.S.Scholten) 1981–1984
  34. 831 Why numbering should start at zero 1981–1984
  35. 832 A theorem about infinite sequences of numbers 1981–1984
  36. 833 An In-Depth Seminar on Proven Tools & Techniques of Structured Methodology for Effective Software Configuration Management 1981–1984
  37. 834 Elementary predicates and elimination (with A.J.M. van Gasteren) 1981–1984
  38. 835 Lecture notes “Predicate transformers” (Draft) 1981–1984
  39. 836 A note on substitution and renaming 1981–1984
  40. 837 Trip report E.W.Dijkstra, Newcastle-upon Tyne, 6–10 Sep. 1982 1981–1984
  41. 838 Trip report E.W.Dijkstra, Copenhagen, 10–16 Sep. 1982 1981–1984
  42. 839 Trip report E.W.Dijkstra, Utrecht 30 Sep.–1 Oct. 1982 1981–1984
  43. 840 Derivation of a termination detection algorithm for distributed computations (with W.H.J.Feijen and A.J.M. van Gasteren) 1981–1984
  44. 841 “There is no ‘royal road’ to geometry” 1981–1984
  45. 841a [Reflections on “A note on two problems in connexion with graphs” 1981–1984
  46. 842 Two cheers for equivalence 1981–1984
  47. 843 A short sequel to EWD842 1981–1984
  48. 844 A universal quantification revisited (with C.S.Scholten) 1981–1984
  49. 845 McCarthy’s 91–function: an unfortunate paradigm 1981–1984
  50. 846 The maximum length of a segment satisfying a monotonic predicate (with A.J.M. van Gasteren) 1981–1984
  51. 847 Trip report E.W.Dijkstra, Australia, 19 Jan.1983 – 12 Feb.1983 1981–1984
  52. 849 Junctivity of extreme solutions (with C.S.Scholten) 1981–1984
  53. 849a Junctivity of extreme solutions (with C.S.Scholten) 1981–1984
  54. 850 Trip report E.W.Dijkstra, Helsinki, 1–4 March 1983 1981–1984
  55. 851 Reducing control traffic in a distributed implementation of mutual exclusion 1981–1984
  56. 851a Reducing control traffic in a distributed implementation of mutual exclusion 1981–1984
  57. 851b Reducing control traffic in a distributed implementation of mutual exclusion 1981–1984
  58. 852 Judging “HOS” from a distance 1981–1984
  59. 852a Judging “HOS” from a distance 1981–1984
  60. 853 A correction of EWD851b 1981–1984
  61. 853a Ingenieur Ebergen, Weledelgetrenge Heer 1981–1984
  62. 854 The fruits of misunderstanding 1981–1984
  63. 855 Trip report E.W.Dijkstra, Barcelona 5–7 June 1983 1981–1984
  64. 856 On maximizing a product 1981–1984
  65. 857 Generalizing an old formula 1981–1984
  66. 858 Trip report E.W.Dijkstra, USA, 10 June–3 July 1983 1981–1984
  67. 859 Semantics of recursive procedures (with C.S.Scholten) 1981–1984
  68. 860 A sequel to EWD859 (with C.S.Scholten) 1981–1984
  69. 861 Research proposal: Our plans for the years to come (with A.J.M. van Gasteren) 1981–1984
  70. 861a | x [ n ]| = x [ n –1] + x [ n +1] has period 9 1981–1984
  71. 862 A sequence with | x [ n ]| = x [ n –1] + x [ n +1] has period 9 1981–1984
  72. 863 Predicate calculus revisited 1981–1984
  73. 864 The distributed snapshot of Chandy/Lamport/Misra 1981–1984
  74. 864a The Distributed Snapshot of K.M.Chandy and L. Lamport 1981–1984
  75. 865 Trip report E.W.Dijkstra, Brasil & USA, 17 Oct.– 6 Nov. 1983 1981–1984
  76. 866 An analytical proof of the Butterfly Theorem 1981–1984
  77. 867 On IPW’s 1981–1984
  78. 868 Computers and General Education: a position paper 1981–1984
  79. 869 EWD869 — Translation pending 1981–1984
  80. 870 My mother’s proof of the Butterfly Theorem (see EWD866) 1981–1984
  81. 871m Invariance and nondeterminacy 1981–1984
  82. 871t Invariance and nondeterminacy 1981–1984
  83. 872 The little essay I could not write 1981–1984
  84. 873 Trip report E.W.Dijkstra, London and Colchester, 16–20 Jan. 1984 1981–1984
  85. 874 A miscellany of results (with C.S.Scholten) 1981–1984
  86. 875 Monotonicity and quantification 1981–1984
  87. 876 EWD876 — Translation pending 1981–1984
  88. 877 Some useful formulae (with A.J.M. van Gasteren) 1981–1984
  89. 878 A monotonicity argument (with A.J.M. van Gasteren) 1981–1984
  90. 879 Trip report E.W.Dijkstra, London, 14–17 February 1984 1981–1984
  91. 880 Why the importance of continuity seems to be overrated (with A.J.M. van Gasteren) 1981–1984
  92. 880a Why the importance of continuity seems to be overrated (with A.J.M. van Gasteren) 1981–1984
  93. 880b The termination theorem for unconstrained nondeterminacy (with A.J.M. van Gasteren) 1981–1984
  94. 881 A review of “The Evolution of Programs” 1981–1984
  95. 882 The regularity calculus: a first trial 1981–1984
  96. 883 The operational interpretation of extreme solutions (with C.S. Scholten) 1981–1984
  97. 884 A sequel to EWD874 (with C.S. Scholten) 1981–1984
  98. 885 Trip report E.W.Dijkstra, Muenchen, 12–14 April 1984 1981–1984
  99. 886 A simple fix-point argument without the restriction to continuity (with A.J.M. van Gasteren) 1981–1984
  100. 886a A simple fix-point argument without the restriction to continuity (with A.J.M. van Gasteren) 1981–1984
  101. 887 Trip report E.W.Dijkstra, USA, 23 April –10 May 1984 1981–1984
  102. 888 Trip report E.W.Dijkstra, Zürich, 22–24 May 1984 1981–1984
  103. 889 User-friendly Mathematics 1981–1984
  104. 891 Well-founded sets revisited 1981–1984
  105. 892 Trip report E.W.Dijkstra, London, 12–14 June 1984 1981–1984
  106. 893 Trip report E.W.Dijkstra, USA, 17–26 June 1984 1981–1984
  107. 894 On partitioning predicates 1981–1984
  108. 895 Trip report E.W.Dijkstra, Marktoberdorf, 30 July – 12 Aug. 1984 1981–1984
  109. 896 On the nature of computing science 1981–1984
  110. 897 A formal program derivation for the record 1981–1984
  111. 898 The threats to computing science 1981–1984
  112. 899 A review of a paper in AI 1981–1984

900 to 999

  1. 900 Minsegsumtwodim 1984–1987
  2. 900a Minsegsumtwodim 1984–1987
  3. 901 A simple fix-point argument without the restriction to continuity (with A.J.M. van Gasteren) 1984–1987
  4. 901a A simple fix-point argument without the restriction to continuity (with A.J.M. van Gasteren) 1984–1987
  5. 902 The regularity calculus: a second trial 1984–1987
  6. 903 A short sequel to EWD863 1984–1987
  7. 904 A problem solved by my nephew Sybrand L. Dijkstra 1984–1987
  8. 905 Mainly on our use of the predicate calculus (Draft Ch.2) 1984–1987
  9. 906 Trip report E.W.Dijkstra, Nuenen & London, 10 Dec.’84 – 10 Jan.’85 1984–1987
  10. 907 Trip report E.W.Dijkstra, Netherlands, Austria, 23–31 Jan. 1985 1984–1987
  11. 908 Predicate transformers (Draft Ch.3) 1984–1987
  12. 909 Trip report E.W.Dijkstra, Westboro-Boston, 14–17 Feb. 1985 1984–1987
  13. 910 Semantics of straight-line programs (Draft Chap.4) 1984–1987
  14. 911 Trip report E.W.Dijkstra, Tulsa, 1–6 March 1985 1984–1987
  15. 912 Extreme solutions of equations (Draft Ch.5) 1984–1987
  16. 913 On a cultural gap (Draft) 1984–1987
  17. 914 The repetition (Draft Ch.6) 1984–1987
  18. 915 A sequel to EWD912, i.e. to Draft Ch.5 1984–1987
  19. 916 An improvement on EWD912 1984–1987
  20. 917 Another misguided effort 1984–1987
  21. 918 A summary of a year’s impressions 1984–1987
  22. 920 Can computing science save the computer industry? 1984–1987
  23. 921 A correction of EWD914–15 1984–1987
  24. 922 A belated proof of self-stabilization 1984–1987
  25. 923 Trip report E.W.Dijkstra, Ithaca, Newport, 30 May – 13 June 1985 1984–1987
  26. 923a Where is Russell’s “Paradox”? 1984–1987
  27. 924 On a cultural gap 1984–1987
  28. 925 Trip report E.W.Dijkstra, London, 25–27 June 1985 1984–1987
  29. 926 A computer to think about 1984–1987
  30. 927 The ATAC ( = Austin Tuesday Afternoon Club) 1984–1987
  31. 928 On structures 1984–1987
  32. 929 A generalization of the functions head and tail (unfinished) 1984–1987
  33. 930 For the record: the Linear Search 1984–1987
  34. 931 Concerning the equivalence 1984–1987
  35. 932 Some simple theorems on incremental sorting 1984–1987
  36. 932a The streamlining of the mathematical argument 1984–1987
  37. 932b Some simple lemmata on incremental sorting 1984–1987
  38. 932c The streamlining of the mathematical argument 1984–1987
  39. 933 On a problem posed by M.R.Khalil (for the record) 1984–1987
  40. 934 The Saddleback Search 1984–1987
  41. 935 For the record: Batcher’s Baffler 1984–1987
  42. 935a For the record: Batcher’s Baffler 1984–1987
  43. 936 On anthropomorphism in science 1984–1987
  44. 937 Correction and extension of EWD932b 1984–1987
  45. 938 To an anonymous referee of AvG45/EWD901 1984–1987
  46. 939 Incremental sorting once more 1984–1987
  47. 940 What I missed in Batcher’s Baffler (EWD935a–0) 1984–1987
  48. 941 Rotating a linear array 1984–1987
  49. 942 The longest plateau and other stories 1984–1987
  50. 943 The problem of the Longest Ribbon 1984–1987
  51. 944 The operation “trickle” 1984–1987
  52. 945 A simple theorem? 1984–1987
  53. 946 The proof of the pudding 1984–1987
  54. 947 A letter to a typewriter manufacturer 1984–1987
  55. 948 Misra’s proof of Lamport’s mutual exclusion 1984–1987
  56. 949 On substitution, replacement, and the notion of a function 1984–1987
  57. 950 On notation (with A.J.M. van Gasteren) 1984–1987
  58. 950a On notation (with A.J.M. van Gasteren) 1984–1987
  59. 951 Trip report E.W.Dijkstra, Europe, 13.12.1985 – 10.1.1986 1984–1987
  60. 952 Science fiction and science reality in computing 1984–1987
  61. 953 A heuristic explanation of Batcher’s Baffler 1984–1987
  62. 953a A heuristic explanation of Batcher’s Baffler 1984–1987
  63. 954 Idempotence and reflexivity; associativity and transitivity; distribution and monotonicity 1984–1987
  64. 954a On binary operators and their derived relations 1984–1987
  65. 955 Partitioning predicates and substitution; diabolical and angelical nondeterminism 1984–1987
  66. 956 Address to my students 1984–1987
  67. 957 Partitioning predicates and punctual functions (see EWD955) 1984–1987
  68. 958 On naming (with A.J.M. van Gasteren) 1984–1987
  69. 959 A short note on universal quantification 1984–1987
  70. 960 On a proof I learned from prof. dr. J. Haantjes 1984–1987
  71. 961 On the “quadrangular” inequalities 1984–1987
  72. 962 Introducing a course on mathematical methodology 1984–1987
  73. 963 Visuals for BP’s Venture Research Conference 1984–1987
  74. 964 Node degree and the size of disconnected subgraphs 1984–1987
  75. 965 Ptolemaeus and Brahmagupta (or: Baffled by Symmetry) 1984–1987
  76. 966 Management and Mathematics 1984–1987
  77. 967 On finite models for the equivalence (with C.S.Scholten) 1984–1987
  78. 968 Trip report E.W.Dijkstra, Marktoberdorf, 29 July – 10 Aug l986 1984–1987
  79. 969 Extreme solutions of equations 1984–1987
  80. 970 F.L. Bauer’s Conjecture is F.L. Bauer’s Theorem 1984–1987
  81. 972 (E y :: (A x :: p . x . y )) ⇒ (A x :: (E y :: p . x . y )) 1984–1987
  82. 973 The cosine rule 1984–1987
  83. 974 The longer side is opposite to the greater angle 1984–1987
  84. 975 On the theorem of Pythagoras 1984–1987
  85. 976 Who is your “target audience”? 1984–1987
  86. 977 An address to my students (16.9.1986) 1984–1987
  87. 978 A sequel to EWD977 (18.9.1986) 1984–1987
  88. 979 A solution designed by A. Blokhuis 1984–1987
  89. 980 The strange case of The Pigeon-hole Principle 1984–1987
  90. 981 Address to my students (23.9.1986) 1984–1987
  91. 982 Relational Calculus according to ATAC 1984–1987
  92. 983 How do we contribute? (30.9.1986) 1984–1987
  93. 984 The study of a notion, viz. that of residue classes 1984–1987
  94. 985 A supplement to EWD878 1984–1987
  95. 986 Suppose they differ! 1984–1987
  96. 987 On a class of graphs with modest diameter 1984–1987
  97. 987a On a class of graphs with modest diameter 1984–1987
  98. 988 On the phenomenon of scientific disciplines 1984–1987
  99. 988a How experimental is computing science? 1984–1987
  100. 989 Proving Gupta’s Theorem 1984–1987
  101. 990 A theorem of Charles Babbage’s extended 1984–1987
  102. 991 Why Johnny can’t understand 1984–1987
  103. 992 Difficult is easy 1984–1987
  104. 993 The nature of my research and why I do it 1984–1987
  105. 994 J. Misra’s comment on EWD964 1984–1987
  106. 995 On W.H.J.Feijen’s string equation 1984–1987
  107. 996 Courtesy A.J.M. van Gasteren, C.S.Scholten and J.G.Wiltink 1984–1987
  108. 997 Computing Science in the United Kingdom 1984–1987
  109. 998 Shmuel Safra’s version of termination detection 1984–1987
  110. 999 Our proof format 1984–1987

1000 to 1099

  1. 1000 Twenty-eight years 1987–1991
  2. 1001 The calculus of boolean structures (Part 0) 1987–1991
  3. 1002 The calculus of boolean structures (Part 1) 1987–1991
  4. 1003 Graphs of modest diameter and degrees 1987–1991
  5. 1004 A methodological remark on mathematical induction 1987–1991
  6. 1005 A supplement to EWD1002 1987–1991
  7. 1006 Trip report E.W.Dijkstra, Stanford/Palo Alto, 26–29 March l987 1987–1991
  8. 1007 Addendum to EWD969 1987–1991
  9. 1008 What computing science is about 1987–1991
  10. 1009 On a somewhat disappointing correspondence 1987–1991
  11. 1010 A much neglected mathematical object 1987–1991
  12. 1011 Introducing my fall 1987 course on Mathematical Methodology 1987–1991
  13. 1012 “Real mathematicians don’t prove” 1987–1991
  14. 1013 Position paper on “fairness” 1987–1991
  15. 1014 A monotonicity argument revisited 1987–1991
  16. 1015 On a problem transmitted by Doug McIlroy 1987–1991
  17. 1016 A computing scientist’s approach to a once-deep theorem of Sylvester’s 1987–1991
  18. 1017 Fillers at a YoP-institute 1987–1991
  19. 1018 To the members of the Budget Council 1987–1991
  20. 1019 Another filler of the YoP Institute 1987–1991
  21. 1020 The derivation of a proof by J.C.S.P. van der Woude 1987–1991
  22. 1021 A symmetry in the sorting task 1987–1991
  23. 1022 A bagatelle on implication’s transitivity 1987–1991
  24. 1023 On triangles being nondegenerate 1987–1991
  25. 1024 A new science, from birth to maturity 1987–1991
  26. 1025 Ulrich Berger’s solution to the rectangle problem 1987–1991
  27. 1026 Trip report E.W.Dijkstra, Marktoberdorf 1988 1987–1991
  28. 1027 My methodological blunder with grid polygons 1987–1991
  29. 1028 Euclid, Netty, and the prime numbers 1987–1991
  30. 1029 The linear search revisited (with W.H.J.Feijen) 1987–1991
  31. 1031 Ascending functions and The Welfare Crook 1987–1991
  32. 1032 Decomposing an integer as sum of two squares 1987–1991
  33. 1033 Trip report E.W.Dijkstra, Zürich, 15–20 Oct. 1988 1987–1991
  34. 1034 Equivalence versus mutual implication; junctivity and monotonicity 1987–1991
  35. 1035 On long-range planning for the CS department 1987–1991
  36. 1036 On the cruelty of really teaching computing science 1987–1991
  37. 1037 Exploring the lexical coupling 1987–1991
  38. 1038 A bagatelle on total orders 1987–1991
  39. 1039 Seemingly on a problem transmitted by Bengt Jonsson 1987–1991
  40. 1040 The majority vote according to J. Gutknecht 1987–1991
  41. 1041 By way of introduction 1987–1991
  42. 1041a Factorizing the factorial 1987–1991
  43. 1042 Once more the bichrome 3 x 7 grid (See EWD764) 1987–1991
  44. 1043 A few comments on “Computing as a discipline” 1987–1991
  45. 1044 To hell with “meaningful identifiers”! 1987–1991
  46. 1045 The problem of the difficult dartboard 1987–1991
  47. 1046 A tale of two winters 1987–1991
  48. 1047 A relational summary 1987–1991
  49. 1048 ATAC’s proof of Scholten’s theorem 1987–1991
  50. 1049 A somewhat open letter to Uri Leron 1987–1991
  51. 1050 On the design of a simple proof for Morley’s Theorem 1987–1991
  52. 1051 The next forty years 1987–1991
  53. 1052 From the Hungarian Eotvos Competition, 1911 1987–1991
  54. 1053 Monochrome pairs in the three-coloured plane 1987–1991
  55. 1054 On hygiene, intellectual and otherwise 1987–1991
  56. 1055 On the problem of the calissons 1987–1991
  57. 1055A untitled (advice to a young scientist) 1987–1991
  58. 1055c On covering a figure with diamonds 1987–1991
  59. 1056 EWD1056 — Translation pending 1987–1991
  60. 1057 Andrei P. Ershov in Nuenen 1987–1991
  61. 1058 In reply to comments 1987–1991
  62. 1059 0 Preface (Mathematical Methodology) 1987–1991
  63. 1060 “Predicate Calculus and Program Semantics”, fall 1989 1987–1991
  64. 1061 Composition, lambda-calculus, and some more 1987–1991
  65. 1062 On an exercise of Tony Hoare’s 1987–1991
  66. 1063 An introductory example (Mathematical Methodology) 1987–1991
  67. 1064 On the selection of dummies: a notational freedom 1987–1991
  68. 1065 An example of how to lengthen formal proofs 1987–1991
  69. 1066 Hungry? Have a byte .... 1987–1991
  70. 1067 A very first introductory example (Mathematical Methodology) 1987–1991
  71. 1068 On the quality criteria for mathematical writing (Mathematical Methodology) 1987–1991
  72. 1069 Fair gambling with a biased coin 1987–1991
  73. 1070 For brevity’s sake (Mathematical Methodology) 1987–1991
  74. 1071 Making a fair roulette from a possibly biased coin 1987–1991
  75. 1071a Making a fair roulette from a possibly biased coin 1987–1991
  76. 1072 On covering a figure with diamonds 1987–1991
  77. 1073 How Computing Science created a new mathematical style 1987–1991
  78. 1074 A generalization of R.S. Bird’s problem 1987–1991
  79. 1075 Constructing the proof of Vizing’s Theorem (with J.R. Rao) 1987–1991
  80. 1076 From “Discrete Mathematics with Applications” by Susanna S. Epp 1987–1991
  81. 1077 Fibonacci and the greatest common divisor 1987–1991
  82. 1078 Leibniz’s Principle (Mathematical Methodology) 1987–1991
  83. 1079 Well-foundedness and the transitive closure (with A.J.M. van Gasteren) 1987–1991
  84. 1080 Well-foundedness and lexical coupling (with A.J.M. van Gasteren) 1987–1991
  85. 1081 Mathematical induction and universal quantification 1987–1991
  86. 1082 Designing the proof of Vizing’s Theorem (with J.R. Rao) 1987–1991
  87. 1082a Designing the proof of Vizing’s Theorem (with J.R. Rao) 1987–1991
  88. 1083 The balance and the coins 1987–1991
  89. 1084 A logician’s anomaly or: Leibniz vindicated 1987–1991
  90. 1085 Proving the theorem of Menelaos 1987–1991
  91. 1086 The everywhere operator once more 1987–1991
  92. 1087 A conversion routine revisited 1987–1991
  93. 1088 A theorem communicated by Ken Calvert 1987–1991
  94. 1089 An Oxford sequel to EWD1047 1987–1991
  95. 1090 The design of a proof of equality (Mathematical Methodology) 1987–1991
  96. 1091 More equality proofs with instantiated definitions (Mathematical Methodology) 1987–1991
  97. 1092 Two ways of determining an expectation value 1987–1991
  98. 1093 Proving the equality of infinite sequences 1987–1991
  99. 1094 The undeserved status of the pigeon-hole principle (Mathematical Methodology) 1987–1991
  100. 1095 Are “systems people” really necessary? 1987–1991
  101. 1096 Potter’s proof of disjunction’s symmetry 1987–1991
  102. 1097 The majority vote among three 1987–1991
  103. 1098 Guided by necessity 1987–1991
  104. 1099 Inspired by Peter Auer’s proof 1987–1991

1100 to 1199

  1. 1100 The computing habit 1991–1995
  2. 1101 Triangles in graphs: a sharp bound 1991–1995
  3. 1102 Why preorders are beautiful 1991–1995
  4. 1103 For the record: ETAC and the couples 1991–1995
  5. 1104 So much for scientific visualization 1991–1995
  6. 1105 For Bill Walker a sequel to EWD1099 1991–1995
  7. 1106 Courtesy Apt, ETAC, Hoogerwoord, & Voermans 1991–1995
  8. 1107 On extreme solutions 1991–1995
  9. 1108 Too much PSST in Texas 1991–1995
  10. 1109 Simplifying a proof in our book 1991–1995
  11. 1110 To the members of the budget council (Confidential) 1991–1995
  12. 1111 Triggered by Higman’s Lemma 1991–1995
  13. 1112 Why “up to equivalence” 1991–1995
  14. 1113 A somewhat open letter to Ben Kuipers 1991–1995
  15. 1114 Well-foundedness and the relational calculus 1991–1995
  16. 1115 A manuscript for the Coahuila student chapter of the ACM 1991–1995
  17. 1116 More pointless relational calculus: the transitive closure 1991–1995
  18. 1117 Monotonic demonstranda and dummy introduction 1991–1995
  19. 1118 On a formula designed by Henk Doornbos 1991–1995
  20. 1119 A correction of EWD1112 1991–1995
  21. 1120 Manipulating mathematical macros 1991–1995
  22. 1121 Covering rectangles with bars of length 3 1991–1995
  23. 1122 Interleaving is associative 1991–1995
  24. 1123 The unification of three calculi 1991–1995
  25. 1124 On a proof of Kaplansky’s Theorem 1991–1995
  26. 1125 A summary for Turner’s class (An extract from EWD1107) 1991–1995
  27. 1126 Who failed? 1991–1995
  28. 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
  29. 1128 Mathematical induction synthesized 1991–1995
  30. 1129 Why “heavy-weight” bits are unavoidable 1991–1995
  31. 1130 On the economy of doing mathematics 1991–1995
  32. 1131 Bulterman’s theorem on shortest tree 1991–1995
  33. 1132 Introducing a course on the design and use of calculi 1991–1995
  34. 1133 A theorem of Scholten’s once more (see EWD1048) 1991–1995
  35. 1134 The checkers problem told to me by M.O. Rabin 1991–1995
  36. 1135 The knight’s tour 1991–1995
  37. 1136 A comparison of relational proofs 1991–1995
  38. 1137 Computing the future? 1991–1995
  39. 1138 Total-order junctivity 1991–1995
  40. 1139 A relational bagatelle 1991–1995
  41. 1140 The arithmetic mean and the geometric mean 1991–1995
  42. 1141 Notational considerations and the relational calculus 1991–1995
  43. 1142 It is all distributivity 1991–1995
  44. 1143 Some annotated proofs 1991–1995
  45. 1144 More annotated proofs (a sequel to 1143) 1991–1995
  46. 1145 A somewhat open letter to Cathleen Synge Morawetz 1991–1995
  47. 1146 The transitivity of the implication 1991–1995
  48. 1147 More on monotonic predicate transformers and the introduction of dummies (see EWD1117) 1991–1995
  49. 1148 A more disentangled characterization of extreme solutions 1991–1995
  50. 1149 Perry Moerland’s proof of Carel Scholten’s theorem 1991–1995
  51. 1150 On the design of calculational proofs 1991–1995
  52. 1151 A terrible Thursday 1991–1995
  53. 1152 EWD1152 — Translation pending 1991–1995
  54. 1153 On bags and identical twins 1991–1995
  55. 1154 A derivation of a proof by D. Zagier 1991–1995
  56. 1155 A prime is in at most 1 way the sum of 2 squares 1991–1995
  57. 1155a A prime is in at most 1 way the sum of 2 squares 1991–1995
  58. 1156 EWD1156 — Translation pending 1991–1995
  59. 1157 Introducing a course on program design and presentation 1991–1995
  60. 1158 A bagatelle on Euclid’s Algorithm 1991–1995
  61. 1159 A note on “tail invariants” 1991–1995
  62. 1160 How subtypes should enter the picture 1991–1995
  63. 1161 How promiscuous are the French ? 1991–1995
  64. 1162 A detailed derivation of a very simple program 1991–1995
  65. 1163 Transitivity as an (unexpected?) consequence 1991–1995
  66. 1164 A tentative axiomatization of ascending sequences 1991–1995
  67. 1165 There is still a war going on 1991–1995
  68. 1166 “From my Life” 1991–1995
  69. 1167 A regrettable cover 1991–1995
  70. 1168 On two equations that have the same extreme solution 1991–1995
  71. 1169 An alternative of the ETAC to EWD1163 1991–1995
  72. 1170 Equilateral triangles and rectangular grids 1991–1995
  73. 1171 The argument about the arithmetic mean and the geometric mean, heuristics included 1991–1995
  74. 1172 Pythagorean triples, or the design of a theorem 1991–1995
  75. 1173 A theorem proved by John Segers 1991–1995
  76. 1174 The heuristics of a proof by Jan L.A. van de Snepscheut and Richard S. Bird 1991–1995
  77. 1174a Heuristics for a calculational proof 1991–1995
  78. 1175 The strengths of the academic enterprise 1991–1995
  79. 1176 A chutzpah 1991–1995
  80. 1177 In Memoriam Jan L.A. van de Snepscheut 1991–1995
  81. 1178 On an argument by J.A. Carruth & J. Misra 1991–1995
  82. 1179 A sorry parade 1991–1995
  83. 1180 Heuristics for a very simple Euclidean proof 1991–1995
  84. 1181 Don’t mix unary pre- and postfix operators 1991–1995
  85. 1182 Counting characters 1991–1995
  86. 1183 “Less than” in terms of “at most” 1991–1995
  87. 1184 Our book’s omission on quantification over scalar subtypes 1991–1995
  88. 1185 Lifting, orders, and the Galois connection 1991–1995
  89. 1186 Ping-pong arguments and Leibniz’s principle 1991–1995
  90. 1187 Boolean connectives yield punctual expressions 1991–1995
  91. 1188 A problem from Zhendong Patrick Su (including an alternative solution by R.Boute 1991–1995
  92. 1189 Another ping-pong argument from Leibniz’s principle 1991–1995
  93. 1190 Problem 10406 from The American Mathematical Monthly, Volume 101, Number 8 / October 1994 1991–1995
  94. 1191 Junctivity and massaging quantification 1991–1995
  95. 1192 The very first beginnings of lattice theory 1991–1995
  96. 1193 On arcs and angles 1991–1995
  97. 1194 Z.P. Su’s second problem 1991–1995
  98. 1195 Another forced ping-pong argument? 1991–1995
  99. 1196 Generators of extreme values 1991–1995
  100. 1197 A termination argument 1991–1995
  101. 1198 Jan van de Snepscheut’s tiling problem 1991–1995
  102. 1199 A supplement to EWD1140 and EWD1171 1991–1995

1200 to 1299

  1. 1200 Only a matter of style? 1995–2000
  2. 1201 Triggered by Wim Feijen’s treatment of “Exists Forall ⇒ Forall Exists” 1995–2000
  3. 1202 The complete ( n + 1)-graph in n -dimensional space 1995–2000
  4. 1203 Primes once more (re Kac & Ulam) 1995–2000
  5. 1204 Complete DAGs 1995–2000
  6. 1205 A trip to Harvard Law School, 10–11 April 1995 1995–2000
  7. 1206 An unfortunate use of symbols 1995–2000
  8. 1207 A theorem about “factors” perhaps worth recording 1995–2000
  9. 1208 A result of rabbit removal 1995–2000
  10. 1209 Why American Computing Science seems incurable 1995–2000
  11. 1210 The non-unique node multiplicity 1995–2000
  12. 1211a On some very binary patterns (dedicated to F.E.J. Kruseman Aretz) 1995–2000
  13. 1212 For the record: painting the squared plane 1995–2000
  14. 1213 Introducing a course on calculi 1995–2000
  15. 1214 The marriage agency 1995–2000
  16. 1215 Courtesy Dr. Birgit Schieder 1995–2000
  17. 1216 The equation x : [ x ] 1995–2000
  18. 1217 Comments on a Review of the Department 1995–2000
  19. 1218 A few addenda to EWD1192 1995–2000
  20. 1219 “I have a proof that ....” 1995–2000
  21. 1220 Honors course “Mathematical Methodology”, Spring 1996 1995–2000
  22. 1221a Points in the plane (unfinished) 1995–2000
  23. 1221b Calculational proof design; an experiment 1995–2000
  24. 1222 Inspired by ~[ x ] equiv [~ x ] 1995–2000
  25. 1223 WLOG, or the misery of the unordered pair 1995–2000
  26. 1224 Hm++, a new Professional Standard (From the desk of the chairman of the Board of Mathematics Inc.) 1995–2000
  27. 1225 Misra’s weakest fair buffer 1995–2000
  28. 1226 A simple geometrical theorem I did not know 1995–2000
  29. 1227 A somewhat open letter to David Gries 1995–2000
  30. 1228 Sylvester’s theorem used (see EWD1016) 1995–2000
  31. 1229 Nondeterministic construction of an arbitrary witness 1995–2000
  32. 1230 Three very little problems from Eindhoven 1995–2000
  33. 1231 The arithmetic and geometric means once more 1995–2000
  34. 1232 My simplest theorem 1995–2000
  35. 1233 A hint from monotonicity? 1995–2000
  36. 1234 A problem communicated by Laurens de Vries 1995–2000
  37. 1235 A step over the mark 1995–2000
  38. 1236 The wife-swapping couples once more (See EWD1103 and EWD1115) 1995–2000
  39. 1237 Elegance and effective reasoning (Fall 1996) 1995–2000
  40. 1238 Foreword 1995–2000
  41. 1239 A first exploration of effective reasoning 1995–2000
  42. 1240 A little bit of lattice theory 1995–2000
  43. 1240a A little bit of lattice theory 1995–2000
  44. 1241 The transitive closure of a wellfounded relation 1995–2000
  45. 1243 The next fifty years 1995–2000
  46. 1243a The next fifty years 1995–2000
  47. 1244 The formula for sin(alpha + beta) 1995–2000
  48. 1244a The formula for sin.(alpha + beta) 1995–2000
  49. 1245 A kind of converse of Leibniz’s Principle 1995–2000
  50. 1246 Courtesy Rajeev Joshi 1995–2000
  51. 1247 Beware of the empty range 1995–2000
  52. 1248 Homework #1 (See EWD996) 1995–2000
  53. 1249 Andrew’s challenge once more (see EWD1247) 1995–2000
  54. 1250 The couples, the river, and the little boat 1995–2000
  55. 1251 Two problems derived from Hugo Steinhaus 1995–2000
  56. 1252 Convocation speech, December 8, 1996 1995–2000
  57. 1253 Mathematical induction’s fixpoint 1995–2000
  58. 1254 A sequel to EWD1241 and WF 233/AvG 141 1995–2000
  59. 1255 Pruning the search tree 1995–2000
  60. 1256 Mathematical Methodology, Spring 1997 1995–2000
  61. 1257 Defining the greatest common divisor 1995–2000
  62. 1258 The ladder theorem 1995–2000
  63. 1258a The ladder theorem 1995–2000
  64. 1260 The marked coins and the scale 1995–2000
  65. 1261 The angle bisectors of a triangle 1995–2000
  66. 1263 A correction to EWD1240 1995–2000
  67. 1265 The theorem of de Ceva once more 1995–2000
  68. 1266a Proving an implication via its converse 1995–2000
  69. 1267 On the determinant of the product of two square matrices 1995–2000
  70. 1268 The Mathematical Divide 1995–2000
  71. 1269 A simple proof of Hall’s Theorem 1995–2000
  72. 1270 How closures could have been invented 1995–2000
  73. 1271 N cheers for determinants ( N >>0) 1995–2000
  74. 1272 A Geometry Problem from “The Monthly”, March 1998 1995–2000
  75. 1273 On Dijkstra’s Lemma and Kruskal’s Algorithm 1995–2000
  76. 1274 For the record: Yossi Shiloach’s Algorithm 1995–2000
  77. 1276 The algebraic core of a propositional logic (with Rutger M. Dijkstra) 1995–2000
  78. 1277 Society’s role in mathematics 1995–2000
  79. 1278 A calculational example 1995–2000
  80. 1279 A simple country dance for transitivity and shunting 1995–2000
  81. 1280 A tough experiment with the triangle calculus 1995–2000
  82. 1280a A formula is worth a thousand pictures (dedicated to Charles Antony Richard Hoare) 1995–2000
  83. 1281 An iteration for the k -th root with cubic convergence 1995–2000
  84. 1282 On graphs whose nodes are Black or White 1995–2000
  85. 1283 How “they” try to corrupt “us” 1995–2000
  86. 1284 Computing Science: Achievements and Challenges 1995–2000
  87. 1285 To Cambridge by mistake (13–18 April 1999) 1995–2000
  88. 1286 A partition theorem of Euler’s generalized 1995–2000
  89. 1287 Dear Tony, dearest Jill, and other people, dear or not 1995–2000
  90. 1288 Ulrich Berger’s argument rephrased 1995–2000
  91. 1289 A 2–colouring problem in the rational plane 1995–2000
  92. 1290 Eliminating cascading carries 1995–2000
  93. 1291 Courtesy Georg Cantor and Jayadev Misra 1995–2000
  94. 1292 When a symmetric operator distributes over (up) and (down) 1995–2000
  95. 1293 Constructing the Binary Search once more 1995–2000
  96. 1294a Designing a calculational proof of Cantor’s theorem 1995–2000
  97. 1295 On the transitive closure of a wellfounded relation 1995–2000
  98. 1296 On weighted means, geometric and arithmetic 1995–2000
  99. 1296a On weighted means, geometric and arithmetic 1995–2000
  100. 1297 Triggered by a high-school exercise 1995–2000
  101. 1298 Under the spell of Leibniz’s Dream 1995–2000
  102. 1299 On defining sets, suprema, and infima 1995–2000

1300 to 1399

  1. 1300 The notational conventions I adopted, and why 2000–2002
  2. 1301 The river, the isles and the bridges 2000–2002
  3. 1302 Once more bichrome triangles in complete graphs 2000–2002
  4. 1303 My recollections of operating system design 2000–2002
  5. 1304 The end of computing science? 2000–2002
  6. 1305 Answers to questions from students of Software Engineering 2000–2002
  7. 1306 The chessboard covered with dominoes 2000–2002
  8. 1306a The chessboard covered with dominoes 2000–2002
  9. 1307 An unavoidable case analysis 2000–2002
  10. 1308 What led to “Notes on Structured Programming” 2000–2002
  11. 1309a Zuckerman’s problem and the ETAC 2000–2002
  12. 1310 Three trip reports rolled into one: 2001.04.16 – 2001.07.06 2000–2002
  13. 1311 Another look at a problem from Hugo Steinhaus 2000–2002
  14. 1312 On disjoint binary numbers 2000–2002
  15. 1313 The GCD and the minimum 2000–2002
  16. 1315 Indirect equality enriched (and a proof by Netty) 2000–2002
  17. 1316 Philips and I: a few snapshots 2000–2002
  18. 1317 From van IJzeren’s correspondence to my aunt & uncle 2000–2002
  19. 1318 Coxeter’s rabbit 2000–2002