Prasad V. Tetali

Q: What Schools Are Affiliated With Prasad V. Tetali

Prasad V. Tetali is affiliated with the following schools: University of California, Berkeley, University of California, San Diego, Andhra University, Indian Institute of Science, Carnegie Mellon University, Georgia Tech, New York University

Prasad V. Tetali's AcademicInfluence.com Rankings

Prasad V. Tetali

Computer Science

#3211

World Rank

#3364

Historical Rank

#1260

USA Rank

Theoretical Computer Science

#138

World Rank

#138

Historical Rank

#34

USA Rank

Database

#8311

World Rank

#8691

Historical Rank

#1092

USA Rank

computer-science Degrees

Prasad V. Tetali

Mathematics

#2718

World Rank

#4138

Historical Rank

#1058

USA Rank

Probability Theory

#46

World Rank

#67

Historical Rank

#15

USA Rank

Combinatorics

#102

World Rank

#110

Historical Rank

#15

USA Rank

Measure Theory

#3142

World Rank

#3727

Historical Rank

#915

USA Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Prasad V. Tetali's Degrees

PhD Mathematics University of California, Berkeley
Masters Mathematics University of California, Berkeley

Why Is Prasad V. Tetali Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Prasad V. Tetali is an Indian-American mathematician and computer scientist who works as a professor at Carnegie Mellon University. His research concerns probability theory, discrete mathematics, and approximation algorithms.

(See a Problem?)

Prasad V. Tetali's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Random walks and the effective resistance of networks (1991) (325)
Mathematical Aspects of Mixing Times in Markov Chains (2006) (306)
Approximation and online algorithms for multidimensional bin packing: A survey (2017) (169)
Simple Markov-chain algorithms for generating bipartite graphs and tournaments (1997) (162)
Modified Logarithmic Sobolev Inequalities in Discrete Settings (2006) (159)
Approximating Min Sum Set Cover (2004) (158)
Analyzing Glauber Dynamics by Comparison of Markov Chains (1998) (150)
Simple deterministic approximation algorithms for counting matchings (2007) (136)
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs (2009) (135)
Information Inequalities for Joint Distributions, With Interpretations and Applications (2008) (125)
Torpid mixing of some Monte Carlo Markov chain algorithms in statistical physics (1999) (113)
Kantorovich duality for general transport costs and applications (2014) (106)
Elementary bounds on Poincaré and log-Sobolev constants for decomposable Markov chains (2004) (94)
Many sparse cuts via higher eigenvalues (2011) (84)
Mixing Time Bounds via the Spectral Profile (2005) (80)
Communication Complexity and Quasi Randomness (1993) (77)
On Weighted Graph Homomorphisms (2012) (75)
Discrete Curvature and Abelian Groups (2015) (70)
On Playing Golf with Two Balls (2003) (70)
Simple Markov-Chain Algorithms for Generating Bipartite Graphs and Tournaments (Extended Abstract) (1999) (70)
Limits on the efficiency of one-way permutation-based hash functions (1999) (68)
Representations of Integers as the Sum of k Terms (1990) (67)
Reconstruction and Clustering in Random Constraint Satisfaction Problems (2009) (66)
Ramsey Games Against a One-Armed Bandit (2003) (58)
Distributed Random Walks (2013) (57)
Tight bounds for mixing of the Swendsen–Wang algorithm at the Potts transition point (2010) (57)
On smoothed analysis in dense graphs and formulas (2006) (55)
G-parking functions, acyclic orientations and spanning trees (2008) (54)
Isoperimetric Inequalities for Cartesian Products of Graphs (1998) (51)
Approximations for the isoperimetric and spectral profile of graphs and related parameters (2010) (51)
Improved mixing condition on the grid for counting and sampling independent sets (2011) (50)
Entropy and set cardinality inequalities for partition‐determined functions (2008) (50)
Medium Access Using Queues (2011) (50)
Collisions Among Random Walks on a Graph (1993) (49)
On a random walk problem arising in self-stabilizing token management (1991) (48)
Random Walks with Lookahead on Power Law Random Graphs (2006) (48)
Displacement convexity of entropy and related inequalities on graphs (2012) (47)
, Vertex Isoperimetry and Concentration (2000) (46)
On the mixing time of the triangulation walk and other Catalan structures (1997) (44)
A sharp threshold for random graphs with a monochromatic triangle in every edge coloring (2003) (42)
An Extension of Foster's Network Theorem (1994) (41)
A Birthday Paradox for Markov Chains, with an Optimal Bound for Collision in the Pollard Rho Algorithm for Discrete Logarithm (2007) (41)
Slow mixing of Glauber dynamics for the hard‐core model on regular bipartite graphs (2006) (39)
The Number of Linear Extensions of the Boolean Lattice (2003) (37)
Discrete Ricci curvature bounds for Bernoulli-Laplace and random transposition models (2014) (37)
On the chromatic number of set systems (2001) (36)
A note on expected hitting times for birth and death chains (1996) (36)
Characterization of a class of weak transport-entropy inequalities on the line (2015) (35)
Matchings and independent sets of a fixed size in regular graphs (2009) (35)
Efficient distributed random walks with applications (2009) (33)
Stochastic Matching with Commitment (2012) (33)
Approximate tensorization of entropy at high temperature (2014) (31)
The subgaussian constant and concentration inequalities (2006) (28)
Two‐coloring random hypergraphs (2002) (26)
Algorithmic Extensions of Cheeger's Inequality to Higher Eigenvalues and Partitions (2011) (26)
Modified log-sobolev inequalities, mixing and hypercontractivity (2003) (26)
Design of on-line algorithms using hitting times (1994) (26)
Near Optimal Bounds for Collision in Pollard Rho for Discrete Log (2006) (26)
Ricci curvature bounds for weakly interacting Markov chains (2016) (25)
Phase Coexistence and Slow Mixing for the Hard-Core Model on ℤ2 (2012) (24)
Phase transition for the mixing time of the Glauber dynamics for coloring regular trees (2009) (24)
Approximating Min-sum Set Cover (2002) (24)
Efficient sampling and counting algorithms for the Potts model on ℤᵈ at all temperatures (2020) (22)
On the Widom–Rowlinson Occupancy Fraction in Regular Graphs (2015) (21)
Isoperimetric Invariants For Product Markov Chains and Graph Products (2004) (21)
Reconstruction Threshold for the Hardcore Model (2010) (20)
A Markov chain model for an optical shared-memory packet switch (1999) (20)
Multidimensional Bin Packing and Other Related Problems : A Survey ∗ (2016) (19)
Optimal linear arrangement of a rectangular grid (2000) (18)
Concentration of Measure for Products of Markov Kernels and Graph Products via Functional Inequalities (2001) (18)
How long does it take to catch a wild kangaroo? (2008) (18)
Mutation, Sexual Reproduction and Survival in Dynamic Environments (2015) (17)
The Multistate Hard Core Model on a Regular Tree (2010) (17)
Lattice Path Matroids: Negative Correlation and Fast Mixing (2015) (17)
The discrepancy of permutation families (1997) (16)
Decay of Correlations for the Hardcore Model on the $d$-regular Random Graph (2014) (15)
The correlation decay (CD) tree and strong spatial mixing in multi-spin systems (2007) (15)
Concentration on the Discrete Torus Using Transportation (2009) (15)
Information-theoretic inequalities in additive combinatorics (2010) (15)
Randomized greedy: new variants of some classic approximation algorithms (2011) (14)
Random Sampling of Euler Tours (1997) (14)
Covering with Latin Transversals (1995) (14)
Inverse Expander Mixing for Hypergraphs (2014) (14)
PR ] 2 0 Se p 20 19 EFFICIENT SAMPLING AND COUNTING ALGORITHMS FOR THE POTTS MODEL ON Z d AT ALL TEMPERATURES (13)
On sharp transitions in making squares (2008) (13)
Two-coloring random hypergraphs (2002) (12)
Minimal Completely Separating Systems of k-Sets (2001) (11)
Sandwich bounds for joint entropy (2007) (11)
Approximating Minimum Linear Ordering Problems (2012) (11)
Analysis of Top-Swap Shuffling for Genome Rearrangements. (2006) (11)
Phase Coexistence for the Hard-Core Model on ℤ2 (2018) (10)
Concentration Properties of Restricted Measures with Applications to Non-Lipschitz Functions (2015) (10)
Transport Proofs of some discrete variants of the Prékopa-Leindler inequality (2019) (9)
Running Time Predictions for Factoring Algorithms (2008) (9)
On the Sampling Problem for H-Colorings on the Hypercubic Lattice (2001) (9)
Finding cliques using few probes (2018) (9)
Improved Approximations for Min Sum Vertex Cover and Generalized Min Sum Set Cover (2020) (9)
Convergence to global equilibrium for Fokker-Planck equations on a graph and Talagrand-type inequalities (2014) (8)
Counting Antichains and Linear Extensions in Generalizations of the Boolean Lattice (2012) (8)
The Widom-Rowlinson model, the hard-core model and the extremality of the complete graph (2016) (8)
On sampling graphical Markov models (2017) (7)
Slow mixing of Glauber dynamics for the hard-core model on the hypercube (2004) (7)
Meander Graphs (2009) (7)
A Characterization of Unique Tournaments (1998) (7)
Support-theoretic subgraph preconditioners for large-scale SLAM (2013) (7)
Recent trends in combinatorics (2016) (6)
Score certificates for tournaments (1997) (5)
Volume Growth, Curvature, and Buser-Type Inequalities in Graphs (2018) (5)
SIDON SETS WITH SMALL GAPS (1995) (5)
Phase transition for the mixing time of the Glauber dynamics for coloring regular trees (2012) (5)
Algorithms for Sampling 3-Orientations of Planar Triangulations (2012) (5)
On the number of independent sets in uniform, regular, linear hypergraphs (2020) (4)
Phase Coexistence for the Hard-Core Model on ${\mathbb Z}^2$ (2016) (4)
On randomizing two derandomized greedy algorithms (2010) (4)
Improved mixing condition on the grid for counting and sampling independent sets (2012) (4)
The Distribution of Second Degrees in the Buckley–Osthus Random Graph Model (2013) (4)
Independence of solution sets and minimal asymptotic bases (1995) (4)
Mixing times of Markov chains on 3-Orientations of Planar Triangulations (2012) (4)
Efficient Distributed Medium Access (2011) (4)
THE FINITE-STATE HARD CORE MODEL ON A REGULAR TREE (2009) (4)
Sampling and Counting 3-Orientations of Planar Triangulations (2016) (4)
A Tight Bound for the Lamplighter Problem (2006) (3)
Markov Chain-Based Sampling for Exploring RNA Secondary Structure under the Nearest Neighbor Thermodynamic Model and Extended Applications (2020) (3)
Toppleable permutations, excedances and acyclic orientations (2020) (3)
The game of survival: Sexual evolution in dynamic environments (2015) (2)
Determinant Maximization via Matroid Intersection Algorithms (2022) (2)
Near-Optimal Sublinear Time Bounds for Distributed Random Walks (2009) (2)
Two-oloring Random Hypergraphs (2001) (2)
The Traveling Firefighter Problem (2021) (2)
On the Bipartiteness Constant and Expansion of Cayley Graphs (2020) (2)
Parking Functions and Acyclic Orientations of Graphs (2008) (2)
Matching with Commitments (2012) (1)
Efficient sampling and counting algorithms for the Potts model on $\mathbb Z^d$ at all temperatures (2019) (1)
A Near Optimal Bound for Pollard's Rho to Solve Discrete Log (2006) (1)
A family of switch equivalent graphs (2004) (1)
On the trade-off between rate and performance of expander codes on AWGN channels (2004) (1)
Finding Sparse Cuts via Cheeger Inequalities for Higher Eigenvalues (2012) (1)
Sharp Transitions in Making Squares Ernie Croot (1)
PR ] 3 N ov 2 01 6 Phase Coexistence for the Hard-Core Model on Z 2 (2016) (0)
Information inequalities and combinatorial applications (2011) (0)
On the zeroes of hypergraph independence polynomials (2022) (0)
On the Complexity and Approximation of λ∞ Spread Constant and Maximum Variance Embedding (2020) (0)
SAMPLING AND COUNTING 3-ORIENTATIONS OF PLANAR (2016) (0)
Tight bounds for mixing of the Swendsen–Wang algorithm at the Potts transition point (2010) (0)
Combinatorics, Geometry and Probability: An Extension of Foster's Network Theorem (1997) (0)
Random Sampling of Euler Tours 1 (0)
Hardness and Approximation of Submodular Minimum Linear Ordering Problems (2021) (0)
On Min Sum Vertex Cover and Generalized Min Sum Set Cover (2023) (0)
Report on Recent Research Prasad (0)
Information-theoretic Inequalities in Additive Combinatorics ( Invited Paper ) (2009) (0)
Long common subsequence problems (1992) (0)
Special Section on Constraint Satisfaction Problems and Message Passing Algorithms (2011) (0)
Complexity and Quasi-randomness 1 (2005) (0)
On the Complexity of $\lambda_\infty\,,$ Vertex Expansion, and Spread Constant of Trees (2020) (0)
Erratum to minimal completely separating systems of k -sets (2003) (0)
ARC Proposal: Preconditioning in non-Laplacian case (2012) (0)
A Note on Sumsets using Entropy (2008) (0)
D C ] 1 9 Fe b 20 13 Distributed Random Walks ∗ (2013) (0)
$\lambda_\infty$&Maximum Variance Embedding: Measuring and Optimizing Connectivity of A Graph Metric (2020) (0)
Kruskal's Principle and Collision Time for Monotone Transitive Walks on the Integers (2014) (0)
Edge Flip Random Walk on Chordal Graphs (2017) (0)
Computation tree and strong spatial mixing in multi-spin systems (2007) (0)
On the Complexity and Approximation of $\lambda_\infty\,,$ Spread Constant and Maximum Variance Embedding (2020) (0)
Multi Purpose Routing: New Perspectives and Approximation Algorithms (2022) (0)
Displacement convexity of entropy and related inequalities on graphs (2013) (0)
lambdainfty Vertex Isoperimetry and Concentration (2000) (0)
Applications and Analysis of Probabilistic Techniques (1991) (0)
C O ] 2 3 O ct 2 01 5 Discrete curvature and abelian groups (2015) (0)
Algebraic Connectivity Under Site Percolation in Finite Weighted Graphs (2016) (0)

This paper list is powered by the following services:

Other Resources About Prasad V. Tetali

en.wikipedia.org

What Schools Are Affiliated With Prasad V. Tetali?

Prasad V. Tetali is affiliated with the following schools:

Prasad V. Tetali's Academic­Influence.com Rankings

Prasad V. Tetali's Degrees

Why Is Prasad V. Tetali Influential?

Prasad V. Tetali's Published Works

Published Works

Other Resources About Prasad V. Tetali

What Schools Are Affiliated With Prasad V. Tetali?

Prasad V. Tetali's AcademicInfluence.com Rankings