On the public citation graph
Simple Parallel and Distributed Algorithms for Spectral Graph Sparsification
0 signed · 57 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-642-13562-0_2openalex-snapshot
The Laplacian Paradigm: Emerging Algorithms for Massive Graphs
inferredcites →https://doi.org/10.1007/s00224-012-9396-1openalex-snapshot
Spectral Sparsification in the Semi-streaming Setting
inferredcites →https://doi.org/10.1109/focs.2011.85openalex-snapshot
A Nearly-m log n Time Solver for SDD Linear Systems
inferredcites →https://doi.org/10.1109/sc.2010.29openalex-snapshot
Hierarchical Diagonal Blocking and Precision Reduction Applied to Combinatorial Multigrid
inferredcites →https://doi.org/10.1137/1.9780898719772openalex-snapshot
Distributed Computing: A Locality-Sensitive Approach
inferredcites →https://doi.org/10.1137/110843563openalex-snapshot
Lean Algebraic Multigrid (LAMG): Fast Graph Laplacian Linear Solver
inferredcites →https://doi.org/10.1137/110845914openalex-snapshot
Approaching Optimality for Solving SDD Linear Systems
inferredcites →https://doi.org/10.1137/s0895479801390637openalex-snapshot
Support Theory for Preconditioning
inferredcites →https://doi.org/10.1145/1007352.1007372openalex-snapshot
Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
inferredcites →https://doi.org/10.1145/1374376.1374456openalex-snapshot
Graph sparsification by effective resistances
inferredcites →https://doi.org/10.1145/1502793.1502794openalex-snapshot
Expander flows, geometric embeddings and graph partitioning
inferredcites →https://doi.org/10.1145/1806689.1806699openalex-snapshot
Subgraph sparsification and nearly optimal ultrasparsifiers
inferredcites →https://doi.org/10.1145/2090236.2090267openalex-snapshot
Spectral sparsification via random spanners
inferredcites →https://doi.org/10.1145/2347736.2347759openalex-snapshot
A fast solver for a class of linear systems
inferredcites →https://doi.org/10.1145/2461912.2461992openalex-snapshot
Efficient preconditioning of laplacian matrices for computer graphics
inferredcites →https://doi.org/10.1145/2488608.2488724openalex-snapshot
A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
inferredcites →https://doi.org/10.1145/2492007.2492029openalex-snapshot
Spectral sparsification of graphs
inferredcites →https://doi.org/10.1145/2591796.2591832openalex-snapshot
An efficient parallel solver for SDD linear systems
inferredcites →https://doi.org/10.1145/2612669.2612676openalex-snapshot
Simple parallel and distributed algorithms for spectral graph sparsification
inferredcites →https://doi.org/10.1145/2743021openalex-snapshot
Faster Spectral Sparsification and Numerical Algorithms for SDD Matrices
inferredcites →https://doi.org/10.1145/2755573.2755574openalex-snapshot
Improved Parallel Algorithms for Spanners and Hopsets
inferredcites →https://doi.org/10.1184/r1/6714635openalex-snapshot
Algorithm Design Using Spectral Graph Theory
inferredcites →https://doi.org/10.4230/lipics.stacs.2012.266openalex-snapshot
Improved Spectral Sparsification and Numerical Algorithms for SDD Matrices
inferredcites →https://doi.org/10.4230/lipics.stacs.2012.iopenalex-snapshot
Frontmatter, Foreword, Conference Organization, External Reviewers, Table of Contents
inferredcites →https://doi.org/10.48550/arxiv.1010.4108openalex-snapshot
Towards an SDP-based Approach to Spectral Methods: A Nearly-Linear-Time Algorithm for Graph Partitioning and Decomposition
inferredcites →https://doi.org/10.48550/arxiv.1310.5407openalex-snapshot
Distributed Computation of Sparse Cuts
inferredcites →https://doi.org/10.5555/1255378.1255381openalex-snapshot
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
inferredcites →https://doi.org/10.5860/choice.30-1558openalex-snapshot
Introduction to parallel computing
inferredcites →https://doi.org/10.5860/choice.37-0975openalex-snapshot
Algorithms and theory of computation handbook
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-30448-4_27openalex-snapshot
Communication-Efficient Distributed Graph Clustering and Sparsification Under Duplication Models
inferred← citeshttps://doi.org/10.1007/978-3-032-26465-7_13openalex-snapshot
Distributed Sparsest Cut via Eigenvalue Estimation
inferred← citeshttps://doi.org/10.1007/s00453-022-01053-4openalex-snapshot
Faster Cut Sparsification of Weighted Graphs
inferred← citeshttps://doi.org/10.1007/s00453-023-01154-8openalex-snapshot
A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems
inferred← citeshttps://doi.org/10.1007/s13198-021-01060-8openalex-snapshot
Fast clustering algorithm of commodity association big data sparse network
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.01.021openalex-snapshot
Constructing light spanners deterministically in near-linear time
inferred← citeshttps://doi.org/10.1017/apr.2021.27openalex-snapshot
A stochastic process on a network with connections to Laplacian systems of equations
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00065openalex-snapshot
Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00099openalex-snapshot
Minor Sparsifiers and the Distributed Laplacian Paradigm
inferred← citeshttps://doi.org/10.1137/1.9781611975994.80openalex-snapshot
Finding a Bounded-Degree Expander Inside a Dense One
inferred← citeshttps://doi.org/10.1137/1.9781611976465.113openalex-snapshot
Graph Spanners by Sketching in Dynamic Streams and the Simultaneous Communication Model
inferred← citeshttps://doi.org/10.1137/21m1391018openalex-snapshot
Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving
inferred← citeshttps://doi.org/10.1145/3519270.3538436openalex-snapshot
The Laplacian Paradigm in the Broadcast Congested Clique
inferred← citeshttps://doi.org/10.1145/3626183.3659954openalex-snapshot
Sparse Spanners with Small Distance and Congestion Stretches
inferred← citeshttps://doi.org/10.1145/3626183.3659959openalex-snapshot
Fast Broadcast in Highly Connected Networks
inferred← citeshttps://doi.org/10.1145/3717823.3718239openalex-snapshot
Near-Optimal Linear Sketches and Fully-Dynamic Algorithms for Hypergraph Spectral Sparsification
inferred← citeshttps://doi.org/10.1145/3819804.3819812openalex-snapshot
A Gentle Introduction to Distributed Laplacian Techniques
inferred← citeshttps://doi.org/10.2298/csis200531039sopenalex-snapshot
Scaling industrial applications for the Big Data era
inferred← citeshttps://doi.org/10.48550/arxiv.1802.09829openalex-snapshot
Effective Resistance Preserving Directed Graph Symmetrization
inferred← citeshttps://doi.org/10.48550/arxiv.1912.08950openalex-snapshot
Slim Graph: Practical Lossy Graph Compression for Approximate Graph Processing, Storage, and Analytics
inferred← citeshttps://doi.org/10.55011/staiqc.2023.3101openalex-snapshot
Systematic Literature Review on Parallel Sorting and Searching Algorithms for Graph Analytics Problems
inferred← citeshttps://doi.org/10.70675/1e47cd3cz725bz41ffzb6c0z00708c3e3910openalex-snapshot
Efficient sequential learning in structured and constrained environments
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.