Pages that link to "Item:Q4372999"

The following pages link to A Randomized Parallel Algorithm for Single-Source Shortest Paths (Q4372999):

Displaying 23 items.

• Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs (Q487267) (← links)
• Improved processor bounds for parallel algorithms for weighted directed graphs (Q1209343) (← links)
• Thorup-Zwick emulators are universally optimal hopsets (Q1628677) (← links)
• Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC (Q2084978) (← links)
• Single-source shortest paths in the CONGEST model with improved bounds (Q2166365) (← links)
• Polylog-time and near-linear work approximation scheme for undirected shortest paths (extended abstract) (Q2817594) (← links)
• (Q2979832) (← links)
• Using Selective Path-Doubling for Parallel Shortest-Path Computations (Q3125218) (← links)
• Time–Work Tradeoffs of the Single-Source Shortest Paths Problem (Q4228283) (← links)
• A Hierarchy of Lower Bounds for Sublinear Additive Spanners (Q4561267) (← links)
• Δ-stepping: a parallelizable shortest path algorithm (Q4820907) (← links)
• Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models (Q4989920) (← links)
• A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths (Q4997313) (← links)
• (Q5092347) (← links)
• Nearly Work-Efficient Parallel Algorithm for Digraph Reachability (Q5129233) (← links)
• (Q5129335) (← links)
• Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths (Q5233107) (← links)
• (Q5257453) (← links)
• (Q5691919) (← links)
• Computational Science – ICCS 2005 (Q5709637) (← links)
• A simple parallel algorithm for the single-source shortest path problem on planar digraphs (Q5926351) (← links)
• Distributed planar reachability in nearly optimal time (Q6535037) (← links)
• A mechanism design approach for multi-party machine learning (Q6549677) (← links)