Prasad Tetali

From MaRDI portal
Person:247100

Available identifiers

zbMath Open tetali.prasadWikidataQ19664569 ScholiaQ19664569MaRDI QIDQ247100

List of research outcomes





PublicationDate of PublicationType
On min sum vertex cover and generalized min sum set cover2025-01-14Paper
Hardness and approximation of submodular minimum linear ordering problems2024-11-07Paper
On the zeroes of hypergraph independence polynomials2024-11-05Paper
Efficient sampling and counting algorithms for the Potts model on d at all temperatures2023-10-12Paper
Note on the number of antichains in generalizations of the Boolean lattice2023-05-25Paper
On the zeroes of hypergraph independence polynomials2022-11-01Paper
On the bipartiteness constant and expansion of Cayley graphs2022-04-07Paper
Volume Growth, Curvature, and Buser-Type Inequalities in Graphs2022-01-18Paper
Transport proofs of some discrete variants of the Prékopa-Leindler inequality2021-11-01Paper
On the number of independent sets in uniform, regular, linear hypergraphs2021-10-28Paper
Efficient sampling and counting algorithms for the Potts model on ℤᵈ at all temperatures2021-01-19Paper
Finding cliques using few probes2020-06-19Paper
Phase Coexistence for the Hard-Core Model on ℤ22020-03-11Paper
Efficient sampling and counting algorithms for the Potts model on $\mathbb Z^d$ at all temperatures2019-09-19Paper
Characterization of a class of weak transport-entropy inequalities on the line2018-11-09Paper
Mutation, Sexual Reproduction and Survival in Dynamic Environments2018-05-03Paper
On the Widom–Rowlinson Occupancy Fraction in Regular Graphs2017-10-10Paper
https://portal.mardi4nfdi.de/entity/Q53650692017-09-29Paper
Kantorovich duality for general transport costs and applications2017-09-29Paper
Approximation and online algorithms for multidimensional bin packing: a survey2017-08-31Paper
Information Inequalities for Joint Distributions, With Interpretations and Applications2017-07-27Paper
Concentration Properties of Restricted Measures with Applications to Non-Lipschitz Functions2017-07-13Paper
On sampling graphical Markov models2017-05-26Paper
Ricci curvature bounds for weakly interacting Markov chains2017-05-02Paper
The Widom-Rowlinson model, the hard-core model and the extremality of the complete graph2017-03-28Paper
https://portal.mardi4nfdi.de/entity/Q29599782017-02-10Paper
Algebraic Connectivity Under Site Percolation in Finite Weighted Graphs2016-12-18Paper
Discrete curvature and abelian groups2016-06-03Paper
Convergence to global equilibrium for Fokker-Planck equations on a graph and Talagrand-type inequalities2016-05-27Paper
The distribution of second degrees in the Buckley-Osthus random graph model2016-05-25Paper
Decay of correlations for the hardcore model on the \(d\)-regular random graph2016-05-23Paper
Inverse expander mixing for hypergraphs2016-05-11Paper
Sampling and counting 3-orientations of planar triangulations2016-05-09Paper
Discrete Ricci curvature bounds for Bernoulli-Laplace and random transposition models2016-02-19Paper
Approximate tensorization of entropy at high temperature2016-02-19Paper
https://portal.mardi4nfdi.de/entity/Q55017962015-08-14Paper
https://portal.mardi4nfdi.de/entity/Q55012932015-08-03Paper
On a random walk problem arising in self-stabilizing token management2015-06-19Paper
Lattice Path Matroids: Negative Correlation and Fast Mixing2015-05-25Paper
Efficient distributed random walks with applications2015-03-02Paper
How long does it take to catch a wild kangaroo?2015-02-04Paper
Displacement convexity of entropy and related inequalities on graphs2014-10-31Paper
Mixing times of Markov chains on 3-orientations of planar triangulations2014-09-29Paper
Approximations for the isoperimetric and spectral profile of graphs and related parameters2014-08-13Paper
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs2014-08-13Paper
Improved mixing condition on the grid for counting and sampling independent sets2014-07-30Paper
Medium Access Using Queues2014-07-30Paper
https://portal.mardi4nfdi.de/entity/Q54177382014-05-22Paper
Many sparse cuts via higher eigenvalues2014-05-13Paper
Distributed Random Walks2014-02-17Paper
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs2014-01-31Paper
Phase Coexistence and Slow Mixing for the Hard-Core Model on ℤ22013-10-04Paper
Stochastic Matching with Commitment2013-08-12Paper
Improved mixing condition on the grid for counting and sampling independent sets2013-06-19Paper
Phase transition for the mixing time of the Glauber dynamics for coloring regular trees2013-01-25Paper
Approximating Minimum Linear Ordering Problems2012-11-02Paper
Entropy and set cardinality inequalities for partition-determined functions2012-08-14Paper
On sharp transitions in making squares2012-06-29Paper
Tight bounds for mixing of the Swendsen-Wang algorithm at the Potts transition point2012-04-26Paper
The Multistate Hard Core Model on a Regular Tree2011-10-27Paper
Reconstruction and Clustering in Random Constraint Satisfaction Problems2011-10-27Paper
Algorithmic Extensions of Cheeger’s Inequality to Higher Eigenvalues and Partitions2011-08-17Paper
On randomizing two derandomized greedy algorithms2011-06-27Paper
Reconstruction Threshold for the Hardcore Model2010-09-10Paper
Mathematical Aspects of Mixing Times in Markov Chains2010-09-08Paper
Modified log-sobolev inequalities, mixing and hypercontractivity2010-08-16Paper
A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm2010-05-06Paper
\(G\)-parking functions, acyclic orientations and spanning trees2010-04-27Paper
Concentration on the Discrete Torus Using Transportation2010-04-22Paper
Matchings and independent sets of a fixed size in regular graphs2009-11-26Paper
https://portal.mardi4nfdi.de/entity/Q35496062009-01-05Paper
Running Time Predictions for Factoring Algorithms2008-05-27Paper
A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm2008-05-27Paper
The sub-Gaussian constant and concentration inequalities2008-02-22Paper
Analysis of top-swap shuffling for genome rearrangements2008-01-28Paper
Random Walks with Lookahead on Power Law Random Graphs2007-08-20Paper
Modified logarithmic Sobolev inequalities in discrete settings2007-02-14Paper
On smoothed analysis in dense graphs and formulas2007-02-07Paper
The correlation decay (CD) tree and strong spatial mixing in multi-spin systems2007-01-17Paper
Near Optimal Bounds for Collision in Pollard Rho for Discrete Log2006-11-19Paper
Mixing time bounds via the spectral profile2006-11-03Paper
A Tight Bound for the Lamplighter Problem2006-10-10Paper
Slow mixing of Glauber dynamics for the hard‐core model on regular bipartite graphs2006-09-06Paper
A sharp threshold for random graphs with a monochromatic triangle in every edge coloring2006-03-21Paper
Isoperimetric invariants for product Markov chains and graph products2005-07-05Paper
The number of linear extensions of the Boolean lattice2005-04-07Paper
On weighted graph homomorphisms2005-04-04Paper
https://portal.mardi4nfdi.de/entity/Q46607172005-04-04Paper
Elementary bounds on Poincaré and log-Sobolev constants for decomposable Markov chains2005-03-21Paper
Ramsey Games Against a One-Armed Bandit2005-03-08Paper
A family of switch equivalent graphs2005-01-13Paper
Approximating min sum set cover2004-11-05Paper
On Playing Golf with Two Balls2004-01-08Paper
https://portal.mardi4nfdi.de/entity/Q44112802003-07-07Paper
Two‐coloring random hypergraphs2002-08-08Paper
Concentration of measure for products of Markov kernels and graph products via functional inequalities2002-06-03Paper
Minimal completely separating systems of \(k\)-sets2002-02-17Paper
On the chromatic number of set systems2002-02-10Paper
Random sampling of Euler tours2001-10-14Paper
Analyzing Glauber dynamics by comparison of Markov chains2001-08-30Paper
\(\lambda_{\infty}\), vertex isoperimetry and concentration2001-04-01Paper
Optimal linear arrangement of a rectangular grid2000-12-03Paper
https://portal.mardi4nfdi.de/entity/Q42622201999-11-11Paper
Design of On-Line Algorithms Using Hitting Times1999-10-28Paper
Isoperimetric Inequalities for Cartesian Products of Graphs1999-04-23Paper
https://portal.mardi4nfdi.de/entity/Q42249301999-03-18Paper
https://portal.mardi4nfdi.de/entity/Q38390101999-03-04Paper
A characterization of unique tournaments1998-11-26Paper
https://portal.mardi4nfdi.de/entity/Q43479141998-01-22Paper
Score certificates for tournaments1997-06-29Paper
A note on expected hitting times for birth and death chains1997-06-02Paper
https://portal.mardi4nfdi.de/entity/Q31289011997-04-23Paper
https://portal.mardi4nfdi.de/entity/Q48452621996-03-11Paper
Covering with Latin transversals1995-07-11Paper
Independence of solution sets and minimal asymptotic bases1995-06-28Paper
An Extension of Foster's Network Theorem1995-02-14Paper
https://portal.mardi4nfdi.de/entity/Q42846301994-04-18Paper
Collisions Among Random Walks on a Graph1993-10-14Paper
Communication Complexity and Quasi Randomness1993-06-29Paper
Random walks and the effective resistance of networks1991-01-01Paper
Representations of integers as the sum of k terms1990-01-01Paper

Research outcomes over time

This page was built for person: Prasad Tetali