The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Nayantara Bhatnagar: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Nayantara Bhatnagar, Sam Greenberg, Dana Randall
    The Effect of Boundary Conditions on Mixing Rates of Markov Chains. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:280-291 [Conf]
  2. Saugata Basu, Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
    Polynomials That Sign Represent Parity and Descartes Rule of Signs. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2004, pp:223-235 [Conf]
  3. Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
    Symmetric Polynomials over Zm and Simultaneous Communication Protocol. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:450-0 [Conf]
  4. Nayantara Bhatnagar, Dana Randall, Vijay V. Vazirani, Eric Vigoda
    Random Bichromatic Matchings. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:190-201 [Conf]
  5. Ivona Bezáková, Nayantara Bhatnagar, Eric Vigoda
    Sampling binary contingency tables with a greedy start. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:414-423 [Conf]
  6. Nayantara Bhatnagar, Dana Randall
    Torpid mixing of simulated tempering on the Potts model. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:478-487 [Conf]
  7. Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
    Symmetric Polynomials over Zm and Simultaneous Communication Protocols [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:047, pp:- [Journal]
  8. Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
    The Degree of Threshold Mod 6 and Diophantine Equations [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:022, pp:- [Journal]
  9. Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
    Symmetric polynomials over Zm and simultaneous communication protocols. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:2, pp:252-285 [Journal]

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


  11. On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries. [Citation Graph (, )][DBLP]


  12. Sampling stable marriages: why spouse-swapping won't work. [Citation Graph (, )][DBLP]


  13. Random Bichromatic Matchings. [Citation Graph (, )][DBLP]


  14. Polynomials that Sign Represent Parity and Descartes' Rule of Signs. [Citation Graph (, )][DBLP]


  15. A computational method for bounding the probability of reconstruction on trees [Citation Graph (, )][DBLP]


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


  17. The Computational Complexity of Estimating Convergence Time [Citation Graph (, )][DBLP]


Search in 0.153secs, Finished in 0.154secs
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