| An Object-Oriented Interface to The Sparse Polyhedral Library | 0 | 0.34 | 2021 |
| MatRox - modular approach for improving data locality in hierarchical (Mat)rix App(Rox)imation. | 0 | 0.34 | 2020 |
| Unified Sequential Optimization Directives in OpenMP. | 0 | 0.34 | 2020 |
| Automatic parallelization of irregular x86-64 loops | 0 | 0.34 | 2019 |
| Sparse computation data dependence simplification for efficient compiler-generated inspectors | 3 | 0.42 | 2019 |
| Reverse-mode algorithmic differentiation of an OpenMP-parallel compressible flow solver | 1 | 0.35 | 2019 |
| Using the loop chain abstraction to schedule across loops in existing code. | 0 | 0.34 | 2019 |
| Transforming loop chains via macro dataflow graphs. | 1 | 0.40 | 2018 |
| ParSy: inspection and transformation of sparse matrix computations for parallelism. | 1 | 0.35 | 2018 |
| Extending OpenMP to Facilitate Loop Optimization. | 0 | 0.34 | 2018 |
| Sparse Matrix Code Dependence Analysis Simplification at Compile Time. | 0 | 0.34 | 2018 |
| Iterator-Based Optimization Of Imperfectly-Nested Loops | 0 | 0.34 | 2018 |
| The Sparse Polyhedral Framework: Composing Compiler-Generated Inspector-Executor Code. | 2 | 0.38 | 2018 |
| Parallelizable adjoint stencil computations using transposed forward-mode algorithmic differentiation. | 1 | 0.35 | 2018 |
| Language-Agnostic Optimization and Parallelization for Interpreted Languages. | 0 | 0.34 | 2017 |
| Sympiler: Transforming Sparse Matrix Codes by Decoupling Symbolic Analysis. | 3 | 0.37 | 2017 |
| Handling Nested Parallelism and Extreme Load Imbalance in an Orbital Analysis Code. | 0 | 0.34 | 2017 |
| Identifying and Scheduling Loop Chains Using Directives. | 0 | 0.34 | 2016 |
| An approach for code generation in the Sparse Polyhedral Framework. | 8 | 0.48 | 2016 |
| Automating wavefront parallelization for sparse matrix computations. | 8 | 0.48 | 2016 |
| Analyzing Parallel Programming Models for Magnetic Resonance Imaging. | 0 | 0.34 | 2016 |
| Parameterized Diamond Tiling for Stencil Computations with Chapel parallel iterators | 6 | 0.52 | 2015 |
| Loop and data transformations for sparse matrix code | 20 | 0.68 | 2015 |
| Non-affine Extensions to Polyhedral Code Generation | 16 | 0.61 | 2014 |
| A Study on Balancing Parallelism, Data Locality, and Recomputation in Existing PDE Solvers. | 15 | 0.76 | 2014 |
| Generalizing Run-Time Tiling with the Loop Chain Abstraction | 3 | 0.39 | 2014 |
| An optimization-based approach to lookup table program transformations | 0 | 0.34 | 2014 |
| Loop Chaining: A Programming Abstraction for Balancing Locality and Parallelism | 7 | 0.54 | 2013 |
| Abstractions to separate concerns in semi-regular grids | 0 | 0.34 | 2013 |
| Languages and Compilers for Parallel Computing, 24th International Workshop, LCPC 2011, Fort Collins, CO, USA, September 8-10, 2011. Revised Selected Papers | 19 | 1.03 | 2013 |
| Abstractions for Defining Semi-Regular Grids Orthogonally from Stencils. | 0 | 0.34 | 2012 |
| Parameterized loop tiling | 9 | 0.47 | 2012 |
| Optimizing Expression Selection for Lookup Table Program Transformation | 0 | 0.34 | 2012 |
| Set and Relation Manipulation for the Sparse Polyhedral Framework. | 9 | 0.45 | 2012 |
| A Fast Parallel Graph Partitioner for Shared-Memory Inspector/Executor Strategies. | 1 | 0.36 | 2012 |
| Executing Optimized Irregular Applications Using Task Graphs within Existing Parallel Models | 4 | 0.40 | 2012 |
| Mesa: automatic generation of lookup table optimizations | 6 | 0.48 | 2011 |
| Tool support for software lookup table optimization. | 1 | 0.37 | 2011 |
| Performance Evaluation of an Irregular Application Parallelized in Java | 1 | 0.37 | 2010 |
| Scalable simulation of complex network routing policies | 0 | 0.34 | 2010 |
| Evaluation of Hierarchical Mesh Reorderings | 1 | 0.36 | 2009 |
| Improving Random Walk Performance | 1 | 0.36 | 2009 |
| May/must analysis and the DFAGen data-flow analysis generator | 3 | 0.44 | 2009 |
| Automatic Determination of May/Must Set Usage in Data-Flow Analysis | 1 | 0.36 | 2008 |
| Smashing: Folding Space to Tile through Time | 7 | 0.50 | 2008 |
| Term Graphs for Computing Derivatives in Imperative Languages | 0 | 0.34 | 2007 |
| Multi-level tiling: M for the price of one | 37 | 1.66 | 2007 |
| Parameterized tiled loops for free | 35 | 1.80 | 2007 |
| Linearity analysis for automatic differentiation | 2 | 0.48 | 2006 |
| Data-Flow Analysis for MPI Programs | 33 | 1.69 | 2006 |
