2026 Keshav Pingali: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	69	2008	1945	1012	973	291	13562

Research.com Recognitions

2020 - Member of Academia Europaea
2012 - ACM Fellow For contributions to data-centric parallel programming and to parallel compilation theory and practice.
2010 - IEEE Fellow For contributions to compilers and parallel computing
2009 - Fellow of the American Association for the Advancement of Science (AAAS)

Overview

Keshav Pingali is affiliated with The University of Texas at Austin in the United States. Their research spans multiple areas within computer science and engineering, with a focus on parallel computing, graph algorithms, and advanced computational techniques.

The scientist has contributed extensively to fields including:

Computer Science
Engineering

Their work covers subfields such as:

Artificial Intelligence
Computer Networks and Communications
Electrical and Electronic Engineering
Hardware and Architecture
Statistical and Nonlinear Physics

Main topics of research include:

Graph Theory and Algorithms
Parallel Computing and Optimization Techniques
Advanced Graph Neural Networks
Cloud Computing and Resource Management
Complex Network Analysis Techniques
Interconnection Networks and Systems
Bioinformatics and Genomic Networks

Keshav Pingali has collaborated frequently with several researchers, including:

Maciej Paszyński
Roshan Dathathri
Gurbinder Gill
Marcin Łoś
Loc Hoang

Their publications have appeared in various venues, notably:

arXiv (Cornell University)
Proceedings of the VLDB Endowment
Computers & Mathematics with Applications
2022 27th Asia and South Pacific Design Automation Conference (ASP-DAC)
IEEE Design and Test

Notable recent papers include:

"Pangolin", 2020, Proceedings of the VLDB Endowment
"SPRoute 2.0: A detailed-routability-driven deterministic parallel global router with soft capacity", 2022, 2022 27th Asia and South Pacific Design Automation Conference (ASP-DAC)
"An Open-Source EDA Flow for Asynchronous Logic", 2021, IEEE Design and Test
"Groute", 2020, ACM Transactions on Parallel Computing
"Single machine graph analytics on massive datasets using Intel optane DC persistent memory", 2020, Proceedings of the VLDB Endowment

Keshav Pingali has received several professional recognitions including:

Member of Academia Europaea (2020)
ACM Fellow (2012) for contributions to data-centric parallel programming and parallel compilation theory and practice
IEEE Fellow (2010) for contributions to compilers and parallel computing
Fellow of the American Association for the Advancement of Science (AAAS) (2009)

Best Publications

A lightweight infrastructure for graph analytics

Donald Nguyen;Andrew Lenharth;Keshav Pingali

671
Citations
Optimistic parallelism requires abstractions

Milind Kulkarni;Keshav Pingali;Bruce Walter;Ganesh Ramanarayanan

551
Citations
I-structures: data structures for parallel computing

Unknown

532
Citations
A quantitative study of irregular programs on GPUs

Martin Burtscher;Rupesh Nasre;Keshav Pingali

499
Citations
The tao of parallelism in algorithms

Keshav Pingali;Donald Nguyen;Milind Kulkarni;Martin Burtscher

488
Citations
Process decomposition through locality of reference

A. Rogers;K. Pingali

371
Citations
The program structure tree: computing control regions in linear time

Richard Johnson;David Pearson;Keshav Pingali

325
Citations
Data-centric multi-level blocking

Induprakas Kodukula;Nawaaz Ahmed;Keshav Pingali

306
Citations
Automated application-level checkpointing of MPI programs

Greg Bronevetsky;Daniel Marques;Keshav Pingali;Paul Stodghill

303
Citations
Lonestar: A suite of parallel irregular programs

Milind Kulkarni;Martin Burtscher;Calin Cascaval;Keshav Pingali

243
Citations
A comparison of empirical and model-driven optimization

Kamen Yotov;Xiaoming Li;Gang Ren;Michael Cibulskis

228
Citations
An Efficient CUDA Implementation of the Tree-Based Barnes Hut n-Body Algorithm

Martin Burtscher;Keshav Pingali

218
Citations
Register renaming and dynamic speculation: an alternative approach

Mayan Moudgill;Keshav Pingali;Stamatis Vassiliadis

207
Citations
A comparison of empirical and model-driven optimization

Unknown

205
Citations
How much parallelism is there in irregular applications

Milind Kulkarni;Martin Burtscher;Rajeshkar Inkulu;Keshav Pingali

204
Citations
Dependence-based program analysis

Richard Johnson;Keshav Pingali

193
Citations
Is Search Really Necessary to Generate High-Performance BLAS?

K. Yotov;Xiaoming Li;Gang Ren;M.J.S. Garzaran

190
Citations
Application-level checkpointing for shared memory programs

Greg Bronevetsky;Daniel Marques;Keshav Pingali;Peter Szwed

177
Citations
A Singular Loop Transformation Framework Based on Non-Singular Matrices

Wei Li;Keshav Pingali

163
Citations
I-structures: Data structures for parallel computing

Arvind;Rishiyur S. Nikhil;Keshav Pingali

159
Citations
Synthesizing Transformations for Locality Enhancement of Imperfectly-Nested Loop Nests

Nawaaz Ahmed;Nikolay Mateev;Keshav Pingali

156
Citations
A load balancing framework for adaptive and asynchronous applications

K. Barker;A. Chernikov;N. Chrisochoides;K. Pingali

147
Citations

Frequent Co-Authors

David Padua University of Illinois at Urbana-Champaign

Arvind MIT

Bruce Walter Cornell University

Kavita Bala Cornell University

Kathryn S. McKinley Google (United States)

Alexandru Nicolau University of California, Irvine

Michael F. P. O'Boyle University of Edinburgh

Martin Schulz Technical University of Munich

Guang R. Gao University of Delaware

Rajit Manohar Yale University

External Links

Wikipedia of Keshav Pingali Personal website of Keshav Pingali Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring online degrees is a flexible way to advance your education and career in Computer Science and related fields. Many students consider online affordable master's programs to gain specialized skills without a hefty price tag. These programs often provide the same rigorous curriculum as on-campus options, allowing you to study from anywhere and reduce overall costs.

For those aiming for senior leadership or academic roles, a doctorate organizational leadership online can pave the way to higher-level opportunities, especially in tech management or education administration. Similarly, pursuing an ed d degree online can help you lead in the education sector or operational strategy within tech organizations.

If you’re looking to start your career as soon as possible, consider the easiest associate degree to get online. These pathways offer a quick entry into the workforce, letting you gain practical skills and experience in less time. Each of these online options offers flexibility and accessibility, helping you align your education with your professional goals.