Prasad Tetali

Papers

Total Citations

238

H-Index

About

Prasad Tetali is a leading researcher in approximation algorithms, online optimization, and combinatorial methods, with a particular focus on resource allocation and packing problems. His most cited work, the comprehensive survey "Approximation and online algorithms for multidimensional bin packing: A survey" (2017), has garnered over 230 citations, establishing him as a key authority on the theoretical foundations and practical challenges of multidimensional packing—a critical area for cloud computing, logistics, and resource scheduling. Tetali’s contributions extend to algorithmic graph theory and large-scale scientific computing; his work on support-theoretic subgraph preconditioners for SLAM (simultaneous localization and mapping) introduced novel techniques for efficiently solving sparse linear systems, directly impacting robotics and autonomous navigation. By bridging rigorous theoretical analysis with real-world computational efficiency, Tetali has advanced both the design of online algorithms and the practical deployment of iterative methods in engineering. His research continues to influence students and practitioners seeking robust, scalable solutions to complex optimization problems.