| Accelerating Data Analytics on Integrated GPU Platforms via Runtime Specialization. | 0 | 0.34 | 2018 |
| Parallelizing Julia with a Non-Invasive DSL. | 0 | 0.34 | 2017 |
| Mozart - Efficient Composition of Library Functions for Heterogeneous Execution. | 0 | 0.34 | 2017 |
| HiFrames: High Performance Data Frames in a Scripting Language. | 0 | 0.34 | 2017 |
| HPAT: High Performance Analytics with Scripting Ease-of-Use. | 3 | 0.37 | 2017 |
| Parallelizing Julia with a Non-Invasive DSL (Artifact). | 0 | 0.34 | 2017 |
| Affinity-aware work-stealing for integrated CPU-GPU processors. | 1 | 0.34 | 2016 |
| Latte: a language, compiler, and runtime for elegant and efficient deep neural networks. | 12 | 0.68 | 2016 |
| A black-box approach to energy-aware scheduling on integrated CPU-GPU systems. | 5 | 0.42 | 2016 |
| Efficient Mapping of Irregular C++ Applications to Integrated GPUs | 14 | 0.61 | 2014 |
| Invyswell: a hybrid transactional memory for haswell's restricted transactional memory | 21 | 0.87 | 2014 |
| Adaptive heterogeneous scheduling for integrated GPUs | 34 | 0.95 | 2014 |
| River trail: a path to parallelism in JavaScript | 20 | 0.92 | 2013 |
| Parallel JavaScript: bringing the compute power of multi-core CPUs and GPUs to the world of web graphics | 0 | 0.34 | 2013 |
| Parallel programming for the web | 9 | 0.79 | 2012 |
| Generic workers: towards unified distributed and parallel JavaScript programming model | 3 | 0.46 | 2010 |
| Towards transactional memory semantics for C++ | 12 | 0.57 | 2009 |
| NePalTM: design and implementation of nested parallelism for transactional memory systems | 12 | 0.62 | 2009 |
| Concurrent GC leveraging transactional memory | 9 | 0.50 | 2008 |
| Single global lock semantics in a weakly atomic STM | 19 | 0.93 | 2008 |
| Practical weak-atomicity semantics for java stm | 56 | 1.77 | 2008 |
| Fault-safe code motion for type-safe languages | 1 | 0.37 | 2008 |
| A Uniform Transactional Execution Environment for Java | 15 | 0.66 | 2008 |
| Open nesting in software transactional memory | 81 | 2.78 | 2007 |
| SIPR: A New Framework for Generating Efficient Code for Sparse Matrix Computations | 18 | 2.16 | 1998 |
| Aspect-Oriented Programming of Sparse Matrix Code | 37 | 10.55 | 1997 |
| Transitive closure of infinite graphs and its applications | 53 | 2.92 | 1996 |
| Exploiting monotone convergence functions in parallel programs | 1 | 0.43 | 1996 |
