 | 2009 |
|---|
| 45 |       | Ravi Montenegro,
Prasad Tetali:
How long does it take to catch a wild kangaroo?
STOC 2009: 553-560 |
| 44 | | Mokshay M. Madiman,
Prasad Tetali:
Information Inequalities for Joint Distributions, with Interpretations and Applications
CoRR abs/0901.0044: (2009) |
| 43 | | 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) |
| 42 | | Andrea Montanari,
Ricardo Restrepo,
Prasad Tetali:
Reconstruction and Clustering in Random Constraint Satisfaction Problems
CoRR abs/0904.2751: (2009) |
| 2008 |
|---|
| 41 | | Ernie Croot,
Andrew Granville,
Robin Pemantle,
Prasad Tetali:
Running Time Predictions for Factoring Algorithms.
ANTS 2008: 1-36 |
| 40 | | 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 |
|---|
| 39 | | Jeong Han Kim,
Ravi Montenegro,
Prasad Tetali:
Near Optimal Bounds for Collision in Pollard Rho for Discrete Log.
FOCS 2007: 215-223 |
| 38 | | Mohsen Bayati,
David Gamarnik,
Dimitriy A. Katz,
Chandra Nair,
Prasad Tetali:
Simple deterministic approximation algorithms for counting matchings.
STOC 2007: 122-127 |
| 37 |  | Milena Mihail,
Amin Saberi,
Prasad Tetali:
Random Walks with Lookahead on Power Law Random Graphs.
Internet Mathematics 3(2): (2007) |
| 2006 |
|---|
| 36 | | 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) |
| 35 | | Michael Krivelevich,
Benny Sudakov,
Prasad Tetali:
On smoothed analysis in dense graphs and formulas.
Random Struct. Algorithms 29(2): 180-193 (2006) |
| 2005 |
|---|
| 34 | | Ravi Montenegro,
Prasad Tetali:
Mathematical Aspects of Mixing Times in Markov Chains.
Foundations and Trends in Theoretical Computer Science 1(3): (2005) |
| 2004 |
|---|
| 33 | | David Galvin,
Prasad Tetali:
Slow mixing of Glauber dynamics for the hard-core model on the hypercube.
SODA 2004: 466-467 |
| 32 | | Uriel Feige,
László Lovász,
Prasad Tetali:
Approximating Min Sum Set Cover.
Algorithmica 40(4): 219-234 (2004) |
| 31 | | Christian Houdré,
Prasad Tetali:
Isoperimetric Invariants For Product Markov Chains and Graph Products.
Combinatorica 24(3): 359-388 (2004) |
| 30 | | Bertrand Guenin,
Dhruv Mubayi,
Prasad Tetali:
A family of switch equivalent graphs.
Discrete Mathematics 288(1-3): 29-35 (2004) |
| 2003 |
|---|
| 29 | | Sergey Bobkov,
Prasad Tetali:
Modified log-sobolev inequalities, mixing and hypercontractivity.
STOC 2003: 287-296 |
| 28 | | 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) |
| 27 | | Graham Brightwell,
Prasad Tetali:
The Number of Linear Extensions of the Boolean Lattice.
Order 20(4): 333-345 (2003) |
| 26 | | Ioana Dumitriu,
Prasad Tetali,
Peter Winkler:
On Playing Golf with Two Balls.
SIAM J. Discrete Math. 16(4): 604-615 (2003) |
| 2002 |
|---|
| 25 | | Uriel Feige,
László Lovász,
Prasad Tetali:
Approximating Min-sum Set Cover.
APPROX 2002: 94-107 |
| 24 | | Dimitris Achlioptas,
Jeong Han Kim,
Michael Krivelevich,
Prasad Tetali:
Two-coloring random hypergraphs.
Random Struct. Algorithms 20(2): 249-259 (2002) |
| 2001 |
|---|
| 23 | | Prasad Tetali,
Santosh Vempala:
Random Sampling of Euler Tours.
Algorithmica 30(3): 376-385 (2001) |
| 22 | | Christian Houdré,
Prasad Tetali:
Concentration Of Measure For Products Of Markov Kernels And Graph Products Via Functional Inequalities.
Combinatorics, Probability & Computing 10(1): (2001) |
| 21 | | André Kündgen,
Dhruv Mubayi,
Prasad Tetali:
Minimal Completely Separating Systems of k-Sets.
J. Comb. Theory, Ser. A 93(1): 192-198 (2001) |
| 20 | | 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) |
| 2000 |
|---|
| 19 | | Dimitris Achlioptas,
Jeong Han Kim,
Michael Krivelevich,
Prasad Tetali:
Two-coloring Random Hypergraphs.
ICALP Satellite Workshops 2000: 85-96 |
| 18 | | Sergey Bobkov,
Christian Houdré,
Prasad Tetali:
lambdainfty Vertex Isoperimetry and Concentration.
Combinatorica 20(2): 153-172 (2000) |
| 17 | | Peter C. Fishburn,
Prasad Tetali,
Peter Winkler:
Optimal linear arrangement of a rectangular grid.
Discrete Mathematics 213(1-3): 123-139 (2000) |
| 1999 |
|---|
| 16 | | 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 |
| 15 | | Jeong Han Kim,
Daniel R. Simon,
Prasad Tetali:
Limits on the Efficiency of One-Way Permutation-Based Hash Functions.
FOCS 1999: 535-542 |
| 14 | | Ravi Kannan,
Prasad Tetali,
Santosh Vempala:
Simple Markov-chain algorithms for generating bipartite graphs and tournaments.
Random Struct. Algorithms 14(4): 293-308 (1999) |
| 13 | | Prasad Tetali:
Design of On-Line Algorithms Using Hitting Times.
SIAM J. Comput. 28(4): 1232-1246 (1999) |
| 1998 |
|---|
| 12 | | Dana Randall,
Prasad Tetali:
Analyzing Glauber Dynamics by Comparison of Markov Chains.
LATIN 1998: 292-304 |
| 11 | | Fan R. K. Chung,
Prasad Tetali:
Isoperimetric Inequalities for Cartesian Products of Graphs.
Combinatorics, Probability & Computing 7(2): 141-148 (1998) |
| 10 | | Prasad Tetali:
A Characterization of Unique Tournaments.
J. Comb. Theory, Ser. B 72(1): 157-159 (1998) |
| 1997 |
|---|
| 9 | | Prasad Tetali,
Santosh Vempala:
Random Sampling of Euler Tours.
RANDOM 1997: 57-66 |
| 8 | | Ravi Kannan,
Prasad Tetali,
Santosh Vempala:
Simple Markov-Chain Algorithms for Generating Bipartite Graphs and Tournaments (Extended Abstract).
SODA 1997: 193-200 |
| 1995 |
|---|
| 7 | | Noga Alon,
Joel Spencer,
Prasad Tetali:
Covering with Latin Transversals.
Discrete Applied Mathematics 57(1): 1-10 (1995) |
| 1994 |
|---|
| 6 | | Prasad Tetali:
Design of On-line Algorithms Using Hitting Times.
SODA 1994: 402-411 |
| 5 | | Prasad Tetali:
An Extension of Foster's Network Theorem.
Combinatorics, Probability & Computing 3: 421-427 (1994) |
| 1993 |
|---|
| 4 | | Fan R. K. Chung,
Prasad Tetali:
Communication Complexity and Quasi Randomness.
SIAM J. Discrete Math. 6(1): 110-123 (1993) |
| 3 | | Don Coppersmith,
Prasad Tetali,
Peter Winkler:
Collisions Among Random Walks on a Graph.
SIAM J. Discrete Math. 6(3): 363-374 (1993) |
| 1991 |
|---|
| 2 | | Prasad Tetali,
Peter Winkler:
On a Random Walk Problem Arising in Self-Stabilizing Token Management.
PODC 1991: 273-280 |
| 1990 |
|---|
| 1 | | Paul Erdös,
Prasad Tetali:
Representations of Integers as the Sum of k Terms.
Random Struct. Algorithms 1(3): 245-262 (1990) |
