default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilliam Kahan
Person information
- award (1989): Turing Award
- award (2000): IEEE Emanuel R. Piore Award
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[c9]Cindy Rubio-González, Cuong Nguyen, Benjamin Mehne, Koushik Sen, James Demmel, William Kahan, Costin Iancu, Wim Lavrijsen, David H. Bailey, David Hough:
Floating-point precision tuning using blame analysis. ICSE 2016: 1074-1085- 2013
- [c8]Cindy Rubio-González, Cuong Nguyen, Hong Diep Nguyen, James Demmel, William Kahan, Koushik Sen, David H. Bailey, Costin Iancu, David Hough:
Precimonious: tuning assistant for floating-point precision. SC 2013: 27:1-27:12 - 2012
- [j17]Ren-Cang Li
, William Kahan:
A family of Anadromic numerical methods for matrix Riccati differential equations. Math. Comput. 81(277): 233-265 (2012) - [c7]Juris Hartmanis, Stephen Cook, William Kahan, Richard Edwin Stearns, Andrew C. Yao:
The Turing Computational Model. ACM-TURING 2012: 8:1
2000 – 2009
- 2007
- [p1]Gene H. Golub, William Kahan:
Calculating the singular values and pseudo-inverse of a matrix. Milestones in Matrix Computation 2007: 236- - [r1]Yozo Hida, James Demmel, Julien Langou, Jakub Kurzak, Ming Gu, Alfredo Buttari, Stanimire Tomov, Piotr Luszczek, Julie Langou, Osni Marques, Christof Vömel, Xiaoye S. Li, E. Jason Riedy, Jack J. Dongarra, William Kahan, Beresford N. Parlett, David Bindel:
Prospectus for a Dense Linear Algebra Software Library. Handbook of Parallel Computing 2007 - 2006
- [j16]James Demmel, Yozo Hida, William Kahan, Xiaoye S. Li, Sonil Mukherjee, E. Jason Riedy:
Error bounds from extra-precise iterative refinement. ACM Trans. Math. Softw. 32(2): 325-351 (2006) - [c6]James Demmel, Jack J. Dongarra, Beresford N. Parlett, William Kahan, Ming Gu, David Bindel, Yozo Hida, Xiaoye S. Li, Osni Marques, E. Jason Riedy, Christof Vömel, Julien Langou, Piotr Luszczek, Jakub Kurzak, Alfredo Buttari, Julie Langou, Stanimire Tomov:
Prospectus for the Next LAPACK and ScaLAPACK Libraries. PARA 2006: 11-23 - 2005
- [j15]William Kahan, Dan Zuras:
An Open Question to Developers of Numerical Software. Computer 38(5): 91-94 (2005) - 2002
- [j14]Xiaoye S. Li, James Demmel, David H. Bailey, Greg Henry, Yozo Hida, Jimmy Iskandar, William Kahan, Suh Y. Kang, Anil Kapur, Michael C. Martin, Brandon Thompson, Teresa Tung, Daniel J. Yoo:
Design, implementation and testing of extended and mixed precision BLAS. ACM Trans. Math. Softw. 28(2): 152-205 (2002) - [j13]David Bindel, James Demmel, William Kahan, Osni Marques:
On computing givens rotations reliably and efficiently. ACM Trans. Math. Softw. 28(2): 206-238 (2002)
1990 – 1999
- 1999
- [j12]William Kahan, Richard J. Fateman:
Symbolic computation of divided differences. SIGSAM Bull. 33(2): 7-28 (1999) - 1998
- [j11]William Kahan:
IEEE 754 - Interview. Computer 31(3): 114-115 (1998) - 1997
- [j10]William Kahan, Ren-Cang Li:
Composition constants for raising the orders of unconventional schemes for ordinary differential equations. Math. Comput. 66(219): 1089-1099 (1997) - 1992
- [j9]William Kahan:
Analysis and refutation of the LCAS. ACM SIGPLAN Notices 27(1): 61-74 (1992) - 1990
- [j8]James Demmel, William Kahan:
Accurate Singular Values of Bidiagonal Matrices. SIAM J. Sci. Comput. 11(5): 873-912 (1990)
1980 – 1989
- 1985
- [c5]William Kahan, E. LeBlanc:
Anomalies in the IBM ACRITH package. IEEE Symposium on Computer Arithmetic 1985: 322-331 - 1984
- [j7]William J. Cody, Jerome T. Coonen, David M. Gay, Kenton Hanson, David Hough, William Kahan, Richard Karpinski, John Palmer, Frederic N. Ris, David K. Stevenson:
A Proposed Radix- and Word-length-independent Standard for Floating-point Arithmetic. IEEE Micro 4(4): 86-100 (1984)
1970 – 1979
- 1975
- [j6]William Kahan:
Problem #9: an ellipse problem. SIGSAM Bull. 9(3): 11-12 (1975) - 1974
- [c4]William Kahan:
When are pivotal interchanges not necessary? ACM Annual Conference (2) 1974: 745 - 1972
- [c3]Donald G. M. Anderson, William Kahan, Joseph F. Traub:
George Forsythe memorial lecture (Panel Session). ACM Annual Conference (2) 1972: 663 - 1971
- [c2]William Kahan:
A Survey of Error Analysis. IFIP Congress (2) 1971: 1214-1239
1960 – 1969
- 1968
- [c1]Beresford N. Parlett, William Kahan:
On the convergence of a practical QR algorithm. IFIP Congress (1) 1968: 114-118 - 1965
- [j5]William Kahan:
Pracniques: further remarks on reducing truncation errors. Commun. ACM 8(1): 40 (1965) - 1964
- [j4]William Kahan, J. J. Leppik:
A fortran post-mortem procedure. Commun. ACM 7(1): 15 (1964) - 1963
- [j3]William Kahan, I. Farkas:
Algorithm 167: calculation of confluent divided differences. Commun. ACM 6(4): 164-165 (1963) - [j2]William Kahan, I. Farkas:
Algorithm 169: Newton interpolation with forward divided differences. Commun. ACM 6(4): 165 (1963) - [j1]William Kahan, I. Farkas:
Algorithm 168: Newton interpolation with backward divided differences. Commun. ACM 6(4): 165 (1963)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
