Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Robert E. Lord

dblp:143/8587 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1983
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
High-performance computing · 60% Parallel and multicore computing · 40%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › parallel algorithms › parallel algorithm design
MIMD algorithms
0.011983
Solving Linear Algebraic Equations on an MIMD Computer · J. ACM 1983
High-performance computing › numerical linear algebra
parallel linear algebra
0.011983
Solving Linear Algebraic Equations on an MIMD Computer · J. ACM 1983
High-performance computing › numerical linear algebra › linear solver
parallel linear solvers
0.011983
Solving Linear Algebraic Equations on an MIMD Computer · J. ACM 1983
High-performance computing
parallel numerical algorithms
0.011983
Solving Linear Algebraic Equations on an MIMD Computer · J. ACM 1983
Parallel and multicore computing
parallel programming models
0.011983
Solving Linear Algebraic Equations on an MIMD Computer · J. ACM 1983

Methods — techniques the papers use, named apart from their topics

givens transformations · 0.0gaussian elimination · 0.0
YearPublicationVenuePosition
1983 Solving Linear Algebraic Equations on an MIMD Computer
abstract
Two pracUcal parallel algorithms for solving systems of dense linear equations on an MIMD computer are presented.They are based on Gaussian elunmation and Givens transformations The algonthms are numerically stable and have been tested on the Denelcor HEP machine.
Robert E. Lord, Janusz S. Kowalik, Swarn P. Kumar
J. ACM1