World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
46
Citations
6370
World Ranking
6948
National Ranking
3038

Mathematics

D-Index
46
Citations
6396
World Ranking
1399
National Ranking
616

Research.com Recognitions

  • 2013 - Fellow of the American Mathematical Society
  • 2009 - SIAM Fellow For contributions to discrete mathematics and algorithms.

Overview

Prasad Tetali is a researcher affiliated with Carnegie Mellon University in the United States. Their work spans the fields of computer science and mathematics with a focus on computational theory and discrete mathematics. Tetali's research addresses topics such as complexity and algorithms in graphs, markov chains and monte carlo methods, and optimization and search problems.

Their publication record includes contributions to a variety of journals and conference proceedings. Frequent venues for their work include arXiv (Cornell University), European Journal of Combinatorics, Combinatorial Theory, Combinatorics Probability Computing, and ANNALI SCUOLA NORMALE SUPERIORE - CLASSE DI SCIENZE.

Notable recent papers authored or co-authored by Tetali include:

  • Transport proofs of some discrete variants of the Prékopa-Leindler inequality, 2021, ANNALI SCUOLA NORMALE SUPERIORE - CLASSE DI SCIENZE
  • On the zeroes of hypergraph independence polynomials, 2023, Combinatorics Probability Computing
  • Improved Approximations for Min Sum Vertex Cover and Generalized Min Sum Set Cover, 2021, Society for Industrial and Applied Mathematics eBooks
  • On the number of independent sets in uniform, regular, linear hypergraphs, 2021, European Journal of Combinatorics
  • Toppleable permutations, excedances and acyclic orientations, 2022, Combinatorial Theory

Frequent co-authors include Majid Farhadi, Will Perkins, Michail Sarantis, Nikhil Bansal, and Jatin Batra. Tetali has collaborated with each of these researchers multiple times, reflecting ongoing research partnerships.

Tetali's work covers several subfields of study such as computational theory and mathematics, discrete mathematics and combinatorics, statistics and probability, geometry and topology, and computer networks and communications.

Main research topics associated with Tetali's publications are:

  • Complexity and Algorithms in Graphs
  • Markov Chains and Monte Carlo Methods
  • Optimization and Search Problems
  • Limits and Structures in Graph Theory
  • Point Processes and Geometric Inequalities
  • Computational Geometry and Mesh Generation
  • Advanced Graph Theory Research

Tetali's professional distinctions include being named a Fellow of the American Mathematical Society in 2013 and being recognized as a SIAM Fellow in 2009 for contributions to discrete mathematics and algorithms.

Best Publications

  • Random walks and the effective resistance of networks

    Prasad Tetali

  • Mathematical Aspects of Mixing Times in Markov Chains

    R. Montenegro;P. Tetali

  • Approximation and online algorithms for multidimensional bin packing: A survey

    Henrik I. Christensen;Arindam Khan;Sebastian Pokutta;Prasad Tetali

  • Simple Markov-chain algorithms for generating bipartite graphs and tournaments

    Ravi Kannan;Prasad Tetali;Santosh Vempala

  • Collisions among random walks on a graph

    Don Coppersmith;Prasad Tetali;Peter Winkler

  • Approximating Min Sum Set Cover

    Uriel Feige;Prasad Tetali

  • Modified Logarithmic Sobolev Inequalities in Discrete Settings

    Sergey G. Bobkov;Prasad Tetali

  • Combinatorial approach to the interpolation method and scaling limits in sparse random graphs

    Mohsen Bayati;David Gamarnik;Prasad Tetali

  • Analyzing Glauber dynamics by comparison of Markov chains

    Dana Randall;Prasad Tetali

  • Simple deterministic approximation algorithms for counting matchings

    Mohsen Bayati;David Gamarnik;Dimitriy Katz;Chandra Nair

  • Information Inequalities for Joint Distributions, With Interpretations and Applications

    Mokshay Madiman;Prasad Tetali

  • Torpid mixing of some Monte Carlo Markov chain algorithms in statistical physics

    C. Borgs;J.T. Chayes;A. Frieze;Jeong Han Kim

  • Kantorovich duality for general transport costs and applications

    Nathael Gozlan;Cyril Roberto;Paul-Marie Samson;Prasad Tetali

  • Elementary bounds on Poincaré and log-Sobolev constants for decomposable Markov chains

    Mark Jerrum;Jung-Bae Son;Prasad Tetali;Eric Vigoda

  • Communication complexity and quasi randomness

    Fan R. K. Chung;Prasad Tetali

  • Mixing Time Bounds via the Spectral Profile

    Sharad Goel;Ravi Montenegro;Prasad Tetali

  • Limits on the efficiency of one-way permutation-based hash functions

    Jeong Han Kim;D.R. Simon;P. Tetali

  • Representations of integers as the sum of k terms

    Paul Erdös;Prasad Tetali

  • Reconstruction and Clustering in Random Constraint Satisfaction Problems

    Andrea Montanari;Ricardo Restrepo;Prasad Tetali

  • Recent trends in combinatorics

    Andrew Beveridge;Jerrold R. Griggs;Leslie Hogben;Gregg Musiker

  • Two-coloring random hypergraphs

    Dimitris Achlioptas;Jeong Han Kim;Michael Krivelevich;Prasad Tetali

Frequent Co-Authors

Eric Vigoda
Eric Vigoda University of California, Santa Barbara
Santosh Vempala
Santosh Vempala Georgia Institute of Technology
Dhruv Mubayi
Dhruv Mubayi University of Illinois at Chicago
Jennifer Chayes
Jennifer Chayes University of California, Berkeley
Christian Borgs
Christian Borgs University of California, Berkeley
Danupon Nanongkai
Danupon Nanongkai Max Planck Institute for Informatics
Gopal Pandurangan
Gopal Pandurangan University of Houston
Sergey G. Bobkov
Sergey G. Bobkov University of Minnesota
Jinwoo Shin
Jinwoo Shin Korea Advanced Institute of Science and Technology

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

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students studying Mathematics in the USA, exploring related online degrees can open diverse career pathways. Programs like data analytics offer a natural extension, where mathematical skills are applied to interpret complex data and drive business decisions. Pursuing a data analytics masters can enhance your expertise and improve job prospects in fields such as finance, technology, and healthcare.

Many aspiring professionals also consider combining their mathematical background with business knowledge by enrolling in MBA programs. It is important to know if you can transfer MBA credits from previous coursework, as this can save time and reduce costs.

For those seeking flexibility and easier admission, identifying the easiest MBA specialization might be a strategic choice. These programs are designed for accessibility while still providing valuable skills for career growth.

Additionally, finding the easiest MBA programs can help students balance studies with work or personal commitments, offering a practical pathway to advance one’s career without excessive barriers.

Best Scientists Citing Prasad Tetali

Trending Scientists

Recently Published Articles