On the public citation graph

Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers

https://doi.org/10.1006/jcss.1997.1473
0 signed · 25 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1057/jors.1991.155openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1109/fscs.1990.89571openalex-snapshot
Sparse partitions
inferredcites →https://doi.org/10.1109/sfcs.1991.185417openalex-snapshot
A unified geometric approach to graph separators
inferredcites →https://doi.org/10.1109/sfcs.1993.366817openalex-snapshot
Efficient out-of-core algorithms for linear relaxation using blocking covers
inferredcites →https://doi.org/10.1145/100216.100255openalex-snapshot
Separators in two and three dimensions
inferredcites →https://doi.org/10.1145/165231.166112openalex-snapshot
New graph decompositions and fast emulations in hypercubes and butterflies
inferredcites →https://doi.org/10.1145/48529.48535openalex-snapshot
The input/output complexity of sorting and related problems
inferredcites →https://doi.org/10.1145/73007.73029openalex-snapshot
Work-preserving emulations of fixed-connection networks

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/10704054_3openalex-snapshot
Improving Cache Utilization of Linear Relaxation Methods: Theory and Practice
inferred← citeshttps://doi.org/10.1007/3-540-45545-0_20openalex-snapshot
Cache-Efficient Multigrid Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-46043-8_85openalex-snapshot
Tight Bounds on Capacity Misses for 3D Stencil Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-55224-3_2openalex-snapshot
Exploiting Data Sparsity in Parallel Matrix Powers Computations
inferred← citeshttps://doi.org/10.1017/s0962492914000038openalex-snapshot
Communication lower bounds and optimal algorithms for numerical linear algebra
inferred← citeshttps://doi.org/10.1109/ipdps.2002.1016538openalex-snapshot
An analytical evaluation of tiling for stencil codes with time loop
inferred← citeshttps://doi.org/10.1109/ipdps.2014.119openalex-snapshot
s-Step Krylov Subspace Methods as Bottom Solvers for Geometric Multigrid
inferred← citeshttps://doi.org/10.1109/ipdps.2019.00057openalex-snapshot
Matrix Powers Kernels for Thick-Restart Lanczos with Explicit External Deflation
inferred← citeshttps://doi.org/10.1109/tpds.2002.1058095openalex-snapshot
Recursive array layouts and fast matrix multiplication
inferred← citeshttps://doi.org/10.1137/120893057openalex-snapshot
A Residual Replacement Strategy for Improving the Maximum Attainable Accuracy of $s$-Step Krylov Subspace Methods
inferred← citeshttps://doi.org/10.1137/s0097539797326502openalex-snapshot
Automatic Methods for Hiding Latency in Parallel and Distributed Computation
inferred← citeshttps://doi.org/10.1142/s0129054103001583openalex-snapshot
CACHE MISS ANALYSIS OF 2D STENCIL CODES WITH TILED TIME LOOP
inferred← citeshttps://doi.org/10.1145/2897188openalex-snapshot
Trade-Offs Between Synchronization, Communication, and Computation in Parallel Linear Algebra Computations
inferred← citeshttps://doi.org/10.1145/508791.508975openalex-snapshot
On optimal temporal locality of stencil codes
inferred← citeshttps://doi.org/10.1177/1094342004041295openalex-snapshot
Cache-Efficient Multigrid Algorithms
inferred← citeshttps://doi.org/10.1561/0400000014openalex-snapshot
Algorithms and Data Structures for External Memory
inferred← citeshttps://doi.org/10.21236/ada604544openalex-snapshot
Analysis of the Finite Precision s-Step Biconjugate Gradient Method
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.