On the public citation graph
On the optimality of Feautrier's scheduling algorithm
0 signed · 28 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-44520-x_52openalex-snapshot
Scheduling the Computations of a Loop Nest with Respect to a Given Mapping
inferredcites →https://doi.org/10.1007/978-1-4612-1362-8openalex-snapshot
Scheduling and Automatic Parallelization
inferredcites →https://doi.org/10.1007/bf01379404openalex-snapshot
Some efficient solutions to the affine scheduling problem. Part II. Multidimensional time
inferredcites →https://doi.org/10.1007/bf01407835openalex-snapshot
Some efficient solutions to the affine scheduling problem. I. One-dimensional time
inferredcites →https://doi.org/10.1007/bf01407931openalex-snapshot
Dataflow analysis of array and scalar references
inferredcites →https://doi.org/10.1023/a:1025117523902openalex-snapshot
Parameterized Polyhedra and Their Vertices
inferredcites →https://doi.org/10.1023/a:1025168022993openalex-snapshot
Optimal Fine and Medium Grain Parallelism Detection in Polyhedral Reduced Dependence Graphs
inferredcites →https://doi.org/10.1057/jors.1987.94openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.1145/113445.113449openalex-snapshot
A data locality optimizing algorithm
inferredcites →https://doi.org/10.1145/237578.237617openalex-snapshot
Counting solutions to linear and nonlinear constraints through Ehrhart polynomials
inferredcites →https://doi.org/10.1145/2591635.2667172openalex-snapshot
Counting solutions to linear and nonlinear constraints through Ehrhart polynomials
inferredcites →https://doi.org/10.1145/360827.360844openalex-snapshot
The parallel execution of DO loops
inferredcites →https://doi.org/10.1145/378795.378852openalex-snapshot
A unified framework for schedule and storage optimization
inferredcites →https://doi.org/10.1145/41625.41631openalex-snapshot
Automatic decomposition of scientific programs for parallel execution
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-306-48706-3_13openalex-snapshot
Application-Domain-Driven System Design for Pervasive Video Processing
inferred← citeshttps://doi.org/10.1007/978-0-387-09766-4_519openalex-snapshot
Parallelism Detection in Nested Loops, Optimal
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-642-15769-1_8openalex-snapshot
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
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.1016/j.parco.2012.06.001openalex-snapshot
Free scheduling for statement instances of parameterized arbitrarily nested affine loops
inferred← citeshttps://doi.org/10.1109/cgo.2006.13openalex-snapshot
Data and Computation Transformations for Brook Streaming Applications on Multiprocessors
inferred← citeshttps://doi.org/10.1109/cgo.2007.21openalex-snapshot
Iterative Optimization in the Polyhedral Model: Part I, One-Dimensional Time
inferred← citeshttps://doi.org/10.1109/memcod.2010.5558638openalex-snapshot
Understanding loops: The influence of the decomposition of Karp, Miller, and Winograd
inferred← citeshttps://doi.org/10.1145/1375581.1375594openalex-snapshot
Iterative optimization in the polyhedral model
inferred← citeshttps://doi.org/10.1145/1379022.1375594openalex-snapshot
Iterative optimization in the polyhedral model
inferred← citeshttps://doi.org/10.1145/2429069.2429127openalex-snapshot
Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra
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.