On the public citation graph

The polaris internal representation

https://doi.org/10.1007/bf02577778
0 signed · 31 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/3-540-45403-9_8openalex-snapshot
Automatic Array Privatization
inferredcites →https://doi.org/10.1007/978-1-4613-9575-1openalex-snapshot
Programming with Sets
inferredcites →https://doi.org/10.1109/icpp.1994.59openalex-snapshot
An Overview of Symbolic Analysis Techniques Needed for the Effective Parallelization of the Perfect Benchmarks
inferredcites →https://doi.org/10.1145/24039.24041openalex-snapshot
The program dependence graph and its use in optimization

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11532378_1openalex-snapshot
Experiences in Using Cetus for Source-to-Source Transformations
inferred← citeshttps://doi.org/10.1007/3-540-48228-8_77openalex-snapshot
A Compiler Infrastructure for High-Performance Java⋆
inferred← citeshttps://doi.org/10.1007/3-540-60321-2_25openalex-snapshot
Using the ProSet-Linda prototyping language for investigating MIMD algorithms for model matching in 3-D computer vision
inferred← citeshttps://doi.org/10.1007/978-3-030-79276-3_12openalex-snapshot
ASIF: An Internal Representation Suitable for Program Transformation and Parallel Conversion
inferred← citeshttps://doi.org/10.1007/978-3-540-24644-2_35openalex-snapshot
Cetus – An Extensible Compiler Infrastructure for Source-to-Source Transformation
inferred← citeshttps://doi.org/10.1007/978-3-540-71322-7_16openalex-snapshot
Towards a Source Level Compiler: Source Level Modulo Scheduling
inferred← citeshttps://doi.org/10.1007/bfb0014216openalex-snapshot
Compiler architectures for heterogeneous systems
inferred← citeshttps://doi.org/10.1007/bfb0017258openalex-snapshot
Automatic parallelization for non-cache coherent multiprocessors
inferred← citeshttps://doi.org/10.1007/bfb0017260openalex-snapshot
Are parallel workstations the right target for parallelizing compilers?
inferred← citeshttps://doi.org/10.1007/bfb0025876openalex-snapshot
Polaris: Improving the effectiveness of parallelizing compilers
inferred← citeshttps://doi.org/10.1016/j.scico.2005.06.003openalex-snapshot
Computer algebra systems as mathematical optimizing compilers
inferred← citeshttps://doi.org/10.1109/71.737695openalex-snapshot
Nonlinear and symbolic data dependence testing
inferred← citeshttps://doi.org/10.1109/clustr.2001.959983openalex-snapshot
A parallel programming environment for a V-bus based PC-cluster
inferred← citeshttps://doi.org/10.1109/hpc.2000.843593openalex-snapshot
A comparison based tool for checking parallelized large sequential programs
inferred← citeshttps://doi.org/10.1109/hpca.2002.995708openalex-snapshot
Let's study whole-program cache behaviour analytically
inferred← citeshttps://doi.org/10.1109/icapp.2002.1173608openalex-snapshot
Efficient compile-time analysis of cache behaviour for programs with IF statements
inferred← citeshttps://doi.org/10.1109/icppw.1996.538601openalex-snapshot
Restructuring programs for high-speed computers with Polaris
inferred← citeshttps://doi.org/10.1109/icppw.2005.65openalex-snapshot
Parallel Execution of For Loops Using Checkpointing Techniques
inferred← citeshttps://doi.org/10.1109/icppw.2006.74openalex-snapshot
Towards a Source Level Compiler: Source Level Modulo Scheduling
inferred← citeshttps://doi.org/10.1109/iv.2004.1320231openalex-snapshot
Performance visualizations using XML representations
inferred← citeshttps://doi.org/10.1109/superc.1994.344316openalex-snapshot
The range test: a dependence test for symbolic, non-linear expressions
inferred← citeshttps://doi.org/10.1109/tc.2004.1275296openalex-snapshot
Efficient and accurate analytical modeling of whole-program data cache behavior
inferred← citeshttps://doi.org/10.1109/wpc.1999.777759openalex-snapshot
The SPARAMAT approach to automatic comprehension of sparse matrix computations
inferred← citeshttps://doi.org/10.1145/1391956.1391959openalex-snapshot
XARK
inferred← citeshttps://doi.org/10.1145/602770.602858openalex-snapshot
The range test
inferred← citeshttps://doi.org/10.5555/602770.602858openalex-snapshot
The range test: a dependence test for symbolic, non-linear expressions
inferred← citeshttps://doi.org/10.5821/dissertation-2117-93312openalex-snapshot
Recursos anchos: una técnica de bajo coste para explotar paralelismo agresivo en códigos numéricos
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.