The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Prasad Tetali: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Uriel Feige, László Lovász, Prasad Tetali
    Approximating Min-sum Set Cover. [Citation Graph (0, 0)][DBLP]
    APPROX, 2002, pp:94-107 [Conf]
  2. 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. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:218-229 [Conf]
  3. Jeong Han Kim, Daniel R. Simon, Prasad Tetali
    Limits on the Efficiency of One-Way Permutation-Based Hash Functions. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:535-542 [Conf]
  4. Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali
    Two-coloring Random Hypergraphs. [Citation Graph (0, 0)][DBLP]
    ICALP Satellite Workshops, 2000, pp:85-96 [Conf]
  5. Dana Randall, Prasad Tetali
    Analyzing Glauber Dynamics by Comparison of Markov Chains. [Citation Graph (0, 0)][DBLP]
    LATIN, 1998, pp:292-304 [Conf]
  6. Prasad Tetali, Peter Winkler
    On a Random Walk Problem Arising in Self-Stabilizing Token Management. [Citation Graph (0, 0)][DBLP]
    PODC, 1991, pp:273-280 [Conf]
  7. Prasad Tetali, Santosh Vempala
    Random Sampling of Euler Tours. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1997, pp:57-66 [Conf]
  8. David Galvin, Prasad Tetali
    Slow mixing of Glauber dynamics for the hard-core model on the hypercube. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:466-467 [Conf]
  9. Ravi Kannan, Prasad Tetali, Santosh Vempala
    Simple Markov-Chain Algorithms for Generating Bipartite Graphs and Tournaments (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:193-200 [Conf]
  10. Prasad Tetali
    Design of On-line Algorithms Using Hitting Times. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:402-411 [Conf]
  11. Sergey Bobkov, Prasad Tetali
    Modified log-sobolev inequalities, mixing and hypercontractivity. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:287-296 [Conf]
  12. Uriel Feige, László Lovász, Prasad Tetali
    Approximating Min Sum Set Cover. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:40, n:4, pp:219-234 [Journal]
  13. Prasad Tetali, Santosh Vempala
    Random Sampling of Euler Tours. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:30, n:3, pp:376-385 [Journal]
  14. Sergey Bobkov, Christian Houdré, Prasad Tetali
    lambdainfty Vertex Isoperimetry and Concentration. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2000, v:20, n:2, pp:153-172 [Journal]
  15. Christian Houdré, Prasad Tetali
    Isoperimetric Invariants For Product Markov Chains and Graph Products. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:24, n:3, pp:359-388 [Journal]
  16. Fan R. K. Chung, Prasad Tetali
    Isoperimetric Inequalities for Cartesian Products of Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:2, pp:141-148 [Journal]
  17. Ehud Friedgut, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Prasad Tetali
    Ramsey Games Against a One-Armed Bandit. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2003, v:12, n:5-6, pp:515-545 [Journal]
  18. Christian Houdré, Prasad Tetali
    Concentration Of Measure For Products Of Markov Kernels And Graph Products Via Functional Inequalities. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2001, v:10, n:1, pp:- [Journal]
  19. Prasad Tetali
    An Extension of Foster's Network Theorem. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:421-427 [Journal]
  20. Noga Alon, Joel Spencer, Prasad Tetali
    Covering with Latin Transversals. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:57, n:1, pp:1-10 [Journal]
  21. Peter C. Fishburn, Prasad Tetali, Peter Winkler
    Optimal linear arrangement of a rectangular grid. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:213, n:1-3, pp:123-139 [Journal]
  22. Bertrand Guenin, Dhruv Mubayi, Prasad Tetali
    A family of switch equivalent graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:288, n:1-3, pp:29-35 [Journal]
  23. André Kündgen, Dhruv Mubayi, Prasad Tetali
    Minimal Completely Separating Systems of k-Sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2001, v:93, n:1, pp:192-198 [Journal]
  24. Prasad Tetali
    A Characterization of Unique Tournaments. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1998, v:72, n:1, pp:157-159 [Journal]
  25. Graham Brightwell, Prasad Tetali
    The Number of Linear Extensions of the Boolean Lattice. [Citation Graph (0, 0)][DBLP]
    Order, 2003, v:20, n:4, pp:333-345 [Journal]
  26. Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali
    Two-coloring random hypergraphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2002, v:20, n:2, pp:249-259 [Journal]
  27. Paul Erdös, Prasad Tetali
    Representations of Integers as the Sum of k Terms. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1990, v:1, n:3, pp:245-262 [Journal]
  28. David Galvin, Prasad Tetali
    Slow mixing of Glauber dynamics for the hard-core model on regular bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2006, v:28, n:4, pp:427-443 [Journal]
  29. Ravi Kannan, Prasad Tetali, Santosh Vempala
    Simple Markov-chain algorithms for generating bipartite graphs and tournaments. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1999, v:14, n:4, pp:293-308 [Journal]
  30. Alexandr V. Kostochka, Dhruv Mubayi, Vojtech Rödl, Prasad Tetali
    On the chromatic number of set systems. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2001, v:19, n:2, pp:87-98 [Journal]
  31. Michael Krivelevich, Benny Sudakov, Prasad Tetali
    On smoothed analysis in dense graphs and formulas. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2006, v:29, n:2, pp:180-193 [Journal]
  32. Prasad Tetali
    Design of On-Line Algorithms Using Hitting Times. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:4, pp:1232-1246 [Journal]
  33. Fan R. K. Chung, Prasad Tetali
    Communication Complexity and Quasi Randomness. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1993, v:6, n:1, pp:110-123 [Journal]
  34. Don Coppersmith, Prasad Tetali, Peter Winkler
    Collisions Among Random Walks on a Graph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1993, v:6, n:3, pp:363-374 [Journal]
  35. Ioana Dumitriu, Prasad Tetali, Peter Winkler
    On Playing Golf with Two Balls. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2003, v:16, n:4, pp:604-615 [Journal]
  36. Mohsen Bayati, David Gamarnik, Dimitriy A. Katz, Chandra Nair, Prasad Tetali
    Simple deterministic approximation algorithms for counting matchings. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:122-127 [Conf]

  37. A Birthday Paradox for Markov Chains, with an Optimal Bound for Collision in the Pollard Rho Algorithm for Discrete Logarithm. [Citation Graph (, )][DBLP]


  38. Running Time Predictions for Factoring Algorithms. [Citation Graph (, )][DBLP]


  39. Reconstruction Threshold for the Hardcore Model. [Citation Graph (, )][DBLP]


  40. Near Optimal Bounds for Collision in Pollard Rho for Discrete Log. [Citation Graph (, )][DBLP]


  41. Efficient distributed random walks with applications. [Citation Graph (, )][DBLP]


  42. Phase Transition for the Mixing Time of the Glauber Dynamics for Coloring Regular Trees. [Citation Graph (, )][DBLP]


  43. How long does it take to catch a wild kangaroo? [Citation Graph (, )][DBLP]


  44. Approximations for the isoperimetric and spectral profile of graphs and related parameters. [Citation Graph (, )][DBLP]


  45. Combinatorial approach to the interpolation method and scaling limits in sparse random graphs. [Citation Graph (, )][DBLP]


  46. Information Inequalities for Joint Distributions, with Interpretations and Applications [Citation Graph (, )][DBLP]


  47. Entropy and set cardinality inequalities for partition-determined functions, with applications to sumsets [Citation Graph (, )][DBLP]


  48. Reconstruction and Clustering in Random Constraint Satisfaction Problems [Citation Graph (, )][DBLP]


  49. Near-Optimal Sublinear Time Bounds for Distributed Random Walks [Citation Graph (, )][DBLP]


  50. Reconstruction Threshold for the Hardcore Model [Citation Graph (, )][DBLP]


  51. Concentration on the Discrete Torus Using Transportation. [Citation Graph (, )][DBLP]


  52. G-parking functions, acyclic orientations and spanning trees. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002