Papers

2

Total Citations

75

H-Index

2

About

Ananth Grama is a leading figure in parallel computing and discrete optimization, whose work has fundamentally advanced the efficiency of solving complex combinatorial problems. His research focuses on developing scalable parallel algorithms for discrete optimization, particularly for applications in planning, scheduling, computer-aided design, and robotics. Grama's most influential contributions include pioneering parallel search strategies that dramatically reduce solution times for problems traditionally constrained by sequential processing. His seminal 1995 paper, "Parallel Search Algorithms for Discrete Optimization Problems," with 41 citations, and its 1994 predecessor with 34 citations, established foundational frameworks for distributing search across multiple processors. These works introduced novel techniques for load balancing and state-space decomposition, enabling the practical solution of larger, more intricate optimization challenges. Beyond these core contributions, Grama is also known for his co-authorship of the widely-used textbook "Introduction to Parallel Computing," which has educated generations of students and researchers. His impact is reflected in the sustained citation of his work, underscoring its enduring relevance in both theoretical and applied parallel computing.

Research Focus

Key Achievements

2
H-Index
2
Papers
75
Total Citations
38
Avg Citations/Paper
🏆 Most Cited Paper
Parallel Search Algorithms for Discrete Optimization Problems
41 citations · 1995
📈 Most Prolific Year: 1995 (1 Papers)
🤝 Key Collaborators: 2
🏛 Institutions: University of Minnesota

Top Papers

  1. 1
  2. 2

Key Collaborators

Contact & Links

Available for collaboration
Content generated · 0 days ago