Book chapters or sections

• J. Demmel, J. Dongarra, B. N. Parlett, W. M. Kahan, M. Gu, D. Bindel, Y. Hida, X. Li, O. Marques, E. J. Riedy, C. Vomel, J. Langou, P. Luszczek, J. Kurzak, A. Buttari, J. Langou, and S. Tomov, "Prospectus for the next LAPACK and ScaLAPACK libraries," in Applied Parallel Computing: State of the Art in Scientific Computing. Proc. 8th Intl. Workshop (PARA 2006). Revised Selected Papers, B. Kagstrom, E. Elmroth, J. Dongarra, and J. Wasniewski, Eds., Lecture Notes in Computer Science, Vol. 4699, Berlin, Germany: Springer-Verlag, 2007, pp. 11-23.
• J. Demmel, J. Dongarra, and W. M. Kahan, "On designing portable high performance numerical libraries," in Numerical Analysis 1991: Proc. 14th Dundee Conf. on Numerical Analysis, D. F. Griffiths and G. A. Watson, Eds., Pitman Research Notes in Mathematics, Essex, UK: Longman Scientific & Technical, 1992, pp. 69-84.
• W. M. Kahan, "Branch cuts for complex elementary functions, or much ado about nothing's sign bit," in The State of the Art in Numerical Analysis: Proc. 3rd Joint IMA/SIAM Conf., A. Iserles and M. J. D. Powell, Eds., Institute of Mathematics and Its Applications Conference Series, Vol. 9, Oxford, England, UK: Oxford University Press, 1987, pp. 165-211.
• W. M. Kahan and J. T. Coonen, "The near orthogonality of syntax, semantics, and diagnostics in numerical programming environments," in The Relationship Between Numerical Computation and Programming Languages, J. K. Reid, Ed., Amsterdam, The Netherlands: North-Holland/Elsevier Publishing Company, 1982, pp. 103-113.
• W. M. Kahan and B. N. Parlett, "How far should you go with the Lanczos process?," in Sparse Matrix Computations: Proc. Symp. on Sparse Matrix Computations, J. R. Bunch and D. J. Rose, Eds., New York, NY: Academic Press, 1976, pp. 131-144.

Articles in journals or magazines

• W. M. Kahan, "Is there a small skew Cayley transform with zero diagonal?," Linear Algebra and Its Applications, vol. 417, no. 2-3, pp. 335-341, Sep. 2006.
• J. Demmel, Y. Hida, W. M. Kahan, X. S. Li, S. Mukherjee, and E. J. Riedy, "Error bounds from extra-precise iterative refinement," ACM Trans. Mathematical Software, vol. 32, no. 2, pp. 325-351, June 2006.
• W. M. Kahan and D. Zuras, "An open question to developers of numerical software," Computer, vol. 38, no. 5, pp. 91-94, May 2005.
• X. S. Li, J. Demmel, D. H. Bailey, G. Henry, Y. Hida, J. Iskandar, W. M. Kahan, S. Y. Kang, A. Kapur, M. C. Martin, B. J. Thompson, T. Tung, and D. J. Yoo, "Design, implementation and testing of Extended and Mixed Precision BLAS," ACM Trans. Mathematical Software, vol. 28, no. 2, pp. 152-205, June 2002.
• D. Bindel, J. Demmel, W. M. Kahan, and O. Marques, "On computing Givens rotations reliably and efficiently," ACM Trans. Mathematical Software, vol. 28, no. 2, pp. 206-238, June 2002.
• R. Bhatia, W. M. Kahan, and R. Li, "Pinchings and norms of scaled triangular matrices," Linear and Multilinear Algebra, vol. 50, no. 1, pp. 15-21, March 2002.
• W. M. Kahan and R. J. Fateman, "Symbolic computation of divided differences," ACM SIGSAM Bulletin, vol. 33, no. 2, pp. 7-28, June 1999.
• C. Severance and W. M. Kahan, "IEEE 754: An Interview with William Kahan," IEEE Computer, vol. 31, no. 3, pp. 114-115, March 1998.
• W. M. Kahan and R. Li, "Unconventional schemes for a class of ordinary differential equations - With applications to the Korteweg-de Vries Equation," J. Computational Physics, vol. 134, no. 2, pp. 316-331, July 1997.
• W. M. Kahan and R. Li, "Composition constants for raising the orders of unconventional schemes for ordinary differential equations," Mathematics of Computation, vol. 66, no. 219, pp. 1089-1099, July 1997.
• B. L. Farrell, W. M. Kahan, J. W. Reightler, and A. C. Woodward, "Improving service efficiency in manufacturing integrated circuits," AT&T Technical J., vol. 71, no. 4, pp. 37-44, July 1992.
• W. M. Kahan, "Analysis and refutation of the LCAS," ACM SIGPLAN Notices, vol. 27, no. 1, pp. 61-74, Jan. 1992.
• W. M. Kahan, "Analysis and refutation of the LCAS," ACM SIGNUM Newsletter, vol. 26, no. 3, pp. 2-15, July 1991.
• J. Demmel and W. M. Kahan, "Accurate singular values of bidiagonal matrices," SIAM Journal on Scientific and Statistical Computing, vol. 11, no. 5, pp. 873-912, Sep. 1990.
• W. J. Cody, J. T. Coonen, D. M. Gay, K. Hanson, D. Hough, W. M. Kahan, R. Karpinski, J. Palmer, F. N. Ris, and D. Stevenson, "A proposed radix- and word-length-independent standard for floating-point arithmetic," ACM SIGNUM Newsletter, vol. 20, no. 1, pp. 86-100, Jan. 1985.
• W. J. Cody, J. T. Coonen, D. M. Gay, K. Hanson, D. Hough, W. M. Kahan, R. Karpinski, J. Palmer, F. N. Ris, and D. Stevenson, "A proposed radix- and word-length-independent standard for floating-point arithmetic," IEEE Micro, vol. 4, no. 4, pp. 86-100, Aug. 1984.
• W. M. Kahan, B. N. Parlett, and E. Jiang, "Residual bounds on approximate eigensystems of nonnormal matrices," SIAM J. Numerical Analysis, vol. 19, no. 3, pp. 470-484, June 1982.
• C. Davis, W. M. Kahan, and H. F. Weinberger, "Norm-preserving dilations and their applications to optimal error bounds," SIAM J. Numerical Analysis, vol. 19, no. 3, pp. 445-469, June 1982.
• W. M. Kahan, "The programming environment's contribution to program robustness," ACM SIGNUM Newsletter, vol. 16, no. 4, pp. 10-15, Oct. 1981.
• W. M. Kahan, "Handheld calculator evaluates integrals," Hewlett-Packard J., vol. 31, no. 8, pp. 23-32, Aug. 1980.
• W. M. Kahan, "Personal calculator has key to solve any equation f(x)=0," Hewlett-Packard J., vol. 30, no. 12, pp. 20-26, Dec. 1979.
• W. M. Kahan and J. Palmer, "On a proposed floating-point standard," ACM SIGNUM Newsletter: Special Issue, vol. 14, no. 2, pp. 13-21, Oct. 1979.
• J. Coonen, W. M. Kahan, J. Palmer, T. Pittman, and D. Stevenson, "A proposed standard for binary floating point arithmetic: Draft 5.11," ACM SIGNUM Newletter: Special Issue, vol. 14, no. 2, pp. 4-12, Oct. 1979.
• W. M. Kahan and B. N. Parlett, "How reliable is your calculator?," Funkschau, vol. 51, no. 1, pp. 29-32, Jan. 1979.
• W. M. Kahan and B. N. Parlett, "Are there errors in pocket calculators? II.," Funkschau, vol. 51, no. 2, pp. 87-90, Jan. 1979.
• W. M. Kahan, "Problem #9: An ellipse problem," ACM SIGSAM Bulletin, vol. 9, no. 3, pp. 11-11, Aug. 1975.
• W. M. Kahan, "Spectra of nearly Hermitian matrices," Proc. American Mathematical Society, vol. 48, no. 1, pp. 11-17, March 1975.
• W. M. Kahan, "Every n × n matrix Z with real spectrum satisfies |Z - Z*| less than or equal to |Z + Z*| (log sub 2 n + 0.038)," Proc. American Mathematical Society, vol. 39, no. 2, pp. 235-241, July 1973.
• W. M. Kahan, "In memoriam: Hirondo Kuki (4/25/1925-12/28/1971)," ACM SIGNUM Newsletter, vol. 7, no. 1, pp. 8-10, April 1972.
• W. M. Kahan, "A problem," ACM SIGNUM Newsletter, vol. 6, no. 3, pp. 6-6, Nov. 1971.
• C. Davis and W. M. Kahan, "The rotation of eigenvectors by a perturbation. III.," SIAM J. Numerical Analysis, vol. 7, no. 1, pp. 1-46, March 1970.
• C. Davis and W. M. Kahan, "Some new bounds on perturbation of subspaces," Bulletin of the American Mathematical Society, vol. 75, no. 4, pp. 863-868, 1969.
• W. M. Kahan, "Circumscribing an ellipsoid about the intersection of two ellipsoids," Canadian Mathematical Bulletin, vol. 11, no. 3, pp. 437-441, 1968.
• W. M. Kahan, "Four aphorisms concerning floating point hardware design," ACM SIGNUM Newsletter, vol. 3, no. 2, pp. Art. 2, July 1968.
• W. M. Kahan, "Laguerre's method and a circle which contains at least one zero of a polynomial," SIAM J. Numerical Analysis, vol. 4, no. 3, pp. 474-482, Sep. 1967.
• W. M. Kahan, "Numerical linear algebra," Canadian Mathematical Bulletin, vol. 9, pp. 757-801, 1966.
• W. M. Kahan, "7094 II system support for numerical analysis," SHARE Secretary Distribution, vol. 159, no. C4537, pp. 1-54, Dec. 1966.
• W. M. Kahan, "A computable error-bound for systems of ordinary differential equations (Abstract)," Siam Review, vol. 8, no. 4, pp. 568-569, Oct. 1966.
• G. Golub and W. M. Kahan, "Calculating the singular values and pseudo inverse of a matrix," SIAM J. Numerical Analysis: Series B--Numerical Analysis, vol. 2, no. 2, pp. 205-224, 1965.
• W. M. Kahan, "Pracniques: Further remarks on reducing trunction errors," Communications of the ACM, vol. 8, no. 1, pp. 40-40, Jan. 1965.
• W. M. Kahan and J. J. Leppik, "A FORTRAN post-mortem procedure," Communications of the ACM, vol. 7, no. 1, pp. 15-15, Jan. 1964.
• W. M. Kahan and I. Farkas, "Algorithm 169: Newton interpolation with forward divided differences," Communications of the ACM, vol. 6, no. 4, pp. 165-165, April 1963.
• W. M. Kahan and I. Farkas, "Algorithm 167: Calculation of confluent divided differences," Communications of the ACM, vol. 6, no. 4, pp. 164-165, April 1963.
• W. M. Kahan and I. Farkas, "Algorithm 168: Newton interpolation with backward divided differences," Communications of the ACM, vol. 6, no. 4, pp. 165-165, April 1963.

Articles in conference proceedings

• W. M. Kahan, "How futile are mindless assessments of roundoff in floating-point computations: Why should we care? What should we do? (Extract)," in Proc. Householder Symposium XVI on Numerical Linear Algebra, 2005, pp. 17 pg.
• W. M. Kahan and J. D. Darcy, "How Java's floating-point hurts everyone everywhere (Invited Talk)," in Proc. ACM 1998 Workshop on Java for High-Performance Network Computing, New York, NY: The Association for Computing Machinery, Inc., 1998, pp. 81 pg.
• W. M. Kahan, "How Cray's arithmetic hurts scientific computation (and what might be done about it)," in Proc. 1990 Cray User Group Spring Meeting, Philomath, OR: Cray User Group, Inc., 1990, pp. 42 pg.
• W. M. Kahan and E. LeBlanc, "Anomalies in the IBM ACRITH package," in Proc. 7th Symp. on Computer Arithmetic, K. Hwang, Ed., Silver Spring, MD: IEEE Computer Society, 1985, pp. 322-331.
• W. M. Kahan, "The proposed IEEE Standard P754 for floating-point arithmetic: What good is it?," in Mini/Micro West: 1983 Computer Conf. and Exhibition, 1983.
• W. M. Kahan, "Mathematics written in sand," in Proc. Joint Statistical Meeting of the American Statistical Association, Alexandria, VA: American Statistical Association, 1983, pp. 12-26.
• W. M. Kahan, "A binary floating point arithmetic standard for new computers," in Proc. 20th IEEE Computer Society Intl. Conf. (COMPCON Spring '80), Silver Spring, MD: IEEE Computer Society, 1980, pp. 477-477.
• W. M. Kahan, J. Coonan, and J. Palmer, "A proposed IEEE-CS standard for binary floating point arithmetic," in Proc. Computer Science and Statistics 12th Annual Symp. on the Interface, J. F. Gentleman, Ed., Waterloo, Ontario, Canada: The University of Waterloo, 1979, pp. 32-36.
• W. M. Kahan, "A survey of error analysis (Invited Paper)," in Proc. 7th IFIP Congress 1971, C. V. Freiman, J. E. Griffith, and J. L. Rosenfeld, Eds., Vol. 2, Amsterdam, The Netherlands: North-Holland Publishing Co., 1972, pp. 1214-1239.
• W. M. Kahan, "Invited Commentary on "Error Bounds and Computer Arithmetic" by K. Nickel," in Proc. 4th IFIP Congress 1968, A. J. H. Morrell, Ed., Amsterdam, The Netherlands: North-Holland Publishing C., 1968, pp. 60-62.
• B. N. Parlett and W. M. Kahan, "On the convergence of a practical QR algorithm," in Proc. 4th IFIP Congress 1968, A. J. H. Morrell, Ed., Vol. 1, Amsterdam, The Netherlands: North-Holland Publishing Co., 1968, pp. 114-118.

Technical Reports

• J. W. Demmel, Y. Hida, W. Kahan, X. S. Li, S. Mukherjee, and E. J. Riedy, "Error Bounds from Extra Precise Iterative Refinement," EECS Department, University of California, Berkeley, Tech. Rep. UCB/CSD-04-1344, March 2005.
• D. Bindel, J. Demmel, W. M. Kahan, and O. Marques, "On Computing Givens Rotations Reliably and Efficiently," University of Tennessee, Knoxville, Computer Science Department, Tech. Rep. UTK/CS-00-449, Oct. 2000.
• X. S. Li, J. Demmel, D. H. Bailey, G. Henry, Y. Hida, J. Iskandar, W. M. Kahan, S. Y. Karg, A. Kapur, M. C. Martin, B. J. Thompson, T. Tung, and D. J. Yoo, "Design, Implementation and Testing of Extended and Mixed Precision BLAS," Lawrence Berkeley National Laboratory, Tech. Rep. LBNL-00-45991, June 2000.
• W. M. Kahan and J. W. Thomas, "Augmenting a Programming Language with Complex Arithmetic," University of California, Berkeley, Department of EECS, Computer Science Division, Tech. Rep. UCB/CSD-92-667, Dec. 1991.
• W. Kahan and J. W. Thomas, "Augmenting a Programming Language with Complex Arithmetic," EECS Department, University of California, Berkeley, Tech. Rep. UCB/CSD-92-667, Dec. 1991.
• J. Demmel, J. Dongarra, and W. M. Kahan, "LAPACK Working Note 39: On Designing Portable High Performance Numerical Libraries," University of Tennessee, Knoxville, Department of Computer Science, Tech. Rep. UTK/CS-91-141, Aug. 1991.
• E. Anderson, C. Bischof, J. Demmel, J. Dongarra, J. DuCroz, S. Hammarling, and W. M. Kahan, "LAPACK Working Note 26: Prospectus for an Extension to LAPACK: A Portable Linear Algebra Library for High-Performance Computers," University of Tennessee, Knoxville, Department of Computer Science, Tech. Rep. UTK/CS-90-118, Nov. 1990.
• J. Demmel and W. M. Kahan, "LAPACK Working Note 3: Computing Small singular Values of Bidiagonal Matrices with Guaranteed High Relative Accuracy," Argonne National Laboratory, Argonne, IL, Tech. Rep. ANL/MCS-TM-110, Feb. 1988.
• W. M. Kahan, "To Solve a Real Cubic Equation," University of California, Berkeley, Department of Mathematics, Center for Pure and Applied Mathematics, Tech. Rep. UCB/CPAM-86-352, Nov. 1986.
• W. M. Kahan, "Rational Arithmetic in Floating-Point," University of California, Department of Mathematics, Center for Pure and Applied Mathematics, Tech. Rep. UCB/CPAM-343, Sep. 1986.
• R. J. Fateman and W. M. Kahan, "Improving Exact Integrals from Symbolic Algebra," University of California, Berkeley, Department of Mathematics, Center for Pure and Applied Mathematics, Tech. Rep. UCB/CPAM-86-386, Aug. 1986.
• W. M. Kahan, "Branch Cuts for Complex Elementary Functions," University of California, Berkeley, Department of Mathematics, Center for Pure and Applied Mathematics, Tech. Rep. UCB/CPAM-82-105, Oct. 1982.
• W. Kahan, "No Period Two Implies Convergence, OR Why Use Tangents When Secants Will Do?," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M79/61, Oct. 1979.
• W. Kahan and B. Parlett, "How Far Should You Go with the Lanczos Process?," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M78/48, July 1978.
• W. M. Kahan and B. N. Parlett, "How Far Should You Go with the Lanczos Process?," University of California, Berkeley, Electronics Research Lab, Tech. Rep. UCB/ERL M-78-48, July 1978.
• W. Kahan, "And Now for Something Completely Different: The Texas Instruments SR-52," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M77/23, April 1977.
• W. Kahan and B. Parlett, "Can You Count on Your Calculator," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M77/21, April 1977.
• W. M. Kahan, "And Now For Something Completely Different: The Texas Instruments SR-52," University of California, Berkeley, Electronics Research Lab, Tech. Rep. UCB/ERL-77-23, April 1977.
• W. M. Kahan and B. N. Parlett, "Can You Count on Your Calculator?," University of California, Berkeley, Electronics Research Lab, Tech. Rep. UCB/ERL M-77-21, April 1977.
• W. Kahan and B. Parlett, "An Analysis of Lanczos Algorithms for Symmetric Matrices," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M467, Sep. 1974.
• W. M. Kahan and B. N. Parlett, "An Analysis of Lanczos Algorithms for Symmetric Matrices," University of California, Electronics Research Laboratory, Tech. Rep. UCB/ERL M-74-467, Sep. 1974.
• W. Kahan, "Spectra of Nearly Hermitian Matrices," EECS Department, University of California, Berkeley, Tech. Rep. UCB/ERL M420, Jan. 1974.
• W. M. Kahan, "Implementation of Algorithms. Part I.," University of California, Berkeley, Computer Science Division, Tech. Rep. UCB/CSD-73-20, 1973.
• W. M. Kahan, "Conserving Confluence Curbs Ill-Condition," University of California at Berkeley, Computer Science Division, Tech. Rep. UCB/CSD-72-6, Aug. 1972.
• W. M. Kahan, "Inclusion Theorems for Clusters of Eigenvalues of Hermitian Matrices," University of Toronto, Computer Science Department, 1967.
• W. M. Kahan, "Relaxation Methods for Semi-Definite Systems," Stanford University, Computer Science Department, Tech. Rep. CS-TR-66-45, Aug. 1966.
• W. M. Kahan, "Relaxation Methods for an Eigenproblem," Stanford University, Computer Science Department, Tech. Rep. CS-TR-66-44, Aug. 1966.
• W. M. Kahan and J. M. Varah, "Two Working Algorithms for the Eigenvalues of a Symmetric Tridiagonal Matrix," Stanford University, Computer Science Department, Tech. Rep. CS-TR-66-43, Aug. 1966.
• W. M. Kahan, "When to Neglect Off-Diagonal Elements of Symmetric Tri-Diagonal Matrices," Stanford University, Computer Science Department, Tech. Rep. CS-TR-66-42, July 1966.
• W. M. Kahan, "Accurate Eigenvalues of a Symmetric Tri-Diagonal Matrix," Stanford University, Computer Science Department, Tech. Rep. CS-TR-66-41, July 1966.

Unpublished articles

• W. M. Kahan, "Why Is Floating-Point Computation So Hard to Debug When It Goes Wrong?," March 2007.
• W. M. Kahan, "Circumscribing an Ellipsoid about the Intersection of Two Ellipsoids (Article Update)," Aug. 2006.
• W. M. Kahan, "How Futile Are Mindless Assessments of Roundoff in Floating-Point Computation? (Work in Progress)," Jan. 2006.
• W. M. Kahan, "Approximate Trisection of an Angle," Aug. 2005.
• W. M. Kahan, "A Demonstration of Presubstitution for Infinity/Infinity," July 2005.
• W. M. Kahan, "A Brief Tutorial on Gradual Underflow (Work in Progress)," July 2005.
• W. M. Kahan, "On the Cost of Floating-Point Computation Without Extra-Precise Arithmetic," Nov. 2004.
• W. M. Kahan, "A Logarithm Too Clever by Half," Aug. 2004.
• W. M. Kahan, "Matlab's Loss Is Nobody's Gain (Revised)," July 2004.
• W. M. Kahan, "Simple Transistorized Ignition Retrofits to Old Cars," April 2004.
• W. M. Kahan, "About Infinity, for Schoolteachers," March 2002.
• W. M. Kahan, "Marketing versus Mathematics and Other Ruminations on the Design of Floating-Point Arithmetic," Aug. 2000.
• W. M. Kahan, "Miscalculating Area and Angles of a Needle-Like Triangle," March 2000.
• W. M. Kahan, "The Improbability of Probabilistic Error Analysis for Numerical Computations (Revised)," June 1998.
• W. M. Kahan, "Lecture Notes on the Status of IEEE Standard 754 for Binary Floating-Point Arithemtic (Work in Progress)," Oct. 1997.
• W. M. Kahan and M. Y. Ivory, "Roundoff Degrades an Idealized Cantilever," July 1997.
• W. M. Kahan, "A Test for SRT Division (Work in Progress)," March 1995.
• W. M. Kahan, "Checking Whether Floating-Pooint Division Is Correctly Rounded," April 1987.
• W. M. Kahan, "On the Monotonicity of Some Computed Functions (Work in Progress)," March 1985.
• W. M. Kahan, "Why Do We Need a Floating-Point Arithmetic Standard?," Feb. 1981.
• W. M. Kahan, "Almost-Commuting Matrices Are Near Commuting Matrices," July 1970.
• W. M. Kahan, "A More Complete Interval Arithmetic: Lecture Notes for an Engineering Summer Course in Numerical Analysis," June 1968.

Software

• W. M. Kahan, "DAYDATE: Computing days between dates, the day of the week, etc.," 1992.

Talks or presentations

• W. M. Kahan, "How to Refine an Approximate Eigensystem," presented at Matrix Computations & Scientific Computing Seminar, 380 Soda Hall, Nov. 2007.
• J. Demmel, W. M. Kahan, and B. N. Parlett, "Forsythe, Golub, and the Future of Matrix Computations," presented at Matrix Computations & Scientific Computing Seminar, 380 Soda Hall, March 2007.
• W. M. Kahan, "Why Can I Debug Some Numerical Programs That You Can't: Why Should We Care? What Should We Do?," presented at The State and Future Directions of Computational Mathematics and Numerical Computing, Stanford University, March 2007.
• W. M. Kahan, "Circumscribing Uncertainty by Ellipsoids," presented at Matrix Computations & Scientific Computing Seminar, 380 Soda, Oct. 2006.
• W. M. Kahan, "Your Unbuggable Numerical Program," presented at CPAM Lunchtime Lecture Series, Faculty Club, April 2006.
• W. M. Kahan, "Cayley Transforms among the Unitary, Orthogonal, and Skew Matrices," presented at Matrix Computations & Scientific Computing Seminar, Sep. 2005.
• W. M. Kahan, "Keynote Address: Floating-Point Arithmetic Besieged by "Business Decisions"," presented at 2005 IEEE Symp. on Computer Arithmetic (ARITH-17), Cape Cod, MA, June 2005.
• W. M. Kahan, "The Baleful Influence of SPEC Benchmarks upon Floating-Point Arithmetic," presented at SPEC Meeting, May 2005.
• W. M. Kahan, "A Counter-Example to the Aphorism of J. M. Keynes "What Is Not Worth Doing Is Not Worth Doing Well"," presented at Matrix Computations & Scientific Computing Seminar, 380 Soda Hall, May 2004.
• W. M. Kahan, "The Numerical Analyst as Computing Curmudgeon," presented at EECS Department Research Fair, Berkeley, CA, Sep. 2002.
• W. M. Kahan, "What Has the Volume of a Tetrahedron To Do With Computer Programming Languages?," presented at SCCM Seminar Series, Stanford University, April 2001.
• W. M. Kahan, "How Blabber-Mouth U-Boats Got Sunk in World War II," Berkeley, CA, March 2001.
• W. M. Kahan, "The baleful effect of computer languages and benchmarks upon applied mathematics, physics and chemistry," presented at SIAM 45th Anniversay and Annual Meeting, Stanford University, Palo Alto, CA, July 1997.
• W. M. Kahan, "Paradoxes in Concepts of Accuracy," presented at Distinguished Lecture Series, Pittsburgh, PA, Feb. 1990.
• W. M. Kahan, "First Annual George Forsythe Memorial Lecture: How to Help an Ill-Defined Problem Get Well," presented at ACM Annual Conference, Boston, MA, Aug. 1972.

Ph.D. Theses

• W. M. Kahan, "Gauss-Seidel Methods of Solving Large Systems of Linear Equations," University of Toronto, 1958.

Masters Reports

• W. M. Kahan, "A Survey of Methods of Solving Poisson's Equation Suitable for Electronic Computers," University of Toronto, 1955.