Prasad Tetali

Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali: Distributed Random Walks. J. ACM 60(1): 2 (2013)

Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali: Distributed Random Walks. CoRR abs/1302.4544 (2013)

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)

Satoru Iwata, Prasad Tetali, Pushkar Tripathi: Approximating Minimum Linear Ordering Problems. APPROX-RANDOM 2012: 206-217

Kevin P. Costello, Prasad Tetali, Pushkar Tripathi: Stochastic Matching with Commitment. ICALP (1) 2012: 822-833

Anand Louis, Prasad Raghavendra, Prasad Tetali, Santosh Vempala: Many sparse cuts via higher eigenvalues. STOC 2012: 1131-1140

Sarah Miracle, Dana Randall, Amanda Pascoe Streib, Prasad Tetali: Algorithms for Sampling 3-Orientations of Planar Triangulations. CoRR abs/1202.4945 (2012)

Kevin P. Costello, Prasad Tetali, Pushkar Tripathi: Matching with Commitments. CoRR abs/1205.1721 (2012)

David Galvin, Prasad Tetali: Slow mixing of Glauber Dynamics for the hard-core model on regular bipartite graphs. CoRR abs/1206.3165 (2012)

Arindam Khan, Prasad Raghavendra, Prasad Tetali, László A. Végh: On Mimicking Networks Representing Minimum Terminal Cuts. CoRR abs/1207.6371 (2012)

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)

Marc Mézard, Prasad Tetali: Special Section on Constraint Satisfaction Problems and Message Passing Algorithms. SIAM J. Discrete Math. 25(2): 733-735 (2011)

Andrea Montanari, Ricardo Restrepo, Prasad Tetali: Reconstruction and Clustering in Random Constraint Satisfaction Problems. SIAM J. Discrete Math. 25(2): 771-808 (2011)

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)

Anand Louis, Prasad Raghavendra, Prasad Tetali, Santosh Vempala: Algorithmic Extensions of Cheeger's Inequality to Higher Eigenvalues and Partitions. APPROX-RANDOM 2011: 315-326

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

Devavrat Shah, Jinwoo Shin, Prasad Tetali: Medium Access Using Queues. FOCS 2011: 698-707

Kevin P. Costello, Asaf Shapira, Prasad Tetali: Randomized greedy: new variants of some classic approximation algorithms. SODA 2011: 647-655

Devavrat Shah, Jinwoo Shin, Prasad Tetali: Efficient Distributed Medium Access. CoRR abs/1104.2380 (2011)

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)

Anand Louis, Prasad Raghavendra, Prasad Tetali, Santosh Vempala: Many Sparse Cuts via Higher Eigenvalues. CoRR abs/1111.0965 (2011)

Brian Benson, Deeparnab Chakrabarty, Prasad Tetali: G-parking functions, acyclic orientations and spanning trees. Discrete Mathematics 310(8): 1340-1353 (2010)

Mokshay M. Madiman, Prasad Tetali: Information inequalities for joint distributions, with interpretations and applications. IEEE Transactions on Information Theory 56(6): 2699-2713 (2010)

Nayantara Bhatnagar, Allan Sly, Prasad Tetali: Reconstruction Threshold for the Hardcore Model. APPROX-RANDOM 2010: 434-447

Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali: Efficient distributed random walks with applications. PODC 2010: 201-210

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

Mohsen Bayati, David Gamarnik, Prasad Tetali: Combinatorial approach to the interpolation method and scaling limits in sparse random graphs. STOC 2010: 105-114

Prasad Raghavendra, David Steurer, Prasad Tetali: Approximations for the isoperimetric and spectral profile of graphs and related parameters. STOC 2010: 631-640

Nayantara Bhatnagar, Allan Sly, Prasad Tetali: Reconstruction Threshold for the Hardcore Model. CoRR abs/1004.3531 (2010)

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)

M. Sammer, Prasad Tetali: Concentration on the Discrete Torus Using Transportation. Combinatorics, Probability & Computing 18(5): 835-860 (2009)

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)

Ravi Montenegro, Prasad Tetali: How long does it take to catch a wild kangaroo? STOC 2009: 553-560

Mokshay M. Madiman, Prasad Tetali: Information Inequalities for Joint Distributions, with Interpretations and Applications. CoRR abs/0901.0044 (2009)

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)

Andrea Montanari, Ricardo Restrepo, Prasad Tetali: Reconstruction and Clustering in Random Constraint Satisfaction Problems. CoRR abs/0904.2751 (2009)

Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, Prasad Tetali: Near-Optimal Sublinear Time Bounds for Distributed Random Walks. CoRR abs/0911.3195 (2009)

Ernie Croot, Andrew Granville, Robin Pemantle, Prasad Tetali: Running Time Predictions for Factoring Algorithms. ANTS 2008: 1-36

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

Milena Mihail, Amin Saberi, Prasad Tetali: Random Walks with Lookahead on Power Law Random Graphs. Internet Mathematics 3(2): 147-152 (2007)

Jeong Han Kim, Ravi Montenegro, Prasad Tetali: Near Optimal Bounds for Collision in Pollard Rho for Discrete Log. FOCS 2007: 215-223

Mohsen Bayati, David Gamarnik, Dimitriy A. Katz, Chandra Nair, Prasad Tetali: Simple deterministic approximation algorithms for counting matchings. STOC 2007: 122-127

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)

Michael Krivelevich, Benny Sudakov, Prasad Tetali: On smoothed analysis in dense graphs and formulas. Random Struct. Algorithms 29(2): 180-193 (2006)

Ravi Montenegro, Prasad Tetali: Mathematical Aspects of Mixing Times in Markov Chains. Foundations and Trends in Theoretical Computer Science 1(3) (2005)

Uriel Feige, László Lovász, Prasad Tetali: Approximating Min Sum Set Cover. Algorithmica 40(4): 219-234 (2004)

Christian Houdré, Prasad Tetali: Isoperimetric Invariants For Product Markov Chains and Graph Products. Combinatorica 24(3): 359-388 (2004)

Bertrand Guenin, Dhruv Mubayi, Prasad Tetali: A family of switch equivalent graphs. Discrete Mathematics 288(1-3): 29-35 (2004)

David Galvin, Prasad Tetali: Slow mixing of Glauber dynamics for the hard-core model on the hypercube. SODA 2004: 466-467

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)

Graham Brightwell, Prasad Tetali: The Number of Linear Extensions of the Boolean Lattice. Order 20(4): 333-345 (2003)

Ioana Dumitriu, Prasad Tetali, Peter Winkler: On Playing Golf with Two Balls. SIAM J. Discrete Math. 16(4): 604-615 (2003)

Sergey Bobkov, Prasad Tetali: Modified log-sobolev inequalities, mixing and hypercontractivity. STOC 2003: 287-296

Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali: Two-coloring random hypergraphs. Random Struct. Algorithms 20(2): 249-259 (2002)

Uriel Feige, László Lovász, Prasad Tetali: Approximating Min-sum Set Cover. APPROX 2002: 94-107

Prasad Tetali, Santosh Vempala: Random Sampling of Euler Tours. Algorithmica 30(3): 376-385 (2001)

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)

André Kündgen, Dhruv Mubayi, Prasad Tetali: Minimal Completely Separating Systems of k-Sets. J. Comb. Theory, Ser. A 93(1): 192-198 (2001)

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)

Sergey Bobkov, Christian Houdré, Prasad Tetali: lambda_infty Vertex Isoperimetry and Concentration. Combinatorica 20(2): 153-172 (2000)

Peter C. Fishburn, Prasad Tetali, Peter Winkler: Optimal linear arrangement of a rectangular grid. Discrete Mathematics 213(1-3): 123-139 (2000)

Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali: Two-coloring Random Hypergraphs. ICALP Satellite Workshops 2000: 85-96

Ravi Kannan, Prasad Tetali, Santosh Vempala: Simple Markov-chain algorithms for generating bipartite graphs and tournaments. Random Struct. Algorithms 14(4): 293-308 (1999)

Prasad Tetali: Design of On-Line Algorithms Using Hitting Times. SIAM J. Comput. 28(4): 1232-1246 (1999)

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 Transactions on Communications 47(10): 1593-1603 (1999)

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

Jeong Han Kim, Daniel R. Simon, Prasad Tetali: Limits on the Efficiency of One-Way Permutation-Based Hash Functions. FOCS 1999: 535-542

Fan R. K. Chung, Prasad Tetali: Isoperimetric Inequalities for Cartesian Products of Graphs. Combinatorics, Probability & Computing 7(2): 141-148 (1998)

Prasad Tetali: A Characterization of Unique Tournaments. J. Comb. Theory, Ser. B 72(1): 157-159 (1998)

Dana Randall, Prasad Tetali: Analyzing Glauber Dynamics by Comparison of Markov Chains. LATIN 1998: 292-304

Jeong Han Kim, Prasad Tetali, Peter C. Fishburn: Score certificates for tournaments. Journal of Graph Theory 24(2): 117-138 (1997)

Prasad Tetali, Santosh Vempala: Random Sampling of Euler Tours. RANDOM 1997: 57-66

Ravi Kannan, Prasad Tetali, Santosh Vempala: Simple Markov-Chain Algorithms for Generating Bipartite Graphs and Tournaments (Extended Abstract). SODA 1997: 193-200

Noga Alon, Joel Spencer, Prasad Tetali: Covering with Latin Transversals. Discrete Applied Mathematics 57(1): 1-10 (1995)

Prasad Tetali: An Extension of Foster's Network Theorem. Combinatorics, Probability & Computing 3: 421-427 (1994)

Prasad Tetali: Design of On-line Algorithms Using Hitting Times. SODA 1994: 402-411

Fan R. K. Chung, Prasad Tetali: Communication Complexity and Quasi Randomness. SIAM J. Discrete Math. 6(1): 110-123 (1993)

Don Coppersmith, Prasad Tetali, Peter Winkler: Collisions Among Random Walks on a Graph. SIAM J. Discrete Math. 6(3): 363-374 (1993)

Prasad Tetali, Peter Winkler: On a Random Walk Problem Arising in Self-Stabilizing Token Management. PODC 1991: 273-280

Paul Erdös, Prasad Tetali: Representations of Integers as the Sum of k Terms. Random Struct. Algorithms 1(3): 245-262 (1990)