On the public citation graph
On the optimality of linear schedules
0 signed · 27 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/978-0-387-74503-9openalex-snapshot
Linear and Nonlinear Programming
inferredcites →https://doi.org/10.1016/0378-4754(86)90092-3openalex-snapshot
Linear and nonlinear programming.
inferredcites →https://doi.org/10.1016/0743-7315(86)90010-9openalex-snapshot
A design methodology for synthesizing parallel algorithms and architectures
inferredcites →https://doi.org/10.1109/12.123395openalex-snapshot
Independent partitioning of algorithms with uniform dependencies
inferredcites →https://doi.org/10.1109/12.30873openalex-snapshot
Minimum distance: a method for partitioning recurrences for multiprocessors
inferredcites →https://doi.org/10.1109/5.4402openalex-snapshot
Regular iterative algorithms and their implementation on processor arrays
inferredcites →https://doi.org/10.1109/arrays.1988.18079openalex-snapshot
Time optimal linear schedules for algorithms with uniform dependencies
inferredcites →https://doi.org/10.1109/tc.1985.1676516openalex-snapshot
The Design of Optimal Systolic Arrays
inferredcites →https://doi.org/10.1109/tc.1986.1676652openalex-snapshot
Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
inferredcites →https://doi.org/10.1145/321406.321418openalex-snapshot
The Organization of Computations for Uniform Recurrence Equations
inferredcites →https://doi.org/10.1145/773453.808184openalex-snapshot
Automatic synthesis of systolic arrays from uniform recurrent equations
inferredcites →https://doi.org/10.1145/800015.808184openalex-snapshot
Automatic synthesis of systolic arrays from uniform recurrent equations
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-61626-8_51openalex-snapshot
Memory reuse analysis in the polyhedral model
inferred← citeshttps://doi.org/10.1007/978-1-4615-2762-6_7openalex-snapshot
Modeling Data Flow and Control Flow for DSP System Synthesis
inferred← citeshttps://doi.org/10.1007/bf00930641openalex-snapshot
Systematic generation of linear allocation functions in systolic array design
inferred← citeshttps://doi.org/10.1007/bf01941688openalex-snapshot
Preconditioning index set transformations for time-optimal affine scheduling
inferred← citeshttps://doi.org/10.1007/bf02407035openalex-snapshot
Closed-form mapping conditions for the synthesis of linear processor arrays
inferred← citeshttps://doi.org/10.1017/s0956796800001155openalex-snapshot
Total unfolding: theory and applications
inferred← citeshttps://doi.org/10.1109/12.508321openalex-snapshot
On uniformization of affine dependence algorithms
inferred← citeshttps://doi.org/10.1109/71.265946openalex-snapshot
On loop transformations for generalized cycle shrinking
inferred← citeshttps://doi.org/10.1109/ipps.1993.262778openalex-snapshot
Mapping of uniform dependence algorithm onto fixed size processor arrays
inferred← citeshttps://doi.org/10.1109/spdp.1992.242753openalex-snapshot
On uniformization of affine dependence algorithms
inferred← citeshttps://doi.org/10.1145/115865.115870openalex-snapshot
Detecting static algorithms by partial evaluation
inferred← citeshttps://doi.org/10.1145/115866.115870openalex-snapshot
Detecting static algorithms by partial evaluation
inferred← citeshttps://doi.org/10.1145/97444.97703openalex-snapshot
Preconditioning index set transformations for time-optimal affine scheduling
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.