Travelled to:1 × United Kingdom
5 × USA
Collaborated with:P.Raghavendra M.Bayati D.Gamarnik R.Montenegro S.Bobkov K.P.Costello P.Tripathi D.Steurer A.Louis S.Vempala D.A.Katz C.Nair
Talks about:approxim (2) spars (2) match (2) graph (2) hypercontract (1) isoperimetr (1) determinist (1) combinatori (1) eigenvalu (1) algorithm (1)
Person: Prasad Tetali
DBLP: Tetali:Prasad
Contributed to:
2012
20122010200920072003Wrote 7 papers:
- ICALP-v1-2012-CostelloTT #probability
- Stochastic Matching with Commitment (KPC, PT, PT), pp. 822–833.
- STOC-2012-LouisRTV
- Many sparse cuts via higher eigenvalues (AL, PR, PT, SV), pp. 1131–1140.
- STOC-2010-BayatiGT #approach #combinator #graph #random #scalability
- Combinatorial approach to the interpolation method and scaling limits in sparse random graphs (MB, DG, PT), pp. 105–114.
- STOC-2010-RaghavendraST #approximate #graph #parametricity
- Approximations for the isoperimetric and spectral profile of graphs and related parameters (PR, DS, PT), pp. 631–640.
- STOC-2009-MontenegroT #how #question
- How long does it take to catch a wild kangaroo? (RM, PT), pp. 553–560.
- STOC-2007-BayatiGKNT #algorithm #approximate
- Simple deterministic approximation algorithms for counting matchings (MB, DG, DAK, CN, PT), pp. 122–127.
- STOC-2003-BobkovT
- Modified log-sobolev inequalities, mixing and hypercontractivity (SB, PT), pp. 287–296.