default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBarry W. Peyton
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i2]M. Ozan Karsavuran, Esmond G. Ng, Barry W. Peyton, Jonathan L. Peyton:
Some new techniques to use in serial sparse Cholesky factorization algorithms. CoRR abs/2409.13090 (2024)- [i1]M. Ozan Karsavuran, Esmond G. Ng, Barry W. Peyton:
GPU Accelerated Sparse Cholesky Factorization. CoRR abs/2409.14009 (2024) - 2021
- [j12]Mathias Jacquelin, Esmond G. Ng, Barry W. Peyton:
Fast Implementation of the Traveling-Salesman-Problem Method for Reordering Columns within Supernodes. SIAM J. Matrix Anal. Appl. 42(3): 1337-1364 (2021)
2010 – 2019
- 2018
- [c2]Mathias Jacquelin, Esmond G. Ng, Barry W. Peyton:
Fast and effective reordering of columns within supernodes using partition refinement. CSC 2018: 76-86
2000 – 2009
- 2008
- [j11]Pinar Heggernes
, Barry W. Peyton:
Fast Computation of Minimal Fill Inside A Given Elimination Ordering. SIAM J. Matrix Anal. Appl. 30(4): 1424-1444 (2008) - 2004
- [j10]Anne Berry, Jean R. S. Blair, Pinar Heggernes, Barry W. Peyton:
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs. Algorithmica 39(4): 287-298 (2004) - 2001
- [j9]Barry W. Peyton:
Minimal Orderings Revisited. SIAM J. Matrix Anal. Appl. 23(1): 271-294 (2001) - [j8]Chao Yang, Barry W. Peyton, Donald W. Noid, Bobby G. Sumpter, Robert E. Tuzun:
Large-Scale Normal Coordinate Analysis for Molecular Structures. SIAM J. Sci. Comput. 23(2): 563-582 (2001)
1990 – 1999
- 1999
- [r1]Joel V. Brawley, Peter R. Turner, Barry W. Peyton, Esmond Ng, R. B. Bapat:
Linear Algebra. Handbook of Discrete and Combinatorial Mathematics 1999 - 1996
- [j7]Esmond G. Ng, Barry W. Peyton:
Some Results on Structure Prediction in Sparse QR Factorization. SIAM J. Matrix Anal. Appl. 17(2): 443-459 (1996) - 1994
- [j6]Jean R. S. Blair, Barry W. Peyton:
On Finding Minimum-Diameter Clique Trees. Nord. J. Comput. 1(2): 173-201 (1994) - [j5]John R. Gilbert, Esmond G. Ng, Barry W. Peyton:
An Efficient Algorithm to Compute Row and Column Counts for Sparse Cholesky Factorization. SIAM J. Matrix Anal. Appl. 15(4): 1075-1091 (1994) - 1993
- [j4]Joseph W. H. Liu, Esmond G. Ng, Barry W. Peyton:
On Finding Supernodes for Sparse Matrix Computations. SIAM J. Matrix Anal. Appl. 14(1): 242-252 (1993) - [j3]Esmond G. Ng, Barry W. Peyton:
A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors. SIAM J. Sci. Comput. 14(4): 761-769 (1993) - [j2]Esmond G. Ng, Barry W. Peyton:
Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers. SIAM J. Sci. Comput. 14(5): 1034-1056 (1993) - [c1]Charles A. Leete, Barry W. Peyton, Richard F. Sincovec:
Toward a Parallel Recursive Spectral Bisection Mapping Tool. PPSC 1993: 923-928 - 1991
- [j1]Michael T. Heath, Esmond G. Ng, Barry W. Peyton:
Parallel Algorithms for Sparse Linear Systems. SIAM Rev. 33(3): 420-460 (1991)
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-10-18 20:27 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:
