David Bindel

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Osni Marques

> Home > Persons > David Bindel

Publications

2007
[r1]
- view
  authority control:
- export record
  dblp key:
  - reference/crc/HidaDLKGBTLLMVLRDKPB07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/reference/crc/HidaDLKGBTLLMVLRDKPB07
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
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/para/DemmelDPKGBHLMRVLLKBLT06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/para/DemmelDPKGBHLMRVLLKBLT06
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
2002
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/toms/BindelDKM02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/toms/BindelDKM02
David Bindel, James Demmel, William Kahan, Osni Marques:
On computing givens rotations reliably and efficiently. ACM Trans. Math. Softw. 28(2): 206-238 (2002)

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.