Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs (Q487267): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Ioannis Koutis / rank
Normal rank
 
Property / author
 
Property / author: Gary Lee Miller / rank
Normal rank
 
Property / author
 
Property / author: Gary Lee Miller / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1991838331 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1111.1750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Graph-Theoretic Game and Its Application to the <i>k</i>-Server Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of network synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The tail of the hypergeometric distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylog-time and near-linear work approximation scheme for undirected shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower-stretch spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3113709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Randomized Parallel Algorithm for Single-Source Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nearly-m log n Time Solver for SDD Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and Efficient Parallel Solution of Sparse Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical View of Interior-Point Methods in Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding Lowest Common Ancestors: Simplification and Parallelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Laplacian Paradigm: Emerging Algorithms for Massive Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-Probability Parallel Transitive-Closure Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382667 / rank
 
Normal rank

Latest revision as of 13:30, 9 July 2024

scientific article
Language Label Description Also known as
English
Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs
scientific article

    Statements

    Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 January 2015
    0 references
    parallel algorithms
    0 references
    linear systems
    0 references
    low-stretch spanning trees
    0 references
    low-stretch subgraphs
    0 references
    low-diameter decomposition
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references