On the public citation graph

A Simple Algorithm for the Generation of Efficient Loop Structures

https://doi.org/10.1007/bf03356751
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.1002/9781118627372openalex-snapshot
Integer and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/3-540-55895-0_467openalex-snapshot
Unimodularity considered non-essential (extended abstract)
inferredcites →https://doi.org/10.1007/3-540-57502-2_60openalex-snapshot
A singular loop transformation framework based on non-singular matrices
inferredcites →https://doi.org/10.1007/3-540-57502-2_69openalex-snapshot
Symbolic program analysis and optimization for parallelizing compilers
inferredcites →https://doi.org/10.1007/3-540-57659-2_32openalex-snapshot
Symbolic analysis: A basis for parallelization, optimization, and scheduling of programs
inferredcites →https://doi.org/10.1007/bfb0038674openalex-snapshot
On estimating and enhancing cache effectiveness
inferredcites →https://doi.org/10.1051/ro/1988220302431openalex-snapshot
Parametric integer programming
inferredcites →https://doi.org/10.1057/jors.1987.94openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.1109/fmpc.1995.380437openalex-snapshot
Code generation for multiple mappings
inferredcites →https://doi.org/10.1109/hicss.1995.375471openalex-snapshot
Automatic task graph generation techniques
inferredcites →https://doi.org/10.1109/ipps.1994.288298openalex-snapshot
Estimation of nested loops execution time by integer arithmetic in convex polyhedra
inferredcites →https://doi.org/10.1142/s0129626495000394openalex-snapshot
CONSTRUCTION OF DO LOOPS FROM SYSTEMS OF AFFINE CONSTRAINTS
inferredcites →https://doi.org/10.1145/109625.109631openalex-snapshot
Scanning polyhedra with DO loops
inferredcites →https://doi.org/10.1145/109626.109631openalex-snapshot
Scanning polyhedra with DO loops
inferredcites →https://doi.org/10.1145/125826.125848openalex-snapshot
The Omega test: a fast and practical integer programming algorithm for dependence analysis
inferredcites →https://doi.org/10.1145/135226.135233openalex-snapshot
A practical algorithm for exact array dependence analysis
inferredcites →https://doi.org/10.1145/143369.143387openalex-snapshot
Processor allocation and loop scheduling on multiprocessor computers
inferredcites →https://doi.org/10.1145/178243.178254openalex-snapshot
Counting solutions to Presburger formulas
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.2307/2583737openalex-snapshot
Integer and Combinatorial Optimization

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jpdc.1999.1566openalex-snapshot
Compact DAG Representation and Its Dynamic Scheduling
inferred← citeshttps://doi.org/10.1007/978-1-4757-3155-2_9openalex-snapshot
Symbolic Scheduling of Parameterized Task Graphs on Parallel Machines
inferred← citeshttps://doi.org/10.1007/978-94-011-5514-4_15openalex-snapshot
Automatic Coarse-Grained Parallelization Techniques
inferred← citeshttps://doi.org/10.1016/j.jpdc.2004.05.001openalex-snapshot
Compact DAG representation and its symbolic scheduling
inferred← citeshttps://doi.org/10.1016/s0167-8191(96)00063-4openalex-snapshot
Unimodular transformations of non-perfectly nested loops
inferred← citeshttps://doi.org/10.1109/icpads.1998.741109openalex-snapshot
Symbolic partitioning and scheduling of parameterized task graphs
inferred← citeshttps://doi.org/10.1109/icpp.1999.797429openalex-snapshot
SLC: Symbolic scheduling for executing parameterized task graphs on multiprocessors
inferred← citeshttps://doi.org/10.1109/ipps.1998.669966openalex-snapshot
Low memory cost dynamic scheduling of large coarse grain task graphs
inferred← citeshttps://doi.org/10.1109/paap.2012.38openalex-snapshot
Performance Analysis and Optimization of the Tiled Cholesky Factorization on NUMA Machines
inferred← citeshttps://doi.org/10.1142/s012962640100049xopenalex-snapshot
AUTOMATIC PARALLELIZATION TECHNIQUES BASED ON COMPACT DAG EXTRACTION AND SYMBOLIC SCHEDULING
inferred← citeshttps://doi.org/10.1177/0734904113492410openalex-snapshot
Symbolic mapping and allocation for the Cholesky factorization on NUMA machines
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.