| A lightweight infrastructure for graph analytics D Nguyen, A Lenharth, K Pingali Proceedings of the twenty-fourth ACM symposium on operating systems …, 2013 | 699 | 2013 |
| The tao of parallelism in algorithms K Pingali, D Nguyen, M Kulkarni, M Burtscher, MA Hassaan, R Kaleem, ... Proceedings of the 32nd ACM SIGPLAN conference on Programming language …, 2011 | 535 | 2011 |
| Making context-sensitive points-to analysis with heap cloning practical for the real world C Lattner, A Lenharth, V Adve ACM SIGPLAN Notices 42 (6), 278-289, 2007 | 371 | 2007 |
| Secure virtual architecture: A safe execution environment for commodity operating systems J Criswell, A Lenharth, D Dhurjati, V Adve Proceedings of twenty-first ACM SIGOPS symposium on Operating systems …, 2007 | 227 | 2007 |
| Proactive control of approximate programs X Sui, A Lenharth, DS Fussell, K Pingali ACM SIGPLAN Notices 51 (4), 607-621, 2016 | 101 | 2016 |
| Recovery domains: an organizing principle for recoverable operating systems A Lenharth, VS Adve, ST King ACM Sigplan Notices 44 (3), 49-60, 2009 | 90 | 2009 |
| Parallel graph analytics A Lenharth, D Nguyen, K Pingali Communications of the ACM 59 (5), 78-87, 2016 | 76 | 2016 |
| Scalable data-driven pagerank: Algorithms, system issues, and lessons learned JJ Whang, A Lenharth, IS Dhillon, K Pingali Euro-Par 2015: Parallel Processing: 21st International Conference on …, 2015 | 70 | 2015 |
| Deterministic Galois: On-demand, portable and parameterless D Nguyen, A Lenharth, K Pingali ACM SIGPLAN Notices 49 (4), 499-512, 2014 | 64 | 2014 |
| Priority queues are not good concurrent priority schedulers A Lenharth, D Nguyen, K Pingali Euro-Par 2015: Parallel Processing: 21st International Conference on …, 2015 | 61 | 2015 |
| Parallelization of reordering algorithms for bandwidth and wavefront reduction KI Karantasis, A Lenharth, D Nguyen, MJ Garzaran, K Pingali SC'14: Proceedings of the International Conference for High Performance …, 2014 | 57 | 2014 |
| DSMR: A parallel algorithm for single-source shortest path problem S Maleki, D Nguyen, A Lenharth, M Garzarán, D Padua, K Pingali Proceedings of the 2016 International Conference on Supercomputing, 1-14, 2016 | 54 | 2016 |
| Abelian: A compiler for graph analytics on distributed, heterogeneous platforms G Gill, R Dathathri, L Hoang, A Lenharth, K Pingali European Conference on Parallel Processing, 249-264, 2018 | 37 | 2018 |
| IGA-ADS: isogeometric analysis FEM using ADS solver MM Łoś, M Woźniak, M Paszyński, A Lenharth, MA Hassaan, K Pingali Computer Physics Communications 217, 99-116, 2017 | 37 | 2017 |
| Quality-based adaptive resource management architecture (qarma): A corba resource management service D Fleeman, M Gillen, A Lenharth, M Delaney, L Welch, D Juedes, C Liu 18th International Parallel and Distributed Processing Symposium, 2004 …, 2004 | 35 | 2004 |
| A lightweight communication runtime for distributed graph analytics HV Dang, R Dathathri, G Gill, A Brooks, N Dryden, A Lenharth, L Hoang, ... 2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS …, 2018 | 30 | 2018 |
| Graph grammar based multi-thread multi-frontal direct solver with Galois scheduler D Goik, K Jopek, M Paszyński, A Lenharth, D Nguyen, K Pingali Procedia Computer Science 29, 960-969, 2014 | 29 | 2014 |
| MLIR as hardware compiler infrastructure S Eldridge, P Barua, A Chapyzhenka, A Izraelevitz, J Koenig, C Lattner, ... Workshop on Open-Source EDA Technology (WOSET) 3, 2021 | 28 | 2021 |
| Quasi‐Optimal Elimination Trees for 2D Grids with Singularities A Paszyńska, M Paszyński, K Jopek, M Woźniak, D Goik, P Gurgul, ... Scientific Programming 2015 (1), 303024, 2015 | 28 | 2015 |
| Scaling runtimes for irregular algorithms to large-scale NUMA systems A Lenharth, K Pingali Computer 48 (8), 35-44, 2015 | 11 | 2015 |
Vikram AdveUniversity of Illinois at Urbana-ChampaignVerified email at illinois.edu