On the public citation graph

Optimal orthogonal tiling

https://doi.org/10.1007/bfb0057891
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.1006/jpdc.1994.1040openalex-snapshot
Evaluating Compiler Optimizations for Fortran D
inferredcites →https://doi.org/10.1006/jpdc.1997.1371openalex-snapshot
Optimal Orthogonal Tiling of 2-D Iterations
inferredcites →https://doi.org/10.1007/bfb0015236openalex-snapshot
Scalable computing
inferredcites →https://doi.org/10.1016/0167-9260(94)90019-1openalex-snapshot
(Pen)-ultimate tiling?
inferredcites →https://doi.org/10.1109/71.80175openalex-snapshot
Pipelined data parallel algorithms-I: concept and modeling
inferredcites →https://doi.org/10.1109/71.80176openalex-snapshot
Pipelined data parallel algorithms-II: design
inferredcites →https://doi.org/10.1109/asap.1997.606827openalex-snapshot
Three-dimensional orthogonal tile sizing problem : mathematical programming approach
inferredcites →https://doi.org/10.1109/hipc.1996.565827openalex-snapshot
Two-dimensional orthogonal tiling: from theory to practice
inferredcites →https://doi.org/10.1109/icpp.1994.67openalex-snapshot
Communication Optimizations Used in the Paradigm Compiler for Distributed-Memory Multicomputers
inferredcites →https://doi.org/10.1145/125826.125893openalex-snapshot
Tiling multidimensional iteration spaces for nonshared memory machines
inferredcites →https://doi.org/10.1145/224538.224571openalex-snapshot
Optimal tile size adjustment in compiling general DOACROSS loop nests
inferredcites →https://doi.org/10.1145/321406.321418openalex-snapshot
The Organization of Computations for Uniform Recurrence Equations
inferredcites →https://doi.org/10.1145/3749740.3749753openalex-snapshot
A Bridging Model for Parallel Computation
inferredcites →https://doi.org/10.1145/73560.73588openalex-snapshot
Supernode partitioning

What points at this work

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

inferred← citeshttps://doi.org/10.1002/cpe.772openalex-snapshot
Space–time mapping and tiling: a helpful combination
inferred← citeshttps://doi.org/10.1007/3-540-45255-9_17openalex-snapshot
Pipeline Algorithms on MPI: Optimal Mapping of the Path Planing Problem
inferred← citeshttps://doi.org/10.1007/3-540-48228-8_28openalex-snapshot
Source Code and Task Graphs in Program Optimization
inferred← citeshttps://doi.org/10.1007/978-3-540-46642-0_18openalex-snapshot
Tiling and Processors Allocation for Three Dimensional Iteration Space
inferred← citeshttps://doi.org/10.1016/s0167-8191(02)00098-4openalex-snapshot
Time-minimal tiling when rise is larger than zero
inferred← citeshttps://doi.org/10.1023/a:1007516818651openalex-snapshot
Index Set Splitting
inferred← citeshttps://doi.org/10.1080/03772063.2003.11416350openalex-snapshot
Study of Computation Time and Idle Time of Tiling Transformation on a Network of Workstations
inferred← citeshttps://doi.org/10.1109/pact.1999.807572openalex-snapshot
On index set splitting
inferred← citeshttps://doi.org/10.1109/sc.2008.5213293openalex-snapshot
Positivity, posynomials and tile size selection
inferred← citeshttps://doi.org/10.1109/tgrs.2016.2550201openalex-snapshot
Spaceborne Synthetic Aperture Radar Data Focusing on Multicore-Based Architectures
inferred← citeshttps://doi.org/10.1109/tpds.2002.1158261openalex-snapshot
On time optimal supernode shape
inferred← citeshttps://doi.org/10.1109/tpds.2003.1189587openalex-snapshot
On the parallel execution time of tiled loops
inferred← citeshttps://doi.org/10.1109/tpds.2003.1233716openalex-snapshot
Optimal semi-oblique tiling
inferred← citeshttps://doi.org/10.1145/305619.305641openalex-snapshot
Selecting tile shape for minimal execution time
inferred← citeshttps://doi.org/10.1145/378580.378619openalex-snapshot
Optimal semi-oblique tiling
inferred← citeshttps://doi.org/10.1145/564870.564901openalex-snapshot
Optimal tiling for the RNA base pairing problem
inferred← citeshttps://doi.org/10.5555/520793.825729openalex-snapshot
On index set splitting
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.