Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarPrasad Tetali
Person information
- affiliation: Georgia Institute of Technology, Atlanta, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2018
[j44]Sohail Bahmani, Justin Romberg, Prasad Tetali:
Algebraic Connectivity Under Site Percolation in Finite Weighted Graphs. IEEE Trans. Network Science and Engineering 5(2): 86-91 (2018)- [i20]Uriel Feige, David Gamarnik, Joe Neeman, Miklós Z. Rácz, Prasad Tetali:
Finding cliques using few probes. CoRR abs/1809.06950 (2018) - 2017
- [j43]Emma Cohen, Will Perkins, Prasad Tetali:
On the Widom-Rowlinson Occupancy Fraction in Regular Graphs. Combinatorics, Probability & Computing 26(2): 183-194 (2017) - [j42]Henrik I. Christensen, Arindam Khan, Sebastian Pokutta, Prasad Tetali:
Approximation and online algorithms for multidimensional bin packing: A survey. Computer Science Review 24: 63-79 (2017) - [j41]Emma Cohen, Péter Csikvári, Will Perkins, Prasad Tetali:
The Widom-Rowlinson model, the hard-core model and the extremality of the complete graph. Eur. J. Comb. 62: 70-76 (2017) - [c35]Ruta Mehta, Ioannis Panageas, Georgios Piliouras, Prasad Tetali, Vijay V. Vazirani:
Mutation, Sexual Reproduction and Survival in Dynamic Environments. ITCS 2017: 16:1-16:29 - 2016
- [j40]Emma Cohen, Dhruv Mubayi, Peter Ralli, Prasad Tetali:
Inverse Expander Mixing for Hypergraphs. Electr. J. Comb. 23(2): P2.20 (2016) - [j39]Sarah Miracle, Dana Randall, Amanda Pascoe Streib, Prasad Tetali:
Sampling and Counting 3-Orientations of Planar Triangulations. SIAM J. Discrete Math. 30(2): 801-831 (2016) - [i19]Antonio Blanca, Yuxuan Chen, David Galvin, Dana Randall, Prasad Tetali:
Phase Coexistence for the Hard-Core Model on ${\mathbb Z}^2$. CoRR abs/1611.01115 (2016) - [i18]Sohail Bahmani, Justin K. Romberg, Prasad Tetali:
Algebraic Connectivity Under Site Percolation in Finite Weighted Graphs. CoRR abs/1612.05986 (2016) - 2015
- [i17]Ruta Mehta, Ioannis Panageas, Georgios Piliouras, Prasad Tetali, Vijay V. Vazirani:
The game of survival: Sexual evolution in dynamic environments. CoRR abs/1511.01409 (2015) - 2013
- [j38]Andrey Kupavskii, Liudmila Ostroumova, Dmitry A. Shabanov, Prasad Tetali:
The Distribution of Second Degrees in the Buckley-Osthus Random Graph Model. Internet Mathematics 9(4): 297-335 (2013) - [j37]Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali:
Distributed Random Walks. J. ACM 60(1): 2:1-2:31 (2013) - [c34]Antonio Blanca, David Galvin, Dana Randall, Prasad Tetali:
Phase Coexistence and Slow Mixing for the Hard-Core Model on ℤ2. APPROX-RANDOM 2013: 379-394 - [c33]Yong-Dian Jian, Doru Balcan, Ioannis Panageas, Prasad Tetali, Frank Dellaert:
Support-theoretic subgraph preconditioners for large-scale SLAM. IROS 2013: 9-16 - [i16]Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali:
Distributed Random Walks. CoRR abs/1302.4544 (2013) - [i15]Andrey Kupavskii, Liudmila Ostroumova, Dmitry A. Shabanov, Prasad Tetali:
The distribution of second degrees in the Buckley-Osthus random graph model. CoRR abs/1304.5715 (2013) - 2012
- [j36]Mokshay M. Madiman, Adam W. Marcus, Prasad Tetali:
Entropy and set cardinality inequalities for partition-determined functions. Random Struct. Algorithms 40(4): 399-424 (2012) - [c32]Satoru Iwata, Prasad Tetali, Pushkar Tripathi:
Approximating Minimum Linear Ordering Problems. APPROX-RANDOM 2012: 206-217 - [c31]Kevin P. Costello, Prasad Tetali, Pushkar Tripathi:
Stochastic Matching with Commitment. ICALP (1) 2012: 822-833 - [c30]Anand Louis, Prasad Raghavendra, Prasad Tetali, Santosh Vempala:
Many sparse cuts via higher eigenvalues. STOC 2012: 1131-1140 - [i14]Sarah Miracle, Dana Randall, Amanda Pascoe Streib, Prasad Tetali:
Algorithms for Sampling 3-Orientations of Planar Triangulations. CoRR abs/1202.4945 (2012) - [i13]Kevin P. Costello, Prasad Tetali, Pushkar Tripathi:
Matching with Commitments. CoRR abs/1205.1721 (2012) - [i12]David Galvin, Prasad Tetali:
Slow mixing of Glauber Dynamics for the hard-core model on regular bipartite graphs. CoRR abs/1206.3165 (2012) - [i11]Arindam Khan, Prasad Raghavendra, Prasad Tetali, László A. Végh:
On Mimicking Networks Representing Minimum Terminal Cuts. CoRR abs/1207.6371 (2012) - [i10]Antonio Blanca, David Galvin, Dana Randall, Prasad Tetali:
Phase Coexistence and Slow Mixing for the Hard-Core Model on Z^2. CoRR abs/1211.6182 (2012) - 2011
- [j35]Marc Mézard, Prasad Tetali:
Special Section on Constraint Satisfaction Problems and Message Passing Algorithms. SIAM J. Discrete Math. 25(2): 733-735 (2011) - [j34]Andrea Montanari, Ricardo Restrepo, Prasad Tetali:
Reconstruction and Clustering in Random Constraint Satisfaction Problems. SIAM J. Discrete Math. 25(2): 771-808 (2011) - [j33]David Galvin, Fabio Martinelli, Kavita Ramanan, Prasad Tetali:
The Multistate Hard Core Model on a Regular Tree. SIAM J. Discrete Math. 25(2): 894-915 (2011) - [c29]Anand Louis, Prasad Raghavendra, Prasad Tetali, Santosh Vempala:
Algorithmic Extensions of Cheeger's Inequality to Higher Eigenvalues and Partitions. APPROX-RANDOM 2011: 315-326 - [c28]Ricardo Restrepo, Jinwoo Shin, Prasad Tetali, Eric Vigoda, Linji Yang:
Improved Mixing Condition on the Grid for Counting and Sampling Independent Sets. FOCS 2011: 140-149 - [c27]
- [c26]Kevin P. Costello, Asaf Shapira, Prasad Tetali:
Randomized greedy: new variants of some classic approximation algorithms. SODA 2011: 647-655 - [i9]Devavrat Shah, Jinwoo Shin, Prasad Tetali:
Efficient Distributed Medium Access. CoRR abs/1104.2380 (2011) - [i8]Ricardo Restrepo, Jinwoo Shin, Prasad Tetali, Eric Vigoda, Linji Yang:
Improved Mixing Condition on the Grid for Counting and Sampling Independent Sets. CoRR abs/1105.0914 (2011) - [i7]Anand Louis, Prasad Raghavendra, Prasad Tetali, Santosh Vempala:
Many Sparse Cuts via Higher Eigenvalues. CoRR abs/1111.0965 (2011) - 2010
- [j32]Brian Benson, Deeparnab Chakrabarty, Prasad Tetali:
G-parking functions, acyclic orientations and spanning trees. Discrete Mathematics 310(8): 1340-1353 (2010) - [j31]Mokshay M. Madiman, Prasad Tetali:
Information inequalities for joint distributions, with interpretations and applications. IEEE Trans. Information Theory 56(6): 2699-2713 (2010) - [c25]Nayantara Bhatnagar, Allan Sly, Prasad Tetali:
Reconstruction Threshold for the Hardcore Model. APPROX-RANDOM 2010: 434-447 - [c24]Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali:
Efficient distributed random walks with applications. PODC 2010: 201-210 - [c23]Prasad Tetali, Juan Carlos Vera, Eric Vigoda, Linji Yang:
Phase Transition for the Mixing Time of the Glauber Dynamics for Coloring Regular Trees. SODA 2010: 1646-1656 - [c22]Mohsen Bayati, David Gamarnik, Prasad Tetali:
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs. STOC 2010: 105-114 - [c21]Prasad Raghavendra, David Steurer, Prasad Tetali:
Approximations for the isoperimetric and spectral profile of graphs and related parameters. STOC 2010: 631-640 - [i6]Nayantara Bhatnagar, Allan Sly, Prasad Tetali:
Reconstruction Threshold for the Hardcore Model. CoRR abs/1004.3531 (2010) - [i5]Christian Borgs, Jennifer T. Chayes, Prasad Tetali:
Tight Bounds for Mixing of the Swendsen-Wang Algorithm at the Potts Transition Point. CoRR abs/1011.3058 (2010)
2000 – 2009
- 2009
- [j30]M. Sammer, Prasad Tetali:
Concentration on the Discrete Torus Using Transportation. Combinatorics, Probability & Computing 18(5): 835-860 (2009) - [j29]Teena Carroll, David Galvin, Prasad Tetali:
Matchings and independent sets of a fixed size in regular graphs. J. Comb. Theory, Ser. A 116(7): 1219-1227 (2009) - [c20]
- [i4]Mokshay M. Madiman, Prasad Tetali:
Information Inequalities for Joint Distributions, with Interpretations and Applications. CoRR abs/0901.0044 (2009) - [i3]Mokshay M. Madiman, Adam Marcus, Prasad Tetali:
Entropy and set cardinality inequalities for partition-determined functions, with applications to sumsets. CoRR abs/0901.0055 (2009) - [i2]Andrea Montanari, Ricardo Restrepo, Prasad Tetali:
Reconstruction and Clustering in Random Constraint Satisfaction Problems. CoRR abs/0904.2751 (2009) - [i1]Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali:
Near-Optimal Sublinear Time Bounds for Distributed Random Walks. CoRR abs/0911.3195 (2009) - 2008
- [c19]Ernie Croot, Andrew Granville, Robin Pemantle, Prasad Tetali:
Running Time Predictions for Factoring Algorithms. ANTS 2008: 1-36 - [c18]Jeong Han Kim, Ravi Montenegro, Yuval Peres, Prasad Tetali:
A Birthday Paradox for Markov Chains, with an Optimal Bound for Collision in the Pollard Rho Algorithm for Discrete Logarithm. ANTS 2008: 402-415 - 2007
- [j28]Milena Mihail, Amin Saberi, Prasad Tetali:
Random Walks with Lookahead on Power Law Random Graphs. Internet Mathematics 3(2): 147-152 (2007) - [c17]Jeong Han Kim, Ravi Montenegro, Prasad Tetali:
Near Optimal Bounds for Collision in Pollard Rho for Discrete Log. FOCS 2007: 215-223 - [c16]
- [c15]Mohsen Bayati, David Gamarnik, Dimitriy A. Katz, Chandra Nair, Prasad Tetali:
Simple deterministic approximation algorithms for counting matchings. STOC 2007: 122-127 - 2006
- [j27]David Galvin, Prasad Tetali:
Slow mixing of Glauber dynamics for the hard-core model on regular bipartite graphs. Random Struct. Algorithms 28(4): 427-443 (2006) - [j26]Michael Krivelevich, Benny Sudakov, Prasad Tetali:
On smoothed analysis in dense graphs and formulas. Random Struct. Algorithms 29(2): 180-193 (2006) - 2005
- [j25]Ravi Montenegro, Prasad Tetali:
Mathematical Aspects of Mixing Times in Markov Chains. Foundations and Trends in Theoretical Computer Science 1(3) (2005) - 2004
- [j24]Uriel Feige, László Lovász, Prasad Tetali:
Approximating Min Sum Set Cover. Algorithmica 40(4): 219-234 (2004) - [j23]Christian Houdré, Prasad Tetali:
Isoperimetric Invariants For Product Markov Chains and Graph Products. Combinatorica 24(3): 359-388 (2004) - [j22]Bertrand Guenin, Dhruv Mubayi, Prasad Tetali:
A family of switch equivalent graphs. Discrete Mathematics 288(1-3): 29-35 (2004) - [c14]David Galvin, Prasad Tetali:
Slow mixing of Glauber dynamics for the hard-core model on the hypercube. SODA 2004: 466-467 - 2003
- [j21]Ehud Friedgut, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Prasad Tetali:
Ramsey Games Against a One-Armed Bandit. Combinatorics, Probability & Computing 12(5-6): 515-545 (2003) - [j20]Graham R. Brightwell, Prasad Tetali:
The Number of Linear Extensions of the Boolean Lattice. Order 20(4): 333-345 (2003) - [j19]Ioana Dumitriu, Prasad Tetali, Peter Winkler:
On Playing Golf with Two Balls. SIAM J. Discrete Math. 16(4): 604-615 (2003) - [c13]Sergey Bobkov, Prasad Tetali:
Modified log-sobolev inequalities, mixing and hypercontractivity. STOC 2003: 287-296 - 2002
- [j18]Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali:
Two-coloring random hypergraphs. Random Struct. Algorithms 20(2): 249-259 (2002) - [c12]
- 2001
- [j17]
- [j16]Christian Houdré, Prasad Tetali:
Concentration Of Measure For Products Of Markov Kernels And Graph Products Via Functional Inequalities. Combinatorics, Probability & Computing 10(1): 1-28 (2001) - [j15]André Kündgen, Dhruv Mubayi, Prasad Tetali:
Minimal Completely Separating Systems of k-Sets. J. Comb. Theory, Ser. A 93(1): 192-198 (2001) - [j14]Alexandr V. Kostochka, Dhruv Mubayi, Vojtech Rödl, Prasad Tetali:
On the chromatic number of set systems. Random Struct. Algorithms 19(2): 87-98 (2001) - [c11]Christian Borgs, Jennifer T. Chayes, Martin E. Dyer, Prasad Tetali:
On the Sampling Problem for H-Colorings on the Hypercubic Lattice. Graphs, Morphisms and Statistical Physics 2001: 13-28 - [c10]David Galvin, Prasad Tetali:
On Weighted Graph Homomorphisms. Graphs, Morphisms and Statistical Physics 2001: 97-104 - 2000
- [j13]Sergey Bobkov, Christian Houdré, Prasad Tetali:
lambdainfty Vertex Isoperimetry and Concentration. Combinatorica 20(2): 153-172 (2000) - [j12]Peter C. Fishburn, Prasad Tetali, Peter Winkler:
Optimal linear arrangement of a rectangular grid. Discrete Mathematics 213(1-3): 123-139 (2000) - [c9]Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali:
Two-coloring Random Hypergraphs. ICALP Satellite Workshops 2000: 85-96
1990 – 1999
- 1999
- [j11]Ravi Kannan, Prasad Tetali, Santosh Vempala:
Simple Markov-chain algorithms for generating bipartite graphs and tournaments. Random Struct. Algorithms 14(4): 293-308 (1999) - [j10]Prasad Tetali:
Design of On-Line Algorithms Using Hitting Times. SIAM J. Comput. 28(4): 1232-1246 (1999) - [j9]Peter D. Bergstrom Jr., Mary Ann Ingram, Andrew J. Vernon, Joseph L. A. Hughes, Prasad Tetali:
A Markov chain model for an optical shared-memory packet switch. IEEE Trans. Communications 47(10): 1593-1603 (1999) - [c8]Christian Borgs, Jennifer T. Chayes, Alan M. Frieze, Jeong Han Kim, Prasad Tetali, Eric Vigoda, Van H. Vu:
Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics. FOCS 1999: 218-229 - [c7]Jeong Han Kim, Daniel R. Simon, Prasad Tetali:
Limits on the Efficiency of One-Way Permutation-Based Hash Functions. FOCS 1999: 535-542 - 1998
- [j8]Fan R. K. Chung, Prasad Tetali:
Isoperimetric Inequalities for Cartesian Products of Graphs. Combinatorics, Probability & Computing 7(2): 141-148 (1998) - [j7]Prasad Tetali:
A Characterization of Unique Tournaments. J. Comb. Theory, Ser. B 72(1): 157-159 (1998) - [c6]Dana Randall, Prasad Tetali:
Analyzing Glauber Dynamics by Comparison of Markov Chains. LATIN 1998: 292-304 - 1997
- [j6]Jeong Han Kim, Prasad Tetali, Peter C. Fishburn:
Score certificates for tournaments. Journal of Graph Theory 24(2): 117-138 (1997) - [c5]Lisa McShine, Prasad Tetali:
On the mixing time of the triangulation walk and other Catalan structures. Randomization Methods in Algorithm Design 1997: 147-160 - [c4]
- [c3]Ravi Kannan, Prasad Tetali, Santosh Vempala:
Simple Markov-Chain Algorithms for Generating Bipartite Graphs and Tournaments (Extended Abstract). SODA 1997: 193-200 - 1995
- [j5]Noga Alon, Joel Spencer, Prasad Tetali:
Covering with Latin Transversals. Discrete Applied Mathematics 57(1): 1-10 (1995) - 1994
- [j4]Prasad Tetali:
An Extension of Foster's Network Theorem. Combinatorics, Probability & Computing 3: 421-427 (1994) - [c2]
- 1993
- [j3]Fan R. K. Chung, Prasad Tetali:
Communication Complexity and Quasi Randomness. SIAM J. Discrete Math. 6(1): 110-123 (1993) - [j2]Don Coppersmith, Prasad Tetali, Peter Winkler:
Collisions Among Random Walks on a Graph. SIAM J. Discrete Math. 6(3): 363-374 (1993) - 1991
- [c1]Prasad Tetali, Peter Winkler:
On a Random Walk Problem Arising in Self-Stabilizing Token Management. PODC 1991: 273-280 - 1990
- [j1]Paul Erdös, Prasad Tetali:
Representations of Integers as the Sum of k Terms. Random Struct. Algorithms 1(3): 245-262 (1990)
Coauthor Index
maintained by 
, founded at 
, founded at 
last updated on 2019-01-09 01:10 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
