On the public citation graph
Generation of synchronous code for automatic parallelization of while loops
0 signed · 30 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/3-540-57208-2_28openalex-snapshot
Loop parallelization in the polytope model
inferredcites →https://doi.org/10.1007/3-540-58430-7_59openalex-snapshot
On scanning space-time mapped while loops
inferredcites →https://doi.org/10.1007/bf02577789openalex-snapshot
Automatic parallelization ofwhile-loops using speculative execution
inferredcites →https://doi.org/10.1051/ro/1988220302431openalex-snapshot
Parametric integer programming
inferredcites →https://doi.org/10.1109/aispas.1995.401360openalex-snapshot
On the parallelization of loop nests containing while loops
inferredcites →https://doi.org/10.1109/shpcc.1994.296675openalex-snapshot
Space-time transformation of while-loops using speculative execution
inferredcites →https://doi.org/10.1145/75277.75280openalex-snapshot
An efficient method of computing static single assignment form
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-48319-5_22openalex-snapshot
The Advantages of Instance-Wise Reaching Definition Analyses in Array (S)SA
inferred← citeshttps://doi.org/10.1007/3-540-61626-8_64openalex-snapshot
Classifying loops for space-time mapping
inferred← citeshttps://doi.org/10.1007/978-3-642-11970-5_16openalex-snapshot
The Polyhedral Model Is More Widely Applicable Than You Think
inferred← citeshttps://doi.org/10.1007/bfb0017246openalex-snapshot
Exploiting monotone convergence functions in parallel programs
inferred← citeshttps://doi.org/10.1007/s10766-006-0012-3openalex-snapshot
Semi-Automatic Composition of Loop Transformations for Deep Parallelism and Memory Hierarchies
inferred← citeshttps://doi.org/10.1016/s0167-8191(99)00063-0openalex-snapshot
Termination detection in parallel loop nests with while loops
inferred← citeshttps://doi.org/10.1080/17445760.2015.1104681openalex-snapshot
Application execution path analysis for the automatic parallelisation of binary codes in the Intel x86 platform
inferred← citeshttps://doi.org/10.1109/estimedia.2011.6088516openalex-snapshot
Automatic derivation of polyhedral process networks from while-loop affine programs
inferred← citeshttps://doi.org/10.1109/pact.2005.16openalex-snapshot
Deep jam: conversion of coarse-grain parallelism to instruction-level and vector parallelism for irregular applications
inferred← citeshttps://doi.org/10.1145/2838734openalex-snapshot
The Polyhedral Model of Nonlinear Loops
inferred← citeshttps://doi.org/10.1145/2892208.2892217openalex-snapshot
Input space splitting for OpenCL
inferred← citeshttps://doi.org/10.1145/3178372.3179509openalex-snapshot
A polyhedral compilation framework for loops with dynamic data-dependent bounds
inferred← citeshttps://doi.org/10.1145/3409390.3409403openalex-snapshot
Automated Partitioning of Data-Parallel Kernels using Polyhedral Compilation
inferred← citeshttps://doi.org/10.11606/d.55.2016.tde-29032016-092853openalex-snapshot
Análise dos caminhos de execução de programas para a paralelização automática de códigos binários para a plataforma Intel x86
inferred← citeshttps://doi.org/10.6100/ir629342openalex-snapshot
Enhanced applicability of loop transformations
inferred← citeshttps://doi.org/10.70675/0d9eb0daz75bbz48c4zbe0cza9519ab8daf0openalex-snapshot
Application de la métaprogrammation template à la conception de bibliothèques actives de parallélisation assistée
inferred← citeshttps://doi.org/10.70675/9a4b7e14za7f4z4a6ezb5f1z795b20080783openalex-snapshot
A combined language and polyhedral approach to heterogeneous parallelism
inferred← citeshttps://doi.org/10.70675/eb0f178czd7a4z429cz8c3bz1c08386111b2openalex-snapshot
Improving tiling, reducing compilation time, and extending the scope of polyhedral compilation
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.