12xx
- 1200: Only a matter of style?
- 1202: The complete (n + 1)-graph in n-dimensional space
- 1203: Primes once more (re Kac & Ulam)
- 1204: Complete DAGs
- 1205: A trip to Harvard Law School, 10–11 April 1995
- 1206: An unfortunate use of symbols
- 1207: A theorem about “factors” perhaps worth recording
- 1209: Why American Computing Science seems incurable
- 1210: The non-unique node multiplicity
- 1211a: On some very binary patterns (dedicated to F.E.J. Kruseman Aretz)
- 1212: For the record: painting the squared plane
- 1213: Introducing a course on calculi
- 1214: The marriage agency
- 1215: Courtesy Dr. Birgit Schieder
- 1216: The equation x: [x]
- 1217: Comments on a Review of the Department
- 1219: “I have a proof that ....”
- 1220: Honors course “Mathematical Methodology”, Spring 1996
- 1224: Hm++, a new Professional Standard (From the desk of the chairman of the Board of Mathematics Inc.)
- 1226: A simple geometrical theorem I did not know
- 1227: A somewhat open letter to David Gries
- 1228: Sylvester’s theorem used (see EWD1016)
- 1229: Nondeterministic construction of an arbitrary witness
- 1231: The arithmetic and geometric means once more
- 1232: My simplest theorem
- 1235: Een scheve schaats
- 1237: Elegance and effective reasoning (Fall 1996)
- 1238: Foreword
- 1239: A first exploration of effective reasoning
- 1243: The next fifty years
- 1243a: The next fifty years
- 1245: A kind of converse of Leibniz’s Principle
- 1248: Homework #1 (See EWD996)
- 1250: The couples, the river, and the little boat
- 1251: Two problems derived from Hugo Steinhaus
- 1252: Convocation speech, December 8, 1996
- 1253: Mathematical induction’s fixpoint
- 1255: Pruning the search tree
- 1256: Mathematical Methodology, Spring 1997
- 1258a: The ladder theorem
- 1260: The marked coins and the scale
- 1261: The angle bisectors of a triangle
- 1268: The Mathematical Divide
- 1273: On Dijkstra’s Lemma and Kruskal’s Algorithm
- 1277: Society’s role in mathematics
- 1282: On graphs whose nodes are Black or White
- 1283: How “they” try to corrupt “us”
- 1284: Computing Science: Achievements and Challenges
- 1285: To Cambridge by mistake (13–18 April 1999)
- 1287: Dear Tony, dearest Jill, and other people, dear or not
- 1288: Ulrich Berger’s argument rephrased
- 1290: Eliminating cascading carries
- 1292: When a symmetric operator distributes over (up) and (down)
- 1297: Triggered by a high-school exercise
- 1298: Under the spell of Leibniz’s Dream