Ahmed H. Sameh

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 Sy-Shin Lo

> Home > Persons > Ahmed H. Sameh

Publications

1989
[j15]
- view
  authority control:
- export record
  dblp key:
  - journals/ijhpca/BerryCKKLPPRSCCSFMWHSLOSJGM89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijhpca/BerryCKKLPPRSCCSFMWHSLOSJGM89
Michael W. Berry, Da-Ren Chen, Peter F. Koss, David J. Kuck, Sy-Shin Lo, Yingxin Pang, Lynn Pointer, Richard Roloff, Ahmed H. Sameh, Enrico Clementi, Shaoan Chin, David J. Schneider, Geoffrey C. Fox, Paul Messina, David W. Walker, Chris Hsiung, Jim Schwarzmeier, Kok-Meng Lue, Steve Orszag, Fred Seidl, Olin G. Johnson, Richard Goodrum, Joanne Martin:
The Perfect Club Benchmarks: Effective Performance Evaluation of Supercomputers. Int. J. High Perform. Comput. Appl. 3(3): 5-40 (1989)
1986
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/conpar/BerryGHJLMPS86
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/conpar/BerryGHJLMPS86
Michael W. Berry, Kyle A. Gallivan, William J. Harrod, William Jalby, Sy-Shin Lo, Ulrike Meier, Bernard Philippe, Ahmed H. Sameh:
Parallel Algorithms on the CEDAR System. CONPAR 1986: 25-39
1985
[c7]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/ppsc/LoPS85
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ppsc/LoPS85
Sy-Shin Lo, Bernard Philippe, Ahmed H. Sameh:
A multiprocessor algorithm for the symmetric tridiagonal eigenvalue problem. PP 1985: 155-165

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.