On the public citation graph
Transitive Closure of Infinite Graphs and Its Applications
0 signed · 82 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/bfb0025874openalex-snapshot
Finding legal reordering transformations using mappings
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
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
inferredcites →https://doi.org/10.1145/209936.209952openalex-snapshot
Compiler optimizations for eliminating barrier synchronization
inferredcites →https://doi.org/10.1145/237721.237799openalex-snapshot
Static analysis to reduce synchronization costs in data-parallel programs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.647openalex-snapshot
Advanced optimization strategies in the Rice dHPF compiler
inferred← citeshttps://doi.org/10.1007/11549468_39openalex-snapshot
Deciding Where to Call Performance Libraries
inferred← citeshttps://doi.org/10.1007/3-540-36490-0_21openalex-snapshot
Accretive Rules in Cayley P Systems
inferred← citeshttps://doi.org/10.1007/3-540-44905-1_11openalex-snapshot
Iteration Space Slicing for Locality
inferred← citeshttps://doi.org/10.1007/3-540-45574-4_7openalex-snapshot
Extending Scalar Optimizations for Arrays
inferred← citeshttps://doi.org/10.1007/3-540-45706-2_40openalex-snapshot
On the Equivalence of Two Systems of Affine Recurrence Equations
inferred← citeshttps://doi.org/10.1007/3-540-48320-9_14openalex-snapshot
Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic
inferred← citeshttps://doi.org/10.1007/3-540-49727-7_19openalex-snapshot
Sparse Jacobian Computation in Automatic Differentiation by Static Program Analysis
inferred← citeshttps://doi.org/10.1007/3-540-63166-6_39openalex-snapshot
Symbolic model checking of infinite state systems using presburger arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-031-30445-3_5openalex-snapshot
NPDP Benchmark Suite for Loop Tiling Effectiveness Evaluation
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-319-15147-2_26openalex-snapshot
Perfectly Nested Loop Tiling Transformations Based on the Transitive Closure of the Program Dependence Graph
inferred← citeshttps://doi.org/10.1007/978-3-319-15147-2_34openalex-snapshot
TRACO Parallelizing Compiler
inferred← citeshttps://doi.org/10.1007/978-3-319-19324-3_10openalex-snapshot
Using an Artificial Neural Network to Predict Loop Transformation Time
inferred← citeshttps://doi.org/10.1007/978-3-319-32152-3_13openalex-snapshot
Free Scheduling of Tiles Based on the Transitive Closure of Dependence Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-31985-6_15openalex-snapshot
Verification of Source Code Transformations by Program Equivalence Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-45209-6_44openalex-snapshot
Finding Free Schedules for Non-uniform Loops
inferred← citeshttps://doi.org/10.1007/978-3-540-69501-1_20openalex-snapshot
Finding Synchronization-Free Parallelism Represented with Trees of Dependent Operations
inferred← citeshttps://doi.org/10.1007/978-3-540-69848-7_69openalex-snapshot
Finding Synchronization-Free Slices of Operations in Arbitrarily Nested Loops
inferred← citeshttps://doi.org/10.1007/978-3-642-02026-1_9openalex-snapshot
Computing the Transitive Closure of a Union of Affine Integer Tuple Relations
inferred← citeshttps://doi.org/10.1007/978-3-642-02658-4_44openalex-snapshot
Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences
inferred← citeshttps://doi.org/10.1007/978-3-642-13374-9_16openalex-snapshot
Synchronization-Free Automatic Parallelization: Beyond Affine Iteration-Space Slicing
inferred← citeshttps://doi.org/10.1007/978-3-642-15582-6_49openalex-snapshot
isl: An Integer Set Library for the Polyhedral Model
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-30397-5_7openalex-snapshot
Using Free Scheduling for Programming Graphic Cards
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/978-3-662-49674-9_45openalex-snapshot
Acceleration in Multi-PushDown Systems
inferred← citeshttps://doi.org/10.1007/s00607-017-0576-3openalex-snapshot
Generation of parallel synchronization-free tiled code
inferred← citeshttps://doi.org/10.1007/s10009-008-0064-3openalex-snapshot
FAST: acceleration from theory to practice
inferred← citeshttps://doi.org/10.1007/s10836-009-5140-4openalex-snapshot
Experience with Widening Based Equivalence Checking in Realistic Multimedia Systems
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.1007/s11227-018-2678-xopenalex-snapshot
Insight into tiles generated by means of a correction technique
inferred← citeshttps://doi.org/10.1007/s11227-019-03109-9openalex-snapshot
Source-to-source compilation targeting OpenMP-based automatic parallelization of C applications
inferred← citeshttps://doi.org/10.1016/j.endm.2009.03.002openalex-snapshot
Calculating Exact Transitive Closure for a Normalized Affine Integer Tuple Relation
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.09.002openalex-snapshot
A Modular Static Analysis Approach to Affine Loop Invariants Detection
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.future.2025.107786openalex-snapshot
Cross-platform and polyhedral programming for Nussinov RNA folding
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.1016/j.parco.2012.06.001openalex-snapshot
Free scheduling for statement instances of parameterized arbitrarily nested affine loops
inferred← citeshttps://doi.org/10.1016/j.parco.2023.103016openalex-snapshot
NPDP benchmark suite for the evaluation of the effectiveness of automatic optimizing compilers
inferred← citeshttps://doi.org/10.1016/j.scico.2013.09.016openalex-snapshot
Abstract acceleration in linear relation analysis
inferred← citeshttps://doi.org/10.1016/s0167-8191(02)00113-8openalex-snapshot
Generating communication sets of array assignment statements for block-cyclic distribution on distributed memory parallel computers
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)82599-xopenalex-snapshot
On the Recognition of Algorithm Templates
inferred← citeshttps://doi.org/10.1023/b:supe.0000011386.69245.f5openalex-snapshot
Transforming Complex Loop Nests for Locality
inferred← citeshttps://doi.org/10.1109/cgo68049.2026.11394841openalex-snapshot
Dependence-Driven, Scalable Quantum Circuit Mapping with Affine Abstractions
inferred← citeshttps://doi.org/10.1109/ewdts.2013.6673180openalex-snapshot
Loop nests parallelization for digital system synthesis
inferred← citeshttps://doi.org/10.1109/hipc53243.2021.00033openalex-snapshot
Anti-Section Transitive Closure
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/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.1145/2362389.2362390openalex-snapshot
Equivalence checking of static affine programs using widening to handle recurrences
inferred← citeshttps://doi.org/10.1145/237578.237585openalex-snapshot
Minimizing communication while preserving parallelism
inferred← citeshttps://doi.org/10.1145/2435227.2435230openalex-snapshot
Mapping of streaming applications considering alternative application specifications
inferred← citeshttps://doi.org/10.1145/263580.263637openalex-snapshot
Iteration space slicing and its application to communication optimization
inferred← citeshttps://doi.org/10.1145/325478.325480openalex-snapshot
Model-checking concurrent systems with unbounded integer variables
inferred← citeshttps://doi.org/10.1145/3795525openalex-snapshot
Diamond Tiling for Periodic Stencil Loop Nests by Means of Transitive Closure-based Extraction of Overlapping Iteration Spaces
inferred← citeshttps://doi.org/10.1145/773184.773201openalex-snapshot
Declarative definition of group indexed data structures and approximation of their domains
inferred← citeshttps://doi.org/10.1155/2018/9579343openalex-snapshot
Minimizing Cost Travel in Multimodal Transport Using Advanced Relation Transitive Closure
inferred← citeshttps://doi.org/10.1177/1094342004038956openalex-snapshot
Improving Memory Hierarchy Performance through Combined Loop Interchange and Multi-Level Fusion
inferred← citeshttps://doi.org/10.1371/journal.pone.0349146openalex-snapshot
Cache-efficient and vectorized parallel dynamic programming for RNA folding
inferred← citeshttps://doi.org/10.1515/amcs-2016-0065openalex-snapshot
Tiling arbitrarily nested loops by means of the transitive
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.3390/electronics10172050openalex-snapshot
Parallel Tiled Code for Computing General Linear Recurrence Equations
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.