On the public citation graph
Dataflow analysis of array and scalar references
0 signed · 530 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/bf01379099openalex-snapshot
Data dependence and its application to parallel processing
inferredcites →https://doi.org/10.1016/0743-7315(91)90016-3openalex-snapshot
From control flow to dataflow
inferredcites →https://doi.org/10.1051/ro/1988220302431openalex-snapshot
Parametric integer programming
inferredcites →https://doi.org/10.1145/109025.109108openalex-snapshot
Uniform techniques for loop optimization
inferredcites →https://doi.org/10.1145/109625.109630openalex-snapshot
A unified framework for systematic loop transformations
inferredcites →https://doi.org/10.1145/1468075.1468134openalex-snapshot
A language design for concurrent processes
inferredcites →https://doi.org/10.1145/29873.29875openalex-snapshot
Automatic translation of FORTRAN programs to vector form
inferredcites →https://doi.org/10.1145/318789.318810openalex-snapshot
A unified semantic approach for the vectorization and parallelization of generalized reductions
inferredcites →https://doi.org/10.1145/321992.321999openalex-snapshot
An Algorithm for Structuring Flowgraphs
inferredcites →https://doi.org/10.1145/360827.360844openalex-snapshot
The parallel execution of DO loops
inferredcites →https://doi.org/10.1145/55364.55404openalex-snapshot
The importance of direct dependences for automatic parallelization
inferredcites →https://doi.org/10.1145/75277.75280openalex-snapshot
An efficient method of computing static single assignment form
inferredcites →https://doi.org/10.1145/7902.7904openalex-snapshot
Advanced compiler optimizations for supercomputers
inferredcites →https://doi.org/10.1145/859463.859468openalex-snapshot
Book review of The structure of computers and computations
inferredcites →https://doi.org/10.21236/ada043451openalex-snapshot
Verification Decidability of Presburger Array Programs.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1096-9128(200002/03)12:2/3<125::aid-cpe469>3.0.co;2-hopenalex-snapshot
A simple framework to calculate the reaching definition of array references and its use in subscript array analysis
inferred← citeshttps://doi.org/10.1002/cpe.3501openalex-snapshot
Type‐driven data layouts for improved vectorisation
inferred← citeshttps://doi.org/10.1002/cpe.772openalex-snapshot
Space–time mapping and tiling: a helpful combination
inferred← citeshttps://doi.org/10.1002/cpe.780openalex-snapshot
On the optimality of Feautrier's scheduling algorithm
inferred← citeshttps://doi.org/10.1006/jcss.2001.1756openalex-snapshot
The Combinatorics of Cache Misses during Matrix Multiplication
inferred← citeshttps://doi.org/10.1006/jpdc.1999.1566openalex-snapshot
Compact DAG Representation and Its Dynamic Scheduling
inferred← citeshttps://doi.org/10.1006/jpdc.2001.1815openalex-snapshot
Integrating Loop and Data Transformations for Global Optimization
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/11558958_28openalex-snapshot
A Matrix-Type for Performance–Portability
inferred← citeshttps://doi.org/10.1007/11575771_51openalex-snapshot
Automatic Introduction of Mobility for Standard-Based Frameworks
inferred← citeshttps://doi.org/10.1007/11576235_28openalex-snapshot
Aggressive Loop Fusion for Improving Locality and Parallelism
inferred← citeshttps://doi.org/10.1007/11596110_2openalex-snapshot
Forward Communication Only Placements and Their Use for Parallel Program Construction
inferred← citeshttps://doi.org/10.1007/11688839_16openalex-snapshot
Polyhedral Code Generation in the Real World
inferred← citeshttps://doi.org/10.1007/11758549_79openalex-snapshot
Linearity Analysis for Automatic Differentiation
inferred← citeshttps://doi.org/10.1007/11823230_11openalex-snapshot
Beyond Iteration Vectors: Instancewise Relational Abstract Domains
inferred← citeshttps://doi.org/10.1007/3-540-35767-x_27openalex-snapshot
Polynomial Time Array Dataflow Analysis
inferred← citeshttps://doi.org/10.1007/3-540-36490-0_21openalex-snapshot
Accretive Rules in Cayley P Systems
inferred← citeshttps://doi.org/10.1007/3-540-36579-6_16openalex-snapshot
Automatic Detection of Uninitialized Variables
inferred← citeshttps://doi.org/10.1007/3-540-36579-6_23openalex-snapshot
Improving Data Locality by Chunking
inferred← citeshttps://doi.org/10.1007/3-540-44905-1_18openalex-snapshot
A Precise Fixpoint Reaching Definition Analysis for Arrays
inferred← citeshttps://doi.org/10.1007/3-540-44905-1_19openalex-snapshot
Demand-Driven Interprocedural Array Property Analysis
inferred← citeshttps://doi.org/10.1007/3-540-44905-1_29openalex-snapshot
A Geometric Semantics for Program Representation in the Polytope Model
inferred← citeshttps://doi.org/10.1007/3-540-45403-9_5openalex-snapshot
Loop Parallelization Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-45403-9_7openalex-snapshot
Interprocedural Analysis Based on Guarded Array Regions
inferred← citeshttps://doi.org/10.1007/3-540-45492-6_33openalex-snapshot
High Level Software Synthesis of Affine Iterative Algorithms onto Parallel Architectures
inferred← citeshttps://doi.org/10.1007/3-540-45574-4_24openalex-snapshot
Issues of the Automatic Generation of HPF Loop Programs
inferred← citeshttps://doi.org/10.1007/3-540-45574-4_7openalex-snapshot
Extending Scalar Optimizations for Arrays
inferred← citeshttps://doi.org/10.1007/3-540-45706-2_39openalex-snapshot
On the Optimality of Feautrier’s Scheduling Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-45706-2_40openalex-snapshot
On the Equivalence of Two Systems of Affine Recurrence Equations
inferred← citeshttps://doi.org/10.1007/3-540-47813-2_12openalex-snapshot
Storage Size Reduction by In-place Mapping of Arrays
inferred← citeshttps://doi.org/10.1007/3-540-48311-x_49openalex-snapshot
Storage Mapping Optimization for Parallel Programs
inferred← citeshttps://doi.org/10.1007/3-540-48319-5_22openalex-snapshot
The Advantages of Instance-Wise Reaching Definition Analyses in Array (S)SA
inferred← citeshttps://doi.org/10.1007/3-540-56891-3_11openalex-snapshot
Detection of recurrences in sequential programs with loops
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_28openalex-snapshot
Loop parallelization in the polytope model
inferred← citeshttps://doi.org/10.1007/3-540-57502-2_63openalex-snapshot
Data dependence and data-flow analysis of arrays
inferred← citeshttps://doi.org/10.1007/3-540-57659-2_15openalex-snapshot
An overview of a compiler for scalable parallel machines
inferred← citeshttps://doi.org/10.1007/3-540-57659-2_31openalex-snapshot
An exact method for analysis of value-based array data dependences
inferred← citeshttps://doi.org/10.1007/3-540-57877-3_21openalex-snapshot
Supporting array dependence testing for an optimizing/parallelizing C compiler
inferred← citeshttps://doi.org/10.1007/3-540-57981-8_159openalex-snapshot
Parallelizing compilers: what can be achieved?
inferred← citeshttps://doi.org/10.1007/3-540-58430-7_60openalex-snapshot
Optimizing communications by using compile time analysis
inferred← citeshttps://doi.org/10.1007/3-540-61626-8_50openalex-snapshot
On the optimality of Allen and Kennedy's algorithm for parallelism extraction in nested loops
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/3-540-61626-8_54openalex-snapshot
Array dataflow analysis for explicitly parallel programs
inferred← citeshttps://doi.org/10.1007/3-540-61626-8_56openalex-snapshot
Applications of Fuzzy Array Dataflow Analysis
inferred← citeshttps://doi.org/10.1007/3-540-61626-8_63openalex-snapshot
Efficient mapping of interdependent scans
inferred← citeshttps://doi.org/10.1007/3-540-61736-1_44openalex-snapshot
Automatic parallelization in the polytope model
inferred← citeshttps://doi.org/10.1007/3-540-62598-4_136openalex-snapshot
The V-Ray technology of optimizing programs to parallel computers
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-0-387-35520-7_7openalex-snapshot
A Step Toward Automatic Distribution of Java Programs
inferred← citeshttps://doi.org/10.1007/978-1-4020-8588-8_12openalex-snapshot
High-Level Synthesis of Loops Using the Polyhedral Model
inferred← citeshttps://doi.org/10.1007/978-1-4419-6345-1_33openalex-snapshot
Polyhedral Process Networks
inferred← citeshttps://doi.org/10.1007/978-1-4612-1516-5_8openalex-snapshot
Mathematical Tools for Loop Transformations: From Systems of Uniform Recurrence Equations to the Polytope Model
inferred← citeshttps://doi.org/10.1007/978-1-4614-6859-2_41openalex-snapshot
Polyhedral Process Networks
inferred← citeshttps://doi.org/10.1007/978-1-4615-3242-2_4openalex-snapshot
HIFI: From Parallel Algorithm to Fixed-Size VLSI Processor Array
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-1-4757-9805-0_22openalex-snapshot
A Design System for Massively Parallel Hardware
inferred← citeshttps://doi.org/10.1007/978-3-030-20656-7_13openalex-snapshot
Performance Exploration Through Optimistic Static Program Annotations
inferred← citeshttps://doi.org/10.1007/978-3-030-29400-7_3openalex-snapshot
Multi-valued Expression Analysis for Collective Checking
inferred← citeshttps://doi.org/10.1007/978-3-030-34968-4_5openalex-snapshot
A Program Logic for Dependence Analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-60026-6_16openalex-snapshot
Complexity Estimates for Fourier-Motzkin Elimination
inferred← citeshttps://doi.org/10.1007/978-3-030-91014-3_12openalex-snapshot
Separating Map Variables in a Logic-Based Intermediate Verification Language
inferred← citeshttps://doi.org/10.1007/978-3-032-22749-2_12openalex-snapshot
Data Structure Analysis for Binaries
inferred← citeshttps://doi.org/10.1007/978-3-032-23604-3_3openalex-snapshot
EvoTADASHI: Genetic Programming for High-Performance Code Optimization
inferred← citeshttps://doi.org/10.1007/978-3-0348-8534-8_6openalex-snapshot
Symbolic Array Data Flow Analysis and Pattern Recognition in Numerical Codes
inferred← citeshttps://doi.org/10.1007/978-3-319-10936-7_11openalex-snapshot
On Program Equivalence with Reductions
inferred← citeshttps://doi.org/10.1007/978-3-319-73909-0_2openalex-snapshot
Fundamentals and Compiler Framework
inferred← citeshttps://doi.org/10.1007/978-3-540-24644-2_15openalex-snapshot
Index-Association Based Dependence Analysis and its Application in Automatic Parallelization
inferred← citeshttps://doi.org/10.1007/978-3-540-27776-7_51openalex-snapshot
Communication Optimization in Compaan Process Networks
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-540-45209-6_45openalex-snapshot
Replicated Placements in the Polyhedron Model
inferred← citeshttps://doi.org/10.1007/978-3-540-69330-7_27openalex-snapshot
Scalable Array SSA and Array Data Flow Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-70550-5_21openalex-snapshot
High Level Loop Transformations for Systematic Signal Processing Embedded Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-72521-3_11openalex-snapshot
On Control Signals for Multi-Dimensional Time
inferred← citeshttps://doi.org/10.1007/978-3-540-72521-3_14openalex-snapshot
Iterative Compilation with Kernel Exploration
inferred← citeshttps://doi.org/10.1007/978-3-540-78791-4_9openalex-snapshot
Automatic Transformations for Communication-Minimized Parallelization and Locality Optimization in the Polyhedral Model
inferred← citeshttps://doi.org/10.1007/978-3-642-02658-4_44openalex-snapshot
Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences
inferred← citeshttps://doi.org/10.1007/978-3-642-03138-0_21openalex-snapshot
Constraint-Driven Identification of Application Specific Instructions in the DURASE System
inferred← citeshttps://doi.org/10.1007/978-3-642-11970-5_14openalex-snapshot
Automatic C-to-CUDA Code Generation for Affine Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-11970-5_16openalex-snapshot
The Polyhedral Model Is More Widely Applicable Than You Think
inferred← citeshttps://doi.org/10.1007/978-3-642-15582-6_49openalex-snapshot
isl: An Integer Set Library for the Polyhedral Model
inferred← citeshttps://doi.org/10.1007/978-3-642-21487-5_4openalex-snapshot
ompVerify: Polyhedral Analysis for the OpenMP Programmer
inferred← citeshttps://doi.org/10.1007/978-3-642-32820-6_25openalex-snapshot
From Serial Loops to Parallel Execution on Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-32820-6_60openalex-snapshot
Folding of Tagged Single Assignment Values for Memory-Efficient Parallelism
inferred← citeshttps://doi.org/10.1007/978-3-642-36036-7_5openalex-snapshot
A Hybrid Approach to Proving Memory Reference Monotonicity
inferred← citeshttps://doi.org/10.1007/978-3-642-37658-0_2openalex-snapshot
AlphaZ: A System for Design Space Exploration in the Polyhedral Model
inferred← citeshttps://doi.org/10.1007/978-3-642-45293-2_14openalex-snapshot
Automatic Skeleton-Based Compilation through Integration with an Algorithm Classification
inferred← citeshttps://doi.org/10.1007/978-94-011-5514-4_15openalex-snapshot
Automatic Coarse-Grained Parallelization Techniques
inferred← citeshttps://doi.org/10.1007/978-94-017-7267-9_30openalex-snapshot
DAEDALUS: System-Level Design Methodology for Streaming Multiprocessor Embedded Systems on Chips
inferred← citeshttps://doi.org/10.1007/978-94-017-7358-4_30-1openalex-snapshot
Daedalus: System-Level Design Methodology for Streaming Multiprocessor Embedded Systems on Chips
inferred← citeshttps://doi.org/10.1007/978-981-16-1483-5_9openalex-snapshot
Automatic Parallelization of Affine Programs for Distributed Memory Systems
inferred← citeshttps://doi.org/10.1007/bf01379404openalex-snapshot
Some efficient solutions to the affine scheduling problem. Part II. Multidimensional time
inferred← citeshttps://doi.org/10.1007/bf01407835openalex-snapshot
Some efficient solutions to the affine scheduling problem. I. One-dimensional time
inferred← citeshttps://doi.org/10.1007/bf02577770openalex-snapshot
Detecting value-based scalar dependence
inferred← citeshttps://doi.org/10.1007/bf02577771openalex-snapshot
Minimal data dependence abstractions for loop transformations: Extended version
inferred← citeshttps://doi.org/10.1007/bf02577789openalex-snapshot
Automatic parallelization ofwhile-loops using speculative execution
inferred← citeshttps://doi.org/10.1007/bf03356758openalex-snapshot
Interprocedural Array Region Analyses
inferred← citeshttps://doi.org/10.1007/bfb0002713openalex-snapshot
Basis of parallel speculative execution
inferred← citeshttps://doi.org/10.1007/bfb0002757openalex-snapshot
Optimizing storage size for static control programs in automatic parallelizers
inferred← citeshttps://doi.org/10.1007/bfb0014191openalex-snapshot
Interprocedural array region analyses
inferred← citeshttps://doi.org/10.1007/bfb0014194openalex-snapshot
An interprocedural parallelizing compiler and its support for memory hierarchy research
inferred← citeshttps://doi.org/10.1007/bfb0017247openalex-snapshot
Exact versus approximate array region analyses
inferred← citeshttps://doi.org/10.1007/bfb0017283openalex-snapshot
The loop parallelizer LooPo—announcement
inferred← citeshttps://doi.org/10.1007/bfb0020475openalex-snapshot
Implementing flexible computation rules with subexpression-level loop transformations
inferred← citeshttps://doi.org/10.1007/bfb0024706openalex-snapshot
Multidimensional periodic scheduling model and complexity
inferred← citeshttps://doi.org/10.1007/bfb0025867openalex-snapshot
Fine-grain scheduling under resource constraints
inferred← citeshttps://doi.org/10.1007/bfb0025874openalex-snapshot
Finding legal reordering transformations using mappings
inferred← citeshttps://doi.org/10.1007/bfb0025879openalex-snapshot
Detecting value-based scalar dependence
inferred← citeshttps://doi.org/10.1007/bfb0025880openalex-snapshot
Minimal data dependence abstractions for loop transformations
inferred← citeshttps://doi.org/10.1007/bfb0097989openalex-snapshot
A simple framework to calculate the reaching definition of array references and its use in subscript array analysis
inferred← citeshttps://doi.org/10.1007/s00165-005-0061-1openalex-snapshot
Not necessarily closed convex polyhedra and the double description method
inferred← citeshttps://doi.org/10.1007/s10766-006-0011-4openalex-snapshot
Scalable and Structured Scheduling
inferred← citeshttps://doi.org/10.1007/s10766-006-0012-3openalex-snapshot
Semi-Automatic Composition of Loop Transformations for Deep Parallelism and Memory Hierarchies
inferred← citeshttps://doi.org/10.1007/s10766-013-0248-7openalex-snapshot
A Case Study of Implementing Supernode Transformations
inferred← citeshttps://doi.org/10.1007/s10766-015-0380-7openalex-snapshot
Memory Partitioning in the Limit
inferred← citeshttps://doi.org/10.1007/s10766-016-0428-3openalex-snapshot
Combining Data and Computation Distribution Directives for Hybrid Parallel Programming : A Transformation System
inferred← citeshttps://doi.org/10.1007/s10766-016-0467-9openalex-snapshot
Synchronization Validation for Cross-Thread Dependences in Parallel Programs
inferred← citeshttps://doi.org/10.1007/s10766-016-0477-7openalex-snapshot
Maximizing Communication–Computation Overlap Through Automatic Parallelization and Run-time Tuning of Non-blocking Collective Operations
inferred← citeshttps://doi.org/10.1007/s10766-021-00694-2openalex-snapshot
Monoparametric Tiling of Polyhedral Programs
inferred← citeshttps://doi.org/10.1007/s10836-009-5140-4openalex-snapshot
Experience with Widening Based Equivalence Checking in Realistic Multimedia Systems
inferred← citeshttps://doi.org/10.1007/s11227-007-0124-6openalex-snapshot
Improving the parallelism of iterative methods by aggressive loop fusion
inferred← citeshttps://doi.org/10.1007/s11227-014-1105-1openalex-snapshot
Performance-aware composition framework for GPU-based systems
inferred← citeshttps://doi.org/10.1007/s11227-021-03835-zopenalex-snapshot
Revisiting split tiling for stencil computations in polyhedral compilation
inferred← citeshttps://doi.org/10.1007/s11265-008-0244-0openalex-snapshot
Storage Estimation and Design Space Exploration Methodologies for the Memory Management of Signal Processing Applications
inferred← citeshttps://doi.org/10.1007/s11265-008-0296-1openalex-snapshot
Design and Tool Flow of Multimedia MPSoC Platforms
inferred← citeshttps://doi.org/10.1007/s41060-024-00554-5openalex-snapshot
Clustering source code from automated assessment of programming assignments
inferred← citeshttps://doi.org/10.1016/0165-6074(92)90355-bopenalex-snapshot
Data layouts impacts on the compilation of the communications for a synchronous MSIMD machine
inferred← citeshttps://doi.org/10.1016/0165-6074(95)00025-jopenalex-snapshot
Compiling for massively parallel architectures: a perspective
inferred← citeshttps://doi.org/10.1016/0167-8191(94)90001-9openalex-snapshot
Mapping uniform loop nests onto distributed memory architectures
inferred← citeshttps://doi.org/10.1016/0167-9260(95)00018-6openalex-snapshot
Communication code generation in systems of affine recurrence equations
inferred← citeshttps://doi.org/10.1016/b978-044482106-5/50023-5openalex-snapshot
Compiling for Massively Parallel Architectures
inferred← citeshttps://doi.org/10.1016/b978-044482106-5/50024-7openalex-snapshot
DIV, FLOOR, CEIL, MOD and STEP Functions in Nested Loop Programs and Linearly Bounded Lattices
inferred← citeshttps://doi.org/10.1016/b978-044482106-5/50029-6openalex-snapshot
On Factors Limiting the Generation of Efficient Compiler-Parallelized Programs
inferred← citeshttps://doi.org/10.1016/j.cl.2018.05.003openalex-snapshot
Coding Ants: Optimization of GPU code using ant colony optimization
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/j.jsc.2005.09.012openalex-snapshot
Quantifier elimination in automatic loop parallelization
inferred← citeshttps://doi.org/10.1016/j.jsc.2025.102527openalex-snapshot
Efficient detection of redundancies in systems of linear inequalities
inferred← citeshttps://doi.org/10.1016/j.parco.2016.02.004openalex-snapshot
An approach for code generation in the Sparse Polyhedral Framework
inferred← citeshttps://doi.org/10.1016/j.procs.2010.04.232openalex-snapshot
FADAlib: an open source C++ library for fuzzy array dataflow analysis
inferred← citeshttps://doi.org/10.1016/j.procs.2014.05.115openalex-snapshot
Optimizing Dynamic Resource Allocation
inferred← citeshttps://doi.org/10.1016/j.sysarc.2010.06.007openalex-snapshot
Hardware/software support for adaptive work-stealing in on-chip multiprocessor
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.12.001openalex-snapshot
Incremental Closure for Systems of Two Variables Per Inequality
inferred← citeshttps://doi.org/10.1016/s0010-4655(01)00234-xopenalex-snapshot
Automatic implementation of affine iterative algorithms: Design flow and communication synthesis
inferred← citeshttps://doi.org/10.1016/s0166-218x(98)00112-7openalex-snapshot
The complexity of multidimensional periodic scheduling
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/s0167-8191(96)00052-xopenalex-snapshot
A note on compiling FORTRAN loop kernels onto a dataflow architecture
inferred← citeshttps://doi.org/10.1016/s0167-8191(96)00063-4openalex-snapshot
Unimodular transformations of non-perfectly nested loops
inferred← citeshttps://doi.org/10.1016/s0167-8191(96)00103-2openalex-snapshot
Which approach to parallelizing scientific codes — That is the question
inferred← citeshttps://doi.org/10.1016/s0167-8191(96)00108-1openalex-snapshot
Plugging anti and output dependence removal techniques into loop parallelization algorithm
inferred← citeshttps://doi.org/10.1016/s0167-8191(98)00020-9openalex-snapshot
Loop parallelization algorithms: From parallelism extraction to code generation
inferred← citeshttps://doi.org/10.1016/s0167-8191(98)00029-5openalex-snapshot
Automatic storage management for parallel programs
inferred← citeshttps://doi.org/10.1016/s0167-8191(99)00063-0openalex-snapshot
Termination detection in parallel loop nests with while loops
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80397-9openalex-snapshot
Geometric Model Checking
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)82599-xopenalex-snapshot
On the Recognition of Algorithm Templates
inferred← citeshttps://doi.org/10.1023/a:1007554627716openalex-snapshot
Generation of Efficient Nested Loops from Polyhedra
inferred← citeshttps://doi.org/10.1023/a:1008069920230openalex-snapshot
Parametric Analysis of Polyhedral Iteration Spaces
inferred← citeshttps://doi.org/10.1023/a:1018790129478openalex-snapshot
On the Removal of Anti- and Output-Dependences
inferred← citeshttps://doi.org/10.1023/a:1025168022993openalex-snapshot
Optimal Fine and Medium Grain Parallelism Detection in Polyhedral Reduced Dependence Graphs
inferred← citeshttps://doi.org/10.1080/01495739708941417openalex-snapshot
ON THE OPTIMALITY OF ALLEN AND KENNEDY'S ALGORITHM FOR PARALLELISM EXTRACTION IN NESTED LOOPS
inferred← citeshttps://doi.org/10.1109/32.842950openalex-snapshot
Efficient interprocedural array data-flow analysis for automatic program parallelization
inferred← citeshttps://doi.org/10.1109/43.543768openalex-snapshot
Elimination of redundant memory traffic in high-level synthesis
inferred← citeshttps://doi.org/10.1109/43.739055openalex-snapshot
Hierarchical algorithm partitioning at system level for an improved utilization of memory structures
inferred← citeshttps://doi.org/10.1109/43.952736openalex-snapshot
A two-stage solution approach to multidimensional periodic scheduling
inferred← citeshttps://doi.org/10.1109/71.342135openalex-snapshot
Going beyond integer programming with the Omega test to eliminate false data dependences
inferred← citeshttps://doi.org/10.1109/71.372771openalex-snapshot
Advanced array optimizations for high performance functional languages
inferred← citeshttps://doi.org/10.1109/71.544355openalex-snapshot
A framework for resource-constrained rate-optimal software pipelining
inferred← citeshttps://doi.org/10.1109/71.879772openalex-snapshot
Compiler analysis for cache coherence: interprocedural array data-flow analysis and its impact on cache performance
inferred← citeshttps://doi.org/10.1109/76.728414openalex-snapshot
Program transformation strategies for memory size and power reduction of pseudoregular multimedia subsystems
inferred← citeshttps://doi.org/10.1109/92.238445openalex-snapshot
Modeling multidimensional data and control flow
inferred← citeshttps://doi.org/10.1109/92.386218openalex-snapshot
Background memory area estimation for multidimensional signal processing systems
inferred← citeshttps://doi.org/10.1109/asap.1993.397162openalex-snapshot
An algorithm for accurate data dependence test
inferred← citeshttps://doi.org/10.1109/asap.1995.522900openalex-snapshot
The naive execution of affine recurrence equations
inferred← citeshttps://doi.org/10.1109/asap.1996.542829openalex-snapshot
On the removal of anti and output dependences
inferred← citeshttps://doi.org/10.1109/asap.2003.1212831openalex-snapshot
Storage management in process networks using the lexicographically maximal preimage
inferred← citeshttps://doi.org/10.1109/asap.2006.42openalex-snapshot
Loop Transformation Methodologies for Array-Oriented Memory Management
inferred← citeshttps://doi.org/10.1109/asap.2008.4580188openalex-snapshot
Loop-oriented metrics for exploring an application-specific architecture design-space
inferred← citeshttps://doi.org/10.1109/asap.2009.19openalex-snapshot
Constraint-Driven Instructions Selection and Application Scheduling in the DURASE system
inferred← citeshttps://doi.org/10.1109/asap.2016.7760773openalex-snapshot
Modulo scheduling of symbolically tiled loops for tightly coupled processor arrays
inferred← citeshttps://doi.org/10.1109/asicon.2015.7517168openalex-snapshot
An automatic translation and parallelization system for general purpose reconfigurable processor
inferred← citeshttps://doi.org/10.1109/cahpc.2018.8645947openalex-snapshot
Polyhedral Dataflow Programming: A Case Study
inferred← citeshttps://doi.org/10.1109/cgo.2007.22openalex-snapshot
Loop Optimization using Hierarchical Compilation and Kernel Decomposition
inferred← citeshttps://doi.org/10.1109/cgo.2015.7054183openalex-snapshot
Characterizing and enhancing global memory data coalescing on GPUs
inferred← citeshttps://doi.org/10.1109/cgo.2015.7054201openalex-snapshot
Scalable conditional induction variables (CIV) analysis
inferred← citeshttps://doi.org/10.1109/cgo.2017.7863747openalex-snapshot
Parallel associative reductions in Halide
inferred← citeshttps://doi.org/10.1109/cgo.2017.7863748openalex-snapshot
Optimistic loop optimization
inferred← citeshttps://doi.org/10.1109/cgo.2019.8661188openalex-snapshot
Kernel Fusion/Decomposition for Automatic GPU-Offloading
inferred← citeshttps://doi.org/10.1109/cgo.2019.8661197openalex-snapshot
Tiramisu: A Polyhedral Compiler for Expressing Fast and Portable Code
inferred← citeshttps://doi.org/10.1109/cluster49012.2020.00044openalex-snapshot
Efficient Execution of Dynamic Programming Algorithms on Apache Spark
showing the first 200 of 510 · page through all 510
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.