| 2011 |
|---|
| 17 | Algorithmic Extensions of Cheeger's Inequality to Higher Eigenvalues and Partitions. Anand Louis, Prasad Raghavendra, Prasad Tetali, Santosh Vempala. APPROX-RANDOM 2011, 315-326. Web SearchBibTeXDownload |
| 16 | Efficient Distributed Medium Access. Devavrat Shah, Jinwoo Shin, Prasad Tetali. CoRR (abs/1104.2380) (2011). Web SearchBibTeXDownload |
| 15 | Many Sparse Cuts via Higher Eigenvalues. Anand Louis, Prasad Raghavendra, Prasad Tetali, Santosh Vempala. CoRR (abs/1111.0965) (2011). Web SearchBibTeXDownload |
| 14 | Medium Access Using Queues. Devavrat Shah, Jinwoo Shin, Prasad Tetali. FOCS 2011, 698-707. Web SearchBibTeXDownload |
| 2010 |
|---|
| 13 | Tight Bounds for Mixing of the Swendsen-Wang Algorithm at the Potts Transition Point. Christian Borgs, Jennifer T. Chayes, Prasad Tetali. CoRR (abs/1011.3058) (2010). Web SearchBibTeXDownload |
| 12 | Efficient distributed random walks with applications. Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali. PODC 2010, 201-210. Web SearchBibTeXDownload |
| 2009 |
|---|
| 11 | Near-Optimal Sublinear Time Bounds for Distributed Random Walks. Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali. CoRR (abs/0911.3195) (2009). Web SearchBibTeXDownload |
| 10 | Entropy and set cardinality inequalities for partition-determined functions, with applications to sumsets. Mokshay M. Madiman, Adam Marcus, Prasad Tetali. CoRR (abs/0901.0055) (2009). Web SearchBibTeXDownload |
| 2007 |
|---|
| 9 | Random Walks with Lookahead on Power Law Random Graphs. Milena Mihail, Amin Saberi, Prasad Tetali. Internet Mathematics (3) (2007). Web SearchBibTeX |
| 2002 |
|---|
| 8 | Two-coloring random hypergraphs. Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali. Random Struct. Algorithms (20): 249-259 (2002). Web SearchBibTeX |
| 2001 |
|---|
| 7 | Random Sampling of Euler Tours. Prasad Tetali, Santosh Vempala. Algorithmica (30): 376-385 (2001). Web SearchBibTeXDownload |
| 2000 |
|---|
| 6 | Two-coloring Random Hypergraphs. Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali. ICALP Satellite Workshops 2000, 85-96. Web SearchBibTeX |
| 1999 |
|---|
| 5 | Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics. Christian Borgs, Jennifer T. Chayes, Alan M. Frieze, Jeong Han Kim, Prasad Tetali, Eric Vigoda, Van H. Vu. FOCS 1999, 218-229. Web SearchBibTeXDownload |
| 4 | Simple Markov-chain algorithms for generating bipartite graphs and tournaments. Ravi Kannan, Prasad Tetali, Santosh Vempala. Random Struct. Algorithms (14): 293-308 (1999). Web SearchBibTeX |
| 1997 |
|---|
| 3 | Random Sampling of Euler Tours. Prasad Tetali, Santosh Vempala. RANDOM 1997, 57-66. Web SearchBibTeXDownload |
| 2 | Simple Markov-Chain Algorithms for Generating Bipartite Graphs and Tournaments (Extended Abstract). Ravi Kannan, Prasad Tetali, Santosh Vempala. SODA 1997, 193-200. Web SearchBibTeXDownload |
| 1995 |
|---|
| 1 | Covering with Latin Transversals. Noga Alon, Joel Spencer, Prasad Tetali. Discrete Applied Mathematics (57): 1-10 (1995). Web SearchBibTeXDownload |
