| & Maximum Variance Embedding: Measuring and Optimizing Connectivity of A Graph Metric M Farhadi, A Louis, M Singh, P Tetali arXiv preprint arXiv:2003.05582, 2020 | | 2020 |
| 5 Lower bounds on mixing times and their consequences R Montenegro, P Tetali Foundations and Trends in Theoretical Computer Science 1 (3), 298-298, 2006 | | 2006 |
| 8 Open problems R Montenegro, P Tetali Foundations and Trends in Theoretical Computer Science 1 (3), 344-344, 2006 | | 2006 |
| 8th Innovations in Theoretical Computer Science Conference (ITCS 2017) JR Lee, I Panageas, G Piliouras, Z Allen-Zhu, L Orecchia, T Kaufman, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2017 | 2 | 2017 |
| A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm JH Kim, R Montenegro, Y Peres, P Tetali | 30 | 2010 |
| A birthday paradox for Markov chains, with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm JH Kim, R Montenegro, Y Peres, P Tetali International Algorithmic Number Theory Symposium, 402-415, 2008 | 26 | 2008 |
| A characterization of unique tournaments P Tetali J. Comb. Theory, Ser. B 72 (1), 157-159, 1998 | 12 | 1998 |
| A family of switch equivalent graphs B Guenin, D Mubayi, P Tetali Discrete mathematics 288 (1-3), 29-35, 2004 | 1 | 2004 |
| A markov chain model for an optical shared-memory packet switch PD Bergstrom, MA Ingram, AJ Vernon, JLA Hughes, P Tetali IEEE transactions on communications 47 (10), 1593-1603, 1999 | 24 | 1999 |
| A near optimal bound for Pollard’s rho to solve discrete log’ JH Kim, R Montenegro, P Tetali IEEE Proc. of the Foundations of Computer Science (FOCS), 2007 | 5 | 2007 |
| A note on expected hitting times for birth and death chains JL Palacios, P Tetali Statistics & Probability Letters 30 (2), 119-125, 1996 | 49 | 1996 |
| A Note on Sumsets using Entropy A Marcus, P Tetali | | |
| A sharp threshold for random graphs with a monochromatic triangle in every edge coloring E Friedgut, V Rodl, A Rucinski, P Tetali arXiv preprint math/0301200, 2003 | 2 | 2003 |
| A sharp threshold for random graphs with a monochromatic triangle in every edge coloring E Friedgut American Mathematical Soc. 179 (845), 2006 | 50 | 2006 |
| A tight bound for the lamplighter problem MK Ganapathy, P Tetali arXiv preprint math/0610345, 2006 | 2 | 2006 |
| Algebraic Connectivity Under Site Percolation in Finite Weighted Graphs S Bahmani, J Romberg, P Tetali IEEE Transactions on Network Science and Engineering 5 (2), 86-91, 2017 | | 2017 |
| Algorithmic extensions of cheeger’s inequality to higher eigenvalues and partitions A Louis, P Raghavendra, P Tetali, S Vempala International Workshop on Approximation Algorithms for Combinatorial …, 2011 | 31 | 2011 |
| Algorithms for sampling 3-orientations of planar triangulations S Miracle, D Randall, AP Streib, P Tetali arXiv preprint arXiv:1202.4945, 2012 | 2 | 2012 |
| An extension of Foster's network theorem P Tetali Combinatorics, Probability and Computing 3 (3), 421-427, 1994 | 46 | 1994 |
| Analysis of top-swap shuffling for genome rearrangements N Bhatnagar, P Caputo, P Tetali, E Vigoda | 15 | 2007 |
