The SCEAS System
| |||||||

## Search the dblp DataBase
Nayantara Bhatnagar:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - 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] - Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
**Symmetric Polynomials over Z**[Citation Graph (0, 0)][DBLP]_{m}and Simultaneous Communication Protocol. FOCS, 2003, pp:450-0 [Conf] - Nayantara Bhatnagar, Dana Randall, Vijay V. Vazirani, Eric Vigoda
**Random Bichromatic Matchings.**[Citation Graph (0, 0)][DBLP] LATIN, 2006, pp:190-201 [Conf] - 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] - Nayantara Bhatnagar, Dana Randall
**Torpid mixing of simulated tempering on the Potts model.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:478-487 [Conf] - Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
**Symmetric Polynomials over Z**[Citation Graph (0, 0)][DBLP]_{m}and Simultaneous Communication Protocols Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:047, pp:- [Journal] - 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] - Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton
**Symmetric polynomials over Z**[Citation Graph (0, 0)][DBLP]_{m}and simultaneous communication protocols. J. Comput. Syst. Sci., 2006, v:72, n:2, pp:252-285 [Journal] **Reconstruction Threshold for the Hardcore Model.**[Citation Graph (, )][DBLP]**On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries.**[Citation Graph (, )][DBLP]**Sampling stable marriages: why spouse-swapping won't work.**[Citation Graph (, )][DBLP]**Random Bichromatic Matchings.**[Citation Graph (, )][DBLP]**Polynomials that Sign Represent Parity and Descartes' Rule of Signs.**[Citation Graph (, )][DBLP]**A computational method for bounding the probability of reconstruction on trees**[Citation Graph (, )][DBLP]**Reconstruction Threshold for the Hardcore Model**[Citation Graph (, )][DBLP]**The Computational Complexity of Estimating Convergence Time**[Citation Graph (, )][DBLP]
Search in 0.153secs, Finished in 0.154secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |