Andrew Lenharth

2.2k total citations · 1 hit paper
29 papers, 1.4k citations indexed

About

Andrew Lenharth is a scholar working on Artificial Intelligence, Hardware and Architecture and Computer Networks and Communications. According to data from OpenAlex, Andrew Lenharth has authored 29 papers receiving a total of 1.4k indexed citations (citations by other indexed papers that have themselves been cited), including 17 papers in Artificial Intelligence, 16 papers in Hardware and Architecture and 13 papers in Computer Networks and Communications. Recurrent topics in Andrew Lenharth's work include Parallel Computing and Optimization Techniques (16 papers), Graph Theory and Algorithms (7 papers) and Distributed and Parallel Computing Systems (7 papers). Andrew Lenharth is often cited by papers focused on Parallel Computing and Optimization Techniques (16 papers), Graph Theory and Algorithms (7 papers) and Distributed and Parallel Computing Systems (7 papers). Andrew Lenharth collaborates with scholars based in United States, Poland and Israel. Andrew Lenharth's co-authors include Keshav Pingali, Donald Nguyen, Vikram Adve, Chris Lattner, Xin Sui, Mario Méndez-Lojo, Dimitrios Prountzos, Rashid Kaleem, Milind Kulkarni and M. Amber Hassaan and has published in prestigious journals such as Communications of the ACM, Computer Physics Communications and Computer.

In The Last Decade

Andrew Lenharth

28 papers receiving 1.3k citations

Hit Papers

A lightweight infrastructure for graph analytics 2013 2026 2017 2021 2013 100 200 300
What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

  1. A lightweight infrastructure for graph analytics
    2013 391 citations Donald Nguyen, Andrew Lenharth et al. profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Andrew Lenharth United States 16 656 628 602 597 420 29 1.4k
Sungpack Hong United States 18 970 1.5× 1.0k 1.7× 1.0k 1.7× 572 1.0× 470 1.1× 42 2.0k
Hassan Chafi United States 27 1.5k 2.3× 1.7k 2.7× 585 1.0× 715 1.2× 420 1.0× 58 2.4k
Donald Nguyen United States 13 587 0.9× 609 1.0× 605 1.0× 341 0.6× 342 0.8× 30 1.1k
Julian Shun United States 19 703 1.1× 844 1.3× 1.1k 1.9× 837 1.4× 465 1.1× 64 1.8k
Duane Merrill United States 13 558 0.9× 547 0.9× 470 0.8× 377 0.6× 189 0.5× 20 1.1k
Tiark Rompf United States 25 1.2k 1.9× 931 1.5× 142 0.2× 1.0k 1.7× 424 1.0× 101 2.0k
Huiyang Zhou United States 26 1.8k 2.7× 1.5k 2.4× 216 0.4× 567 0.9× 428 1.0× 120 2.4k
Lawrence Rauchwerger United States 25 1.4k 2.1× 1.2k 1.9× 138 0.2× 284 0.5× 247 0.6× 77 1.7k
Douglas Gregor United States 12 285 0.4× 274 0.4× 247 0.4× 369 0.6× 266 0.6× 25 762
Jeremy T. Fineman United States 15 621 0.9× 809 1.3× 163 0.3× 277 0.5× 141 0.3× 64 1.1k

Countries citing papers authored by Andrew Lenharth

Since Specialization
Citations

This map shows the geographic impact of Andrew Lenharth's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Andrew Lenharth with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Andrew Lenharth more than expected).

Fields of papers citing papers by Andrew Lenharth

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Andrew Lenharth. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Andrew Lenharth. The network helps show where Andrew Lenharth may publish in the future.

Co-authorship network of co-authors of Andrew Lenharth

This figure shows the co-authorship network connecting the top 25 collaborators of Andrew Lenharth. A scholar is included among the top collaborators of Andrew Lenharth based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Andrew Lenharth. Andrew Lenharth is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Dang, Hoang-Vu, Roshan Dathathri, Gurbinder Gill, et al.. (2018). A Lightweight Communication Runtime for Distributed Graph Analytics. 980–989. 19 indexed citations
2.
Sui, Xin, Andrew Lenharth, Donald S. Fussell, & Keshav Pingali. (2016). Proactive Control of Approximate Programs. 607–621. 41 indexed citations
3.
Sui, Xin, Andrew Lenharth, Donald S. Fussell, & Keshav Pingali. (2016). Proactive Control of Approximate Programs. ACM SIGPLAN Notices. 51(4). 607–621. 3 indexed citations
4.
Paszyńska, Anna, Maciej Woźniak, Andrew Lenharth, Donald Nguyen, & Keshav Pingali. (2016). Hypergraph Grammars in Non-stationary hp- adaptive Finite Element Method. Procedia Computer Science. 80. 875–886. 2 indexed citations
5.
Maleki, Saeed, Donald Nguyen, Andrew Lenharth, et al.. (2016). DSMR. 1–14. 20 indexed citations
6.
Lenharth, Andrew & Keshav Pingali. (2015). Scaling Runtimes for Irregular Algorithms to Large-Scale NUMA Systems. Computer. 48(8). 35–44. 7 indexed citations
7.
Nguyen, Donald, Andrew Lenharth, & Keshav Pingali. (2014). Deterministic galois. ACM SIGPLAN Notices. 49(4). 499–512. 2 indexed citations
8.
Nguyen, Donald, Andrew Lenharth, & Keshav Pingali. (2014). Deterministic galois. ACM SIGARCH Computer Architecture News. 42(1). 499–512. 1 indexed citations
9.
Paszyński, Maciej, et al.. (2014). Graph Grammar based Multi-thread Multi-frontal Direct Solver with Galois Scheduler. Procedia Computer Science. 29. 960–969. 17 indexed citations
10.
Nguyen, Donald, Andrew Lenharth, & Keshav Pingali. (2014). Deterministic galois. 499–512. 26 indexed citations
11.
Lenharth, Andrew, et al.. (2014). Parallelization of Reordering Algorithms for Bandwidth and Wavefront Reduction. 921–932. 24 indexed citations
12.
Nguyen, Donald, Andrew Lenharth, & Keshav Pingali. (2013). A lightweight infrastructure for graph analytics. 456–471. 391 indexed citations breakdown →
13.
Pingali, Keshav, Donald Nguyen, Milind Kulkarni, et al.. (2011). The tao of parallelism in algorithms. 12–25. 188 indexed citations
14.
Pingali, Keshav, Donald Nguyen, Milind Kulkarni, et al.. (2011). The tao of parallelism in algorithms. ACM SIGPLAN Notices. 46(6). 12–25. 208 indexed citations
15.
Lenharth, Andrew, Vikram Adve, & Samuel T. King. (2009). Recovery domains. ACM SIGARCH Computer Architecture News. 37(1). 49–60. 4 indexed citations
16.
Criswell, John, Andrew Lenharth, Dinakar Dhurjati, & Vikram Adve. (2007). Secure virtual architecture. 351–366. 110 indexed citations
17.
Lattner, Chris, Andrew Lenharth, & Vikram Adve. (2007). Making context-sensitive points-to analysis with heap cloning practical for the real world. ACM SIGPLAN Notices. 42(6). 278–289. 35 indexed citations
18.
Lattner, Chris, Andrew Lenharth, & Vikram Adve. (2007). Making context-sensitive points-to analysis with heap cloning practical for the real world. 278–289. 153 indexed citations
19.
Criswell, John, Andrew Lenharth, Dinakar Dhurjati, & Vikram Adve. (2007). Secure virtual architecture. ACM SIGOPS Operating Systems Review. 41(6). 351–366. 15 indexed citations
20.
Lenharth, Andrew, et al.. (2004). Quality-based adaptive resource management architecture (QARMA): a CORBA resource management service. 116–123. 11 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Sungpack Hong Breakdown of academic impact, for papers by Hassan Chafi Breakdown of academic impact, for papers by Donald Nguyen Breakdown of academic impact, for papers by Julian Shun Breakdown of academic impact, for papers by Duane Merrill Breakdown of academic impact, for papers by Tiark Rompf Breakdown of academic impact, for papers by Huiyang Zhou Breakdown of academic impact, for papers by Lawrence Rauchwerger Breakdown of academic impact, for papers by Douglas Gregor Breakdown of academic impact, for papers by Jeremy T. Fineman
Rankless by CCL
2026