On the public citation graph
Some efficient solutions to the affine scheduling problem. Part II. Multidimensional time
0 signed · 348 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/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.1016/0167-8191(90)90055-eopenalex-snapshot
Optimal code parallelization using unimodular transformations
inferredcites →https://doi.org/10.1051/ro/1988220302431openalex-snapshot
Parametric integer programming
inferredcites →https://doi.org/10.1057/jors.1987.94openalex-snapshot
Theory of Linear and Integer Programming
inferredcites →https://doi.org/10.1109/71.97902openalex-snapshot
A loop transformation theory and an algorithm to maximize parallelism
inferredcites →https://doi.org/10.1145/109625.109631openalex-snapshot
Scanning polyhedra with DO loops
inferredcites →https://doi.org/10.1145/109626.109631openalex-snapshot
Scanning polyhedra with DO loops
inferredcites →https://doi.org/10.1145/29873.29875openalex-snapshot
Automatic translation of FORTRAN programs to vector form
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.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/jpdc.1996.0139openalex-snapshot
Compiling Affine Nested Loops: How to Optimize the Residual Communications after the Alignment Phase
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/0-387-28487-7_5openalex-snapshot
Back-Propagation Algorithm Achieving 5 Gops on the Virtex-E
inferred← citeshttps://doi.org/10.1007/11688839_16openalex-snapshot
Polyhedral Code Generation in the Real World
inferred← citeshttps://doi.org/10.1007/11823230_11openalex-snapshot
Beyond Iteration Vectors: Instancewise Relational Abstract Domains
inferred← citeshttps://doi.org/10.1007/3-540-44520-x_52openalex-snapshot
Scheduling the Computations of a Loop Nest with Respect to a Given Mapping
inferred← citeshttps://doi.org/10.1007/3-540-44842-x_93openalex-snapshot
Finding Coarse Grained Parallelism in Computational Geometry Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-44862-4_100openalex-snapshot
Finding Synchronization-Free Parallelism for Non-uniform Loops
inferred← citeshttps://doi.org/10.1007/3-540-45403-9_10openalex-snapshot
Communication-Free Partitioning of Nested Loops
inferred← citeshttps://doi.org/10.1007/3-540-45403-9_5openalex-snapshot
Loop Parallelization Algorithms
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-45578-7_57openalex-snapshot
A Constraint Optimization Framework for Mapping a Digital Signal Processing Application onto a Parallel Architecture
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-45841-7_14openalex-snapshot
Complexity of Multi-dimensional Loop Alignment
inferred← citeshttps://doi.org/10.1007/3-540-45874-3_7openalex-snapshot
Structured Scheduling of Recurrence Equations: Theory and Practice
inferred← citeshttps://doi.org/10.1007/3-540-48051-x_39openalex-snapshot
A Technique for Parallel Loop Execution
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-48311-x_53openalex-snapshot
Scheduling Structured Systems
inferred← citeshttps://doi.org/10.1007/3-540-48387-x_10openalex-snapshot
Two-Dimensional Scheduling of Algorithms with Uniform Dependencies
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-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_64openalex-snapshot
Classifying loops for space-time mapping
inferred← citeshttps://doi.org/10.1007/3-540-61736-1_44openalex-snapshot
Automatic parallelization in the polytope model
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-3-030-03314-9_11openalex-snapshot
Transitive Closure Based Schedule of Loop Nest Statement Instances
inferred← citeshttps://doi.org/10.1007/978-3-030-27562-4_19openalex-snapshot
Modeling Nested for Loops with Explicit Parallelism in Synchronous DataFlow Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-35225-7_6openalex-snapshot
Efficient Cache Simulation for Affine Computations
inferred← citeshttps://doi.org/10.1007/978-3-030-38991-8_8openalex-snapshot
Accelerating Lattice Boltzmann Method by Fully Exposing Vectorizable Loops
inferred← citeshttps://doi.org/10.1007/978-3-030-54997-8_32openalex-snapshot
Fkcc: The Farkas Calculator
inferred← citeshttps://doi.org/10.1007/978-3-030-72789-5_8openalex-snapshot
Abstractions for Polyhedral Topology-Aware Tasking [Position Paper]
inferred← citeshttps://doi.org/10.1007/978-3-030-86359-3_20openalex-snapshot
Automatic Parallel Tiled Code Generation Based on Dependence Approximation
inferred← citeshttps://doi.org/10.1007/978-3-031-64626-3_17openalex-snapshot
Verified Validation for Affine Scheduling in Polyhedral Compilation
inferred← citeshttps://doi.org/10.1007/978-3-031-97492-2_10openalex-snapshot
Verification of Concurrent Programs Using Hybrid Concrete-Symbolic Interpretation
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-319-07173-2_12openalex-snapshot
Usage of the TRACO Compiler for Neural Network Parallelization
inferred← citeshttps://doi.org/10.1007/978-3-319-09873-9_19openalex-snapshot
Switchable Scheduling for Runtime Adaptation of Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-09967-5_8openalex-snapshot
Parametric GPU Code Generation for Affine Loop Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-17473-0_11openalex-snapshot
Jagged Tiling for Intra-tile Parallelism and Fine-Grain Multithreading
inferred← citeshttps://doi.org/10.1007/978-3-319-21668-3_18openalex-snapshot
Complexity of Bradley-Manna-Sipma Lexicographic Ranking Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-23389-5_2openalex-snapshot
Many-Core Architecture for NTC: Energy Efficiency from the Ground Up
inferred← citeshttps://doi.org/10.1007/978-3-319-26408-0_14openalex-snapshot
The LEAP FPGA Operating System
inferred← citeshttps://doi.org/10.1007/978-3-319-26408-0_3openalex-snapshot
A Quick Tour of High-Level Synthesis Solutions for FPGAs
inferred← citeshttps://doi.org/10.1007/978-3-319-26408-0_7openalex-snapshot
Big Data and HPC Acceleration with Vivado HLS
inferred← citeshttps://doi.org/10.1007/978-3-319-26408-0_8openalex-snapshot
Source-to-Source Optimization for HLS
inferred← citeshttps://doi.org/10.1007/978-3-319-29778-1_4openalex-snapshot
Polyhedral Optimizations for a Data-Flow Graph Language
inferred← citeshttps://doi.org/10.1007/978-3-319-43659-3_17openalex-snapshot
Code Bones: Fast and Flexible Code Generation for Dynamic and Speculative Polyhedral Optimization
inferred← citeshttps://doi.org/10.1007/978-3-319-48429-7_28openalex-snapshot
Loop Nest Tiling for Image Processing and Communication Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-48429-7_29openalex-snapshot
Tile Merging Technique to Generate Valid Tiled Code by Means of the Transitive Closure of a Dependence Graph
inferred← citeshttps://doi.org/10.1007/978-3-540-24644-2_14openalex-snapshot
Putting Polyhedral Loop Transformations to Work
inferred← citeshttps://doi.org/10.1007/978-3-540-25935-0_5openalex-snapshot
Program Optimization in the Domain of High-Performance Parallelism
inferred← citeshttps://doi.org/10.1007/978-3-540-27776-7_45openalex-snapshot
Scalable and Modular Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-540-27866-5_38openalex-snapshot
A Polyhedral Approach to Ease the Composition of Program Transformations
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-69501-1_20openalex-snapshot
Finding Synchronization-Free Parallelism Represented with Trees of Dependent Operations
inferred← citeshttps://doi.org/10.1007/978-3-540-69848-7_69openalex-snapshot
Finding Synchronization-Free Slices of Operations in Arbitrarily Nested Loops
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-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-540-92990-1_8openalex-snapshot
Software Pipelining in Nested Loops with Prolog-Epilog Merging
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-13374-9_16openalex-snapshot
Synchronization-Free Automatic Parallelization: Beyond Affine Iteration-Space Slicing
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-21487-5_4openalex-snapshot
ompVerify: Polyhedral Analysis for the OpenMP Programmer
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.1007/978-3-642-35887-6_12openalex-snapshot
The ParaPhrase Project: Parallel Patterns for Adaptive Heterogeneous Multicore Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-37658-0_5openalex-snapshot
Set and Relation Manipulation for the Sparse Polyhedral Framework
inferred← citeshttps://doi.org/10.1007/978-3-662-45231-8_41openalex-snapshot
Verification of Polyhedral Optimizations with Constant Loop Bounds in Finite State Space Computations
inferred← citeshttps://doi.org/10.1007/978-3-662-53413-7_19openalex-snapshot
Loopy: Programmable and Formally Verified Loop Transformations
inferred← citeshttps://doi.org/10.1007/978-981-16-0010-4_34openalex-snapshot
Automatic Thread Block Size Selection Strategy in GPU Parallel Code Generation
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/bf00924526openalex-snapshot
Linear mappings ofn-dimensional uniform recurrences ontok-dimensional systolic arrays
inferred← citeshttps://doi.org/10.1007/bf02577769openalex-snapshot
Using affine closure to find legal reordering transformations
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/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/bfb0017283openalex-snapshot
The loop parallelizer LooPo—announcement
inferred← citeshttps://doi.org/10.1007/bfb0024742openalex-snapshot
An asymptotically optimal affine schedule on bounded convex polyhedric domains
inferred← citeshttps://doi.org/10.1007/bfb0025867openalex-snapshot
Fine-grain scheduling under resource constraints
inferred← citeshttps://doi.org/10.1007/bfb0025873openalex-snapshot
Communication-free parallelization via affine transformations
inferred← citeshttps://doi.org/10.1007/bfb0025874openalex-snapshot
Finding legal reordering transformations using mappings
inferred← citeshttps://doi.org/10.1007/bfb0025880openalex-snapshot
Minimal data dependence abstractions for loop transformations
inferred← citeshttps://doi.org/10.1007/bfb0027118openalex-snapshot
Automatic synthesis of parallel algorithms
inferred← citeshttps://doi.org/10.1007/bfb0094913openalex-snapshot
Parallelization via constrained storage mapping optimization
inferred← citeshttps://doi.org/10.1007/bfb0100626openalex-snapshot
The Nestor library: A tool for implementing fortran source to source transfromations
inferred← citeshttps://doi.org/10.1007/s00607-017-0576-3openalex-snapshot
Generation of parallel synchronization-free tiled code
inferred← citeshttps://doi.org/10.1007/s10766-004-1460-2openalex-snapshot
Automatic Array Partitioning Based on the Smith Normal Form
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-0241-1openalex-snapshot
Predictive Modeling in a Polyhedral Optimization Space
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/s11227-018-2678-xopenalex-snapshot
Insight into tiles generated by means of a correction technique
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-0262-yopenalex-snapshot
Hardware Acceleration of HMMER on FPGAs
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-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/j.cl.2018.05.003openalex-snapshot
Coding Ants: Optimization of GPU code using ant colony optimization
inferred← citeshttps://doi.org/10.1016/j.jpdc.2025.105135openalex-snapshot
Towards efficient program execution on edge-cloud computing platforms
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.parco.2010.12.005openalex-snapshot
Coarse-grained loop parallelization: Iteration Space Slicing vs affine transformations
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.1016/j.parco.2016.02.004openalex-snapshot
An approach for code generation in the Sparse Polyhedral Framework
inferred← citeshttps://doi.org/10.1016/j.scico.2005.10.013openalex-snapshot
In search of a program generator to implement generic transformations for high-performance computing
inferred← citeshttps://doi.org/10.1016/s0010-4655(01)00232-6openalex-snapshot
On loop transformations of nested loops with affine dependencies
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(97)00089-6openalex-snapshot
Memory size reduction through storage order optimization for embedded parallel multimedia applications
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)00021-0openalex-snapshot
Maximizing parallelism and minimizing synchronization with affine partitions
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/s0304-3975(97)00209-0openalex-snapshot
Affine scheduling on bounded convex polyhedric domains is asymptotically optimal
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:1007559710855openalex-snapshot
Communication Optimization for Affine Recurrence Equations Using Broadcast and Locality
inferred← citeshttps://doi.org/10.1023/a:1007944932429openalex-snapshot
A Unifying Lattice-Based Approach for the Partitioning of Systolic Arrays via LPGS and LSGP
inferred← citeshttps://doi.org/10.1023/a:1008139706909openalex-snapshot
Finding Quadratic Schedules for Affine Recurrence Equations Via Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1023/a:1010966620131openalex-snapshot
A Method for Parallelizing Algorithms by Vector Scheduling Functions
inferred← citeshttps://doi.org/10.1023/a:1012293814832openalex-snapshot
Synthesizing Transformations for Locality Enhancement of Imperfectly-Nested Loop Nests
inferred← citeshttps://doi.org/10.1023/a:1025117523902openalex-snapshot
Parameterized Polyhedra and Their Vertices
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.1051/ro:2007036openalex-snapshot
Reservation table scheduling: branch-and-bound based optimizationvs. integer linear programming techniques
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/12.508321openalex-snapshot
On uniformization of affine dependence algorithms
inferred← citeshttps://doi.org/10.1109/32.842951openalex-snapshot
Automatic mapping of system of N-dimensional affine recurrence equations (SARE) onto distributed memory parallel systems
inferred← citeshttps://doi.org/10.1109/asap.1995.522901openalex-snapshot
Revisiting the decomposition of Karp, Miller and Winograd
inferred← citeshttps://doi.org/10.1109/asap.1997.606830openalex-snapshot
Libraries of schedule-free operators in Alpha
inferred← citeshttps://doi.org/10.1109/asap.1997.606840openalex-snapshot
Automatic data mapping of signal processing applications
inferred← citeshttps://doi.org/10.1109/asap.2003.1212828openalex-snapshot
Hardware synthesis for multi-dimensional time
inferred← citeshttps://doi.org/10.1109/asap.2007.4429951openalex-snapshot
Parallelizing HMMER for Hardware Acceleration on FPGAs
inferred← citeshttps://doi.org/10.1109/asap.2012.23openalex-snapshot
Enabling Automatic Pipeline Utilization Improvement in Polyhedral Process Network Implementations
inferred← citeshttps://doi.org/10.1109/cahpc.2018.8645947openalex-snapshot
Polyhedral Dataflow Programming: A Case Study
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/cgo.2011.5764680openalex-snapshot
Predictive modeling in a polyhedral optimization space
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.2017.7863748openalex-snapshot
Optimistic loop optimization
inferred← citeshttps://doi.org/10.1109/cgo51591.2021.9370308openalex-snapshot
MLIR: Scaling Compiler Infrastructure for Domain Specific Computation
inferred← citeshttps://doi.org/10.1109/cgo53902.2022.9741260openalex-snapshot
Optimizing GPU Deep Learning Operators with Polyhedral Scheduling Constraint Injection
inferred← citeshttps://doi.org/10.1109/cgo68049.2026.11394846openalex-snapshot
LEGO: A Layout Expression Language for Code Generation of Hierarchical Mapping
inferred← citeshttps://doi.org/10.1109/cgo68049.2026.11395211openalex-snapshot
PolyUFC: Polyhedral Compilation Meets Roofline Analysis for Uncore Frequency Capping
inferred← citeshttps://doi.org/10.1109/codes-isss.2013.6659002openalex-snapshot
Improving polyhedral code generation for high-level synthesis
inferred← citeshttps://doi.org/10.1109/date.2006.243957openalex-snapshot
Scheduling under Resource Constraints using Dis-Equations
inferred← citeshttps://doi.org/10.1109/etfa.1995.496776openalex-snapshot
A classification of nested loops parallelization algorithms
inferred← citeshttps://doi.org/10.1109/fccm.2010.25openalex-snapshot
Blocking LU Decomposition for FPGAs
inferred← citeshttps://doi.org/10.1109/fmpc.1995.380437openalex-snapshot
Code generation for multiple mappings
inferred← citeshttps://doi.org/10.1109/fpt.2010.5681493openalex-snapshot
Automatic synthesis of processor arrays with local memories on FPGAs
inferred← citeshttps://doi.org/10.1109/fpt.2010.5681769openalex-snapshot
High performance and memory efficient implementation of matrix multiplication on FPGAs
inferred← citeshttps://doi.org/10.1109/fpt.2011.6132715openalex-snapshot
Efficient nested loop pipelining in high level synthesis using polyhedral bubble insertion
inferred← citeshttps://doi.org/10.1109/hipc.2017.00046openalex-snapshot
Lifting Barriers Using Parallel Polyhedral Regions
inferred← citeshttps://doi.org/10.1109/hips.1998.665147openalex-snapshot
Further results for improving loop interchange in non-adjacent and imperfectly nested loops
inferred← citeshttps://doi.org/10.1109/icaict.2017.8686931openalex-snapshot
Construction of optimal space-time mappings for automatic parallelization of loop nests with static control flow
inferred← citeshttps://doi.org/10.1109/icapp.1995.472180openalex-snapshot
A unifying framework for iteration reordering transformations
inferred← citeshttps://doi.org/10.1109/icapp.1997.651504openalex-snapshot
Eigenvectors-based parallelisation of nested loops with affine dependences
inferred← citeshttps://doi.org/10.1109/iccad.2011.6105324openalex-snapshot
Combined loop transformation and hierarchy allocation for data reuse optimization
inferred← citeshttps://doi.org/10.1109/iccad.2015.7372592openalex-snapshot
A polyhedral-based SystemC modeling and generation framework for effective low-power design space exploration
inferred← citeshttps://doi.org/10.1109/iceee.2009.5393415openalex-snapshot
Control generation for QR decomposition based on the polytope model
inferred← citeshttps://doi.org/10.1109/icpp.2016.56openalex-snapshot
Scalable Hierarchical Polyhedral Compilation
inferred← citeshttps://doi.org/10.1109/icvd.2001.902639openalex-snapshot
A systematic approach for system bus load reduction applied to medical imaging
inferred← citeshttps://doi.org/10.1109/ipdps.2007.370229openalex-snapshot
Scheduling in the Z-Polyhedral Model
inferred← citeshttps://doi.org/10.1109/ipdps.2008.4536401openalex-snapshot
Towards effective automatic parallelization for multicore systems
inferred← citeshttps://doi.org/10.1109/ipdps64566.2025.00041openalex-snapshot
PolyMorphous: An MLIR-Based Polyhedral Compiler with Loop Transformation Primitives
inferred← citeshttps://doi.org/10.1109/ipdpsw52791.2021.00042openalex-snapshot
Accelerating the BPMax Algorithm for RNA-RNA Interaction
inferred← citeshttps://doi.org/10.1109/ipps.1996.508085openalex-snapshot
How to optimize residual communications?
inferred← citeshttps://doi.org/10.1109/islped.2015.7273491openalex-snapshot
Leveraging emerging nonvolatile memory in high-level synthesis with loop transformations
inferred← citeshttps://doi.org/10.1109/ispdc.2003.1267639openalex-snapshot
Efficient code generation for automatic parallelization and optimization
inferred← citeshttps://doi.org/10.1109/ispdc.2007.21openalex-snapshot
Extracting Coarse-Grained Parallelism in Program Loops with the Slicing Framework
inferred← citeshttps://doi.org/10.1109/ispdc.2009.15openalex-snapshot
Coarse-Grained Loop Parallelization: Iteration Space Slicing vs Affine Transformations
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.1109/micro50266.2020.00044openalex-snapshot
Optimizing the Memory Hierarchy by Compositing Automatic Transformations on Computations and Data
inferred← citeshttps://doi.org/10.1109/msp.2005.1511820openalex-snapshot
EURASIP Journal on Embedded Systems
inferred← citeshttps://doi.org/10.1109/pact.1996.552676openalex-snapshot
Optimal fine and medium grain parallelism detection in polyhedral reduced dependence graphs
inferred← citeshttps://doi.org/10.1109/pact.1998.727179openalex-snapshot
Code generation in the polytope model
inferred← citeshttps://doi.org/10.1109/pact.2004.1342537openalex-snapshot
Code generation in the polyhedral model is easier than you think
inferred← citeshttps://doi.org/10.1109/pact.2007.4336220openalex-snapshot
Automatic Correction of Loop Transformations
inferred← citeshttps://doi.org/10.1109/pact.2009.18openalex-snapshot
Polyhedral-Model Guided Loop-Nest Auto-Vectorization
inferred← citeshttps://doi.org/10.1109/pact52795.2021.00009openalex-snapshot
PolyGym: Polyhedral Optimizations as an Environment for Reinforcement Learning
inferred← citeshttps://doi.org/10.1109/pact58117.2023.00024openalex-snapshot
Automatic Algorithm-Based Fault Tolerance (AABFT) of Stencil Computations
inferred← citeshttps://doi.org/10.1109/pact65351.2025.00030openalex-snapshot
Automatic Generation of Actor-based Parallelism from Shared-Memory Parallel Programs
inferred← citeshttps://doi.org/10.1109/parelec.2004.4openalex-snapshot
A Modified Vertex Method for Parallelization of Arbitrary Nested Loops
inferred← citeshttps://doi.org/10.1109/pcee.2004.4openalex-snapshot
A Modified Vertex Method for Parallelization of Arbitrary Nested Loops
inferred← citeshttps://doi.org/10.1109/qcs54837.2021.00009openalex-snapshot
Exploring Affine Abstractions for Qubit Mapping
inferred← citeshttps://doi.org/10.1109/recosoc.2013.6581546openalex-snapshot
A parallelization methodology for reconfigurable systems applied to edge detection
inferred← citeshttps://doi.org/10.1109/sc.2010.14openalex-snapshot
Combined Iterative and Model-driven Optimization in an Automatic Parallelization Framework
inferred← citeshttps://doi.org/10.1109/sc.2014.29openalex-snapshot
Oil and Water Can Mix: An Integration of Polyhedral and AST-Based Transformations
inferred← citeshttps://doi.org/10.1109/sc.2016.38openalex-snapshot
PIPES: A Language and Compiler for Task-Based Programming on Distributed-Memory Clusters
inferred← citeshttps://doi.org/10.1109/tc.2010.278openalex-snapshot
A High Performance and Memory Efficient LU Decomposer on FPGAs
inferred← citeshttps://doi.org/10.1109/tc.2018.2853747openalex-snapshot
Affine Modeling of Program Traces
inferred← citeshttps://doi.org/10.1109/tcad.2012.2228270openalex-snapshot
Polyhedral Bubble Insertion: A Method to Improve Nested Loop Pipelining for High-Level Synthesis
inferred← citeshttps://doi.org/10.1109/tcad.2017.2648838openalex-snapshot
Efficient Memory Partitioning for Parallel Data Access in FPGA via Data Reuse
showing the first 200 of 338 · page through all 338
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.