| <inline-formula><tex-math notation="LaTeX">${{\sf Colosseum}}$</tex-math><alternatives><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi mathvariant="sans-serif">Colosseum</mml:mi></mml:math><inline-graphic xlink:href="mondal-ieq1-3111169.gif" xmlns:xlink="http://www.w3.org/1999/xlink"/></alternatives></inline-formula>: Regression Test Prioritization by Delta Displacement in Test Coverage | 0 | 0.34 | 2022 |
| ParTBC: Faster Estimation of Top-k Betweenness Centrality Vertices on GPU | 0 | 0.34 | 2022 |
| Multi-Interval DomLock: Toward Improving Concurrency in Hierarchies | 0 | 0.34 | 2022 |
| Efficient Parallelization Of Sph Algorithm On Modern Multi-Core Cpus And Massively Parallel Gpus | 0 | 0.34 | 2021 |
| Graffix - Efficient Graph Processing with a Tinge of GPU-Specific Approximations. | 0 | 0.34 | 2020 |
| Orion: time estimated causally consistent key-value store | 0 | 0.34 | 2020 |
| OPAL: An extensible framework for ontology-based program analysis. | 0 | 0.34 | 2020 |
| Optimizing graph processing on GPUs using approximate computing - poster. | 0 | 0.34 | 2019 |
| Toggle - Contention-Aware Task Scheduler for Concurrent Hierarchical Operations. | 0 | 0.34 | 2019 |
| Custom Code Generation For A Graph Dsl | 0 | 0.34 | 2019 |
| QADroid: regression event selection for Android applications | 0 | 0.34 | 2019 |
| A study on popular auto-parallelization frameworks. | 0 | 0.34 | 2019 |
| Effective Mapping of an SPH Algorithm on Massively Parallel GPU Architecture | 0 | 0.34 | 2018 |
| Numlock: Towards Optimal Multi-Granularity Locking In Hierarchies | 0 | 0.34 | 2018 |
| Scalable and Performant Graph Processing on GPUs Using Approximate Computing. | 0 | 0.34 | 2018 |
| Multi-granularity Locking in Hierarchies with Synergistic Hierarchical and Fine-Grained Locks. | 0 | 0.34 | 2018 |
| Optimizing Graph Algorithms in Asymmetric Multicore Processors. | 0 | 0.34 | 2018 |
| CHOAMP: Cost Based Hardware Optimization for Asymmetric Multicore Processors. | 0 | 0.34 | 2018 |
| DCEIL: Distributed Community Detection with the CEIL Score | 0 | 0.34 | 2017 |
| DH-Falcon: A Language for Large-Scale Graph Processing on Distributed Heterogeneous Systems | 0 | 0.34 | 2017 |
| DomLock: a new multi-granularity locking technique for hierarchies. | 5 | 0.46 | 2017 |
| Falcon: A Graph Manipulation Language for Heterogeneous Systems. | 5 | 0.42 | 2016 |
| EagerMerge: an optimistic technique for efficient points-to analysis. | 0 | 0.34 | 2016 |
| FastCollect: offloading generational garbage collection to integrated GPUs | 0 | 0.34 | 2016 |
| Push-pull constraint graph for efficient points-to analysis | 0 | 0.34 | 2014 |
| Time- and space-efficient flow-sensitive points-to analysis. | 3 | 0.40 | 2013 |
| Morph algorithms on GPUs | 41 | 1.39 | 2013 |
| Atomic-free irregular computations on GPUs | 27 | 0.96 | 2013 |
| Data-Driven Versus Topology-driven Irregular Computations on GPUs | 48 | 1.37 | 2013 |
| A quantitative study of irregular programs on GPUs | 167 | 4.64 | 2012 |
| Parallel replication-based points-to analysis | 4 | 0.44 | 2012 |
| Exploiting the structure of the constraint graph for efficient points-to analysis | 4 | 0.42 | 2012 |
| Prioritizing constraint evaluation for efficient points-to analysis | 9 | 0.49 | 2011 |
| Dataflow analysis for datarace-free programs | 5 | 0.47 | 2011 |
| Approximating inclusion-based points-to analysis | 3 | 0.38 | 2011 |
| Points-to analysis as a system of linear equations | 6 | 0.46 | 2010 |
| Scalable Context-Sensitive Points-to Analysis Using Multi-dimensional Bloom Filters | 12 | 0.56 | 2009 |
| User Interaction in the BANKS System | 2 | 0.40 | 2003 |
