| IOOpt: automatic derivation of I/O complexity bounds for affine programs | 0 | 0.34 | 2021 |
| Efficient tiled sparse matrix multiplication through matrix signatures | 0 | 0.34 | 2020 |
| Automated Derivation of Parametric Data Movement Lower Bounds for Affine Programs | 1 | 0.35 | 2020 |
| Building a Polyhedral Representation from an Instrumented Execution: Making Dynamic Analyses of Nonaffine Programs Scalable | 0 | 0.34 | 2020 |
| Analytical cache modeling and tilesize optimization for tensor contractions | 0 | 0.34 | 2019 |
| Data-flow/dependence profiling for structured transformations. | 1 | 0.38 | 2019 |
| Register optimizations for stencils on GPUs. | 10 | 0.49 | 2018 |
| Performance modeling for GPUs using abstract kernel emulation. | 0 | 0.34 | 2018 |
| GPU code optimization using abstract kernel emulation and sensitivity analysis. | 1 | 0.35 | 2018 |
| Associative instruction reordering to alleviate register pressure. | 1 | 0.35 | 2018 |
| Simplification and runtime resolution of data dependence constraints for loop transformations. | 1 | 0.35 | 2017 |
| POSTER: Statement Reordering to Alleviate Register Pressure for Stencils on GPUs | 1 | 0.35 | 2017 |
| Optimizing the Four-Index Integral Transform Using Data Movement Lower Bounds Analysis. | 0 | 0.34 | 2017 |
| Static and Dynamic Frequency Scaling on Multicore CPUs. | 4 | 0.45 | 2016 |
| Brief Announcement: Approximating the I/O Complexity of One-Shot Red-Blue Pebbling. | 2 | 0.37 | 2016 |
| A bounded memory allocator for software-defined global address spaces. | 0 | 0.34 | 2016 |
| Description, Implementation and Evaluation of an Affinity Clause for Task Directives. | 2 | 0.38 | 2016 |
| PolyCheck: dynamic verification of iteration space transformations on affine programs. | 2 | 0.36 | 2016 |
| Using Data Dependencies to Improve Task-Based Scheduling Strategies on NUMA Architectures. | 6 | 0.47 | 2016 |
| Effective padding of multidimensional arrays to avoid cache conflict misses. | 6 | 0.43 | 2016 |
| Generalized cache tiling for dataflow programs | 0 | 0.34 | 2016 |
| A domain-specific compiler for a parallel multiresolution adaptive numerical simulation environment. | 4 | 0.39 | 2016 |
| An interval constrained memory allocator for the Givy GAS runtime. | 0 | 0.34 | 2016 |
| Register allocation and promotion through combined instruction scheduling and loop unrolling | 3 | 0.37 | 2016 |
| On fusing recursive traversals of K-d trees. | 6 | 0.43 | 2016 |
| POSTER: Hybrid Data Dependence Analysis for Loop Transformations. | 0 | 0.34 | 2016 |
| Runtime pointer disambiguation | 7 | 0.47 | 2015 |
| On characterizing the data movement complexity of computational DAGs for parallel execution | 1 | 0.35 | 2014 |
| On Using the Roofline Model with Lower Bounds on Data Movement | 1 | 0.35 | 2014 |
| Parameterized Construction of Program Representations for Sparse Dataflow Analyses | 0 | 0.34 | 2014 |
| Beyond reuse distance analysis: Dynamic analysis for characterization of data locality potential. | 4 | 0.42 | 2014 |
| A framework for enhancing data reuse via associative reordering | 21 | 0.69 | 2014 |
| A polynomial spilling heuristic: Layered allocation | 0 | 0.34 | 2013 |
| SSI Properties Revisited | 2 | 0.35 | 2012 |
| Decoupled graph-coloring register allocation with hierarchical aliasing | 1 | 0.36 | 2011 |
| Graph-coloring and treescan register allocation using repairing | 4 | 0.40 | 2011 |
| A non-iterative data-flow algorithm for computing liveness sets in strict SSA programs | 2 | 0.37 | 2011 |
| Split register allocation: linear complexity without the performance penalty | 2 | 0.38 | 2010 |
| Parallel copy motion | 4 | 0.44 | 2010 |
| Revisiting Out-of-SSA Translation for Correctness, Code Quality and Efficiency | 21 | 0.78 | 2009 |
| Advanced conservative and optimistic register coalescing | 8 | 0.49 | 2008 |
| On the Complexity of Register Coalescing | 26 | 0.92 | 2007 |
| On the complexity of spill everywhere under SSA form | 15 | 0.65 | 2007 |
| Register allocation: what does the NP-completeness proof of Chaitin et al. really prove? or revisiting register allocation: why and how | 20 | 0.71 | 2006 |
| Procedure placement using temporal-ordering information: dealing with code size expansion | 17 | 1.17 | 2005 |
| Optimal task scheduling at run time to exploit intra-tile parallelism | 2 | 0.38 | 2003 |
| Efficient Tiling for an ODE Discrete Integration Program: Redundant Tasks Instead of Trapezoidal Shaped-Tiles | 2 | 0.38 | 2002 |
| Partitioning a Square into Rectangles: NP-Completeness and Approximation Algorithms | 20 | 1.15 | 2002 |
| Dense linear algebra kernels on heterogeneous platforms: redistribution issues | 9 | 0.73 | 2002 |
| Automatic Partitioning of Parallel Loops with Parallelepiped-Shaped Tiles | 8 | 0.61 | 2002 |
