Show simple item record

Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations

dc.contributor.authorCohen, Michael B.
dc.contributor.authorKelner, Jonathan
dc.contributor.authorKyng, Rasmus
dc.contributor.authorPeebles, John
dc.contributor.authorPeng, Richard
dc.contributor.authorRao, Anup B.
dc.contributor.authorSidford, Aaron
dc.date.accessioned2021-11-09T19:10:10Z
dc.date.available2021-11-09T19:10:10Z
dc.date.issued2018-10
dc.identifier.urihttps://hdl.handle.net/1721.1/138046
dc.language.isoen
dc.publisherIEEEen_US
dc.relation.isversionof10.1109/focs.2018.00089en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourcearXiven_US
dc.titleSolving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizationsen_US
dc.typeArticleen_US
dc.identifier.citationCohen, Michael B., Kelner, Jonathan, Kyng, Rasmus, Peebles, John, Peng, Richard et al. 2018. "Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse LU Factorizations."
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mathematics
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dc.date.updated2019-11-14T17:34:44Z
dspace.date.submission2019-11-14T17:34:48Z
mit.licenseOPEN_ACCESS_POLICY
mit.metadata.statusAuthority Work and Publication Information Neededen_US


Files in this item

Thumbnail
Name:
1811.10722.pdf
Size:
544.3Kb
Format:
PDF
Description:
Accepted version
View/Open

This item appears in the following Collection(s)

Show simple item record