On the public citation graph

Independent partitioning of algorithms with uniform dependencies

0 signed · 75 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.1016/0024-3795(81)90106-3openalex-snapshot
Linear algebra and its applications
inferredcites →https://doi.org/10.1016/0141-9331(85)90187-5openalex-snapshot
Computer architecture and parallel processing
inferredcites →https://doi.org/10.1057/jors.1987.94openalex-snapshot
Theory of Linear and Integer Programming
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/12.90251openalex-snapshot
Time optimal linear schedules for algorithms with uniform dependencies
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/mc.1985.1662920openalex-snapshot
Essential Issues in Multiprocessor Systems
inferredcites →https://doi.org/10.1109/proc.1983.12532openalex-snapshot
On the design of algorithms for VLSI systolic arrays
inferredcites →https://doi.org/10.1109/tc.1979.1675434openalex-snapshot
Time and Parallel Processor Bounds for Fortran-Like Loops
inferredcites →https://doi.org/10.1109/tc.1980.1675676openalex-snapshot
High-Speed Multiprocessors and Compilation Techniques
inferredcites →https://doi.org/10.1109/tc.1986.1676652openalex-snapshot
Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
inferredcites →https://doi.org/10.1112/blms/2.3.373bopenalex-snapshot
DIOPHANTINE EQUATIONS
inferredcites →https://doi.org/10.1126/science.231.4741.967openalex-snapshot
Parallel Supercomputing Today and the Cedar Approach
inferredcites →https://doi.org/10.1137/0208040openalex-snapshot
Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
inferredcites →https://doi.org/10.1145/321406.321418openalex-snapshot
The Organization of Computations for Uniform Recurrence Equations
inferredcites →https://doi.org/10.1145/3392717.3400034openalex-snapshot
Optimizing supercompilers for supercomputers
inferredcites →https://doi.org/10.2307/1967777openalex-snapshot
On Matrices Whose Elements Are Integers
inferredcites →https://doi.org/10.2307/253980openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.25549/usctheses-c30-499818openalex-snapshot
Algorithm transformations for parallel processing and VLSI architecture design

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.1996.0021openalex-snapshot
Designing Lower-Dimensional Regular Arrays for Algorithms with Uniform Dependencies
inferred← citeshttps://doi.org/10.1006/jpdc.1996.0075openalex-snapshot
Tiling Nested Loops into Maximal Rectangular Blocks
inferred← citeshttps://doi.org/10.1007/978-1-4615-3242-2_5openalex-snapshot
On the Design of Two-Level Pipelined Processor Arrays
inferred← citeshttps://doi.org/10.1007/bf01245404openalex-snapshot
Partitioning and mapping of nested loops for linear array multicomputers
inferred← citeshttps://doi.org/10.1007/bf02427795openalex-snapshot
On the optimality of linear schedules
inferred← citeshttps://doi.org/10.1007/bfb0027118openalex-snapshot
Automatic synthesis of parallel algorithms
inferred← citeshttps://doi.org/10.1007/bfb0038672openalex-snapshot
Balanced loop partitioning using GTS
inferred← citeshttps://doi.org/10.1007/bfb0100469openalex-snapshot
Large neural net simulation under Beowulf-like systems
inferred← citeshttps://doi.org/10.1007/s10559-006-0066-7openalex-snapshot
Optimization of data exchange in parallel computers with distributed memory
inferred← citeshttps://doi.org/10.1007/s10559-012-9382-2openalex-snapshot
Parallelization of sequential programs: distribution of arrays among processors and structurization of communications
inferred← citeshttps://doi.org/10.1016/j.parco.2006.07.003openalex-snapshot
Message-passing code generation for non-rectangular tiling transformations
inferred← citeshttps://doi.org/10.1016/s0167-8191(00)00040-5openalex-snapshot
Generating efficient tiled code for distributed memory machines
inferred← citeshttps://doi.org/10.1016/s0743-7315(03)00102-3openalex-snapshot
A pipelined schedule to minimize completion time for loop tiling with computation and communication overlapping
inferred← citeshttps://doi.org/10.1023/a:1023857207116openalex-snapshot
Distribution of Operations and Data Arrays over Processors
inferred← citeshttps://doi.org/10.1023/a:1025773814022openalex-snapshot
Mapping of Affine Loop Nests onto Independent Processors
inferred← citeshttps://doi.org/10.1080/01495730008947351openalex-snapshot
SYSTEMATIC SYNTHESIS OF PARALLEL ARCHITECTURES FOR THE REAL-TIME ESTIMATION OF HIGHER ORDER STATISTICAL MOMENTS
inferred← citeshttps://doi.org/10.1080/10637199708915616openalex-snapshot
LOWER TIME AND PROCESSOR BOUNDS FOR EFFICIENT MAPPING OF UNIFORM DEPENDENCE ALGORITHMS INTO SYSTOLIC ARRAYS
inferred← citeshttps://doi.org/10.1109/12.30873openalex-snapshot
Minimum distance: a method for partitioning recurrences for multiprocessors
inferred← citeshttps://doi.org/10.1109/12.508321openalex-snapshot
On uniformization of affine dependence algorithms
inferred← citeshttps://doi.org/10.1109/12.663767openalex-snapshot
An approach to designing modular extensible linear arrays for regular algorithms
inferred← citeshttps://doi.org/10.1109/12.90251openalex-snapshot
Time optimal linear schedules for algorithms with uniform dependencies
inferred← citeshttps://doi.org/10.1109/71.149964openalex-snapshot
Partitioning and labeling of loops by unimodular transformations
inferred← citeshttps://doi.org/10.1109/71.265946openalex-snapshot
On loop transformations for generalized cycle shrinking
inferred← citeshttps://doi.org/10.1109/71.388049openalex-snapshot
Optimal scheduling of compute-intensive tasks on a network of workstations
inferred← citeshttps://doi.org/10.1109/71.532109openalex-snapshot
Computing programs containing band linear recurrences on vector supercomputers
inferred← citeshttps://doi.org/10.1109/71.679213openalex-snapshot
On supernode transformation with minimized total running time
inferred← citeshttps://doi.org/10.1109/71.80124openalex-snapshot
On mapping systolic algorithms onto the hypercube
inferred← citeshttps://doi.org/10.1109/71.80125openalex-snapshot
Mapping nested loop algorithms into multidimensional systolic arrays
inferred← citeshttps://doi.org/10.1109/71.80162openalex-snapshot
An empirical study of Fortran programs for parallelizing compilers
inferred← citeshttps://doi.org/10.1109/71.86107openalex-snapshot
Compile-time partitioning of iterative parallel loops to reduce cache coherency traffic
inferred← citeshttps://doi.org/10.1109/71.879777openalex-snapshot
Chain grouping: a method for partitioning loops onto mesh-connected processor arrays
inferred← citeshttps://doi.org/10.1109/71.97900openalex-snapshot
Partitioning and mapping nested loops on multiprocessor systems
inferred← citeshttps://doi.org/10.1109/82.625008openalex-snapshot
Minimization of memory access overhead for multidimensional DSP applications via multilevel partitioning and scheduling
inferred← citeshttps://doi.org/10.1109/asap.1996.544416openalex-snapshot
On supernode transformation with minimized total running time
inferred← citeshttps://doi.org/10.1109/asap.2005.38openalex-snapshot
Hardware/Software Interface for Multi-Dimensional Processor Arrays
inferred← citeshttps://doi.org/10.1109/empdp.1996.500615openalex-snapshot
Loop parallelization: revisiting framework of unimodular transformations
inferred← citeshttps://doi.org/10.1109/icpads.1997.652527openalex-snapshot
Mapping nested loops onto distributed memory multiprocessors
inferred← citeshttps://doi.org/10.1109/icpp.1993.107openalex-snapshot
Iteration Partitioning for Resolving Stride Conflicts on Cache-Coherent Multiprocessors
inferred← citeshttps://doi.org/10.1109/icpp.1996.538556openalex-snapshot
On optimal size and shape of supernode transformations
inferred← citeshttps://doi.org/10.1109/ipdps.2001.924976openalex-snapshot
Minimizing completion time for loop tiling with computation and communication overlapping
inferred← citeshttps://doi.org/10.1109/ipps.1993.262775openalex-snapshot
Transformation of Doacross loops on distributed memory systems
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/ipps.1995.395937openalex-snapshot
Statement-level independent partitioning of uniform recurrences
inferred← citeshttps://doi.org/10.1109/pact.1997.644018openalex-snapshot
Two techniques for static array partitioning on message-passing parallel machines
inferred← citeshttps://doi.org/10.1109/spdp.1992.242753openalex-snapshot
On uniformization of affine dependence algorithms
inferred← citeshttps://doi.org/10.1109/tpds.2002.1158261openalex-snapshot
On time optimal supernode shape
inferred← citeshttps://doi.org/10.1109/tpds.2003.1239870openalex-snapshot
An efficient code generation technique for tiled iteration spaces
inferred← citeshttps://doi.org/10.1134/s1064226917120105openalex-snapshot
On Balanced Clustering (Indices, Models, Examples)
inferred← citeshttps://doi.org/10.1142/9789812793928_0008openalex-snapshot
A SYSTOLIC APPROACH TO LOOP PARTITIONING AND MAPPING INTO FIXED SIZE DISTRIBUTED MEMORY ARCHITECTURES
inferred← citeshttps://doi.org/10.1145/181181.181349openalex-snapshot
Compiler techniques for maximizing fine-grain and coarse-grain parallelism in loops with uniform dependences
inferred← citeshttps://doi.org/10.1145/3446804.3446847openalex-snapshot
Data-aware process networks
inferred← citeshttps://doi.org/10.1201/9781420028683.ch12openalex-snapshot
A Modular VLSI Architecture for the Real- Time Estimation of Higher Order Moments and Cumulants
inferred← citeshttps://doi.org/10.15760/etd.6303openalex-snapshot
Multiplexed pipelining : a cost effective loop transformation technique
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.1407openalex-snapshot
Compiler Optimization Techniques for Scheduling and Reducing Overhead
showing the first 54 of 55 · page through all 55
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.