On the public citation graph

Transitive closure of infinite graphs and its applications

https://doi.org/10.1007/bfb0014196
0 signed · 23 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.1007/bfb0025874openalex-snapshot
Finding legal reordering transformations using mappings
inferredcites →https://doi.org/10.1109/icapp.1995.472180openalex-snapshot
A unifying framework for iteration reordering transformations
inferredcites →https://doi.org/10.1109/tc.1987.5009499openalex-snapshot
Compiler Algorithms for Synchronization
inferredcites →https://doi.org/10.1145/109625.109632openalex-snapshot
Removal of redundant dependences in DOACROSS loops with constant dependences

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-319-03780-6_12openalex-snapshot
Using Basis Dependence Distance Vectors to Calculate the Transitive Closure of Dependence Relations by Means of the Floyd-Warshall Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-17458-2_10openalex-snapshot
An Iterative Algorithm of Computing the Transitive Closure of a Union of Parameterized Affine Integer Tuple Relations
inferred← citeshttps://doi.org/10.1007/978-3-642-23702-7_18openalex-snapshot
Transitive Closures of Affine Integer Tuple Relations and Their Overapproximations
inferred← citeshttps://doi.org/10.1007/978-3-642-35893-7_7openalex-snapshot
Impact of Variable Privatization on Extracting Synchronization-Free Slices for Multi-core Computers
inferred← citeshttps://doi.org/10.1007/978-3-642-39958-9_4openalex-snapshot
Transitive Closure of a Union of Dependence Relations for Parameterized Perfectly-Nested Loops
inferred← citeshttps://doi.org/10.1007/s10009-008-0064-3openalex-snapshot
FAST: acceleration from theory to practice
inferred← citeshttps://doi.org/10.1007/s10878-014-9740-2openalex-snapshot
Using basis dependence distance vectors in the modified Floyd–Warshall algorithm
inferred← citeshttps://doi.org/10.1016/j.entcs.2012.10.007openalex-snapshot
Convex Invariant Refinement by Control Node Splitting: a Heuristic Approach
inferred← citeshttps://doi.org/10.1016/j.parco.2010.12.005openalex-snapshot
Coarse-grained loop parallelization: Iteration Space Slicing vs affine transformations
inferred← citeshttps://doi.org/10.1109/espm254806.2021.00006openalex-snapshot
Scalable parallel algorithm for fast computation of Transitive Closure of Graphs on Shared Memory Architectures
inferred← citeshttps://doi.org/10.1109/hldvt.2009.5340164openalex-snapshot
Experience with widening based equivalence checking in realistic multimedia systems
inferred← citeshttps://doi.org/10.1109/ispdc.2007.21openalex-snapshot
Extracting Coarse-Grained Parallelism in Program Loops with the Slicing Framework
inferred← citeshttps://doi.org/10.1109/ispdc.2009.15openalex-snapshot
Coarse-Grained Loop Parallelization: Iteration Space Slicing vs Affine Transformations
inferred← citeshttps://doi.org/10.1109/sbac-padw.2016.16openalex-snapshot
Synchronization-Free Automatic Parallelization for Arbitrarily Nested Affine Loops
inferred← citeshttps://doi.org/10.1109/wcre.2003.1287260openalex-snapshot
Algorithm recognition based on demand-driven data-.ow analysis
inferred← citeshttps://doi.org/10.1142/s1793830912500115openalex-snapshot
AN ITERATIVE ALGORITHM OF COMPUTING THE TRANSITIVE CLOSURE OF A UNION OF PARAMETRIZED AFFINE INTEGER TUPLE RELATIONS
inferred← citeshttps://doi.org/10.15439/2015f34openalex-snapshot
TRACO: An Automatic Loop Nest Parallelizer for Numerical Applications
inferred← citeshttps://doi.org/10.30574/gscaet.2022.4.1.0050openalex-snapshot
On computing transitive closures in MatBase
inferred← citeshttps://doi.org/10.7494/csci.2017.18.2.195openalex-snapshot
DYNAMIC TILE FREE SCHEDULING FOR CODE WITH ACYCLIC INTER-TILE DEPENDENCE GRAPHS
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.