 | 2012 |
| 23 |  | Nayantara Bhatnagar,
Nathan Linial:
On the Lipschitz constant of the RSK correspondence.
J. Comb. Theory, Ser. A 119(1): 63-82 (2012) |
| 2011 |
| 22 |  | Nayantara Bhatnagar,
Andrej Bogdanov,
Elchanan Mossel:
The Computational Complexity of Estimating MCMC Convergence Time.
APPROX-RANDOM 2011: 424-435 |
| 21 |  | Ivona Bezáková,
Nayantara Bhatnagar,
Dana Randall:
On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries.
J. Comb. Optim. 22(3): 457-468 (2011) |
| 20 |  | Nayantara Bhatnagar,
Juan Carlos Vera,
Eric Vigoda,
Dror Weitz:
Reconstruction for Colorings on Trees.
SIAM J. Discrete Math. 25(2): 809-826 (2011) |
| 19 |  | Nayantara Bhatnagar,
Elitza N. Maneva:
A Computational Method for Bounding the Probability of Reconstruction on Trees.
SIAM J. Discrete Math. 25(2): 854-871 (2011) |
| 2010 |
| 18 |  | Nayantara Bhatnagar,
Allan Sly,
Prasad Tetali:
Reconstruction Threshold for the Hardcore Model.
APPROX-RANDOM 2010: 434-447 |
| 17 |  | Nayantara Bhatnagar,
Allan Sly,
Prasad Tetali:
Reconstruction Threshold for the Hardcore Model
CoRR abs/1004.3531: (2010) |
| 16 |  | Nayantara Bhatnagar,
Andrej Bogdanov,
Elchanan Mossel:
The Computational Complexity of Estimating Convergence Time
CoRR abs/1007.0089: (2010) |
| 2009 |
| 15 |  | Ivona Bezáková,
Nayantara Bhatnagar,
Dana Randall:
On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries.
COCOON 2009: 307-316 |
| 14 |  | Nayantara Bhatnagar,
Elitza N. Maneva:
A computational method for bounding the probability of reconstruction on trees
CoRR abs/0903.4812: (2009) |
| 2008 |
| 13 |  | Nayantara Bhatnagar,
Sam Greenberg,
Dana Randall:
Sampling stable marriages: why spouse-swapping won't work.
SODA 2008: 1223-1232 |
| 12 |  | Nayantara Bhatnagar,
Dana Randall,
Vijay V. Vazirani,
Eric Vigoda:
Random Bichromatic Matchings.
Algorithmica 50(4): 418-445 (2008) |
| 11 |  | Saugata Basu,
Nayantara Bhatnagar,
Parikshit Gopalan,
Richard J. Lipton:
Polynomials that Sign Represent Parity and Descartes' Rule of Signs.
Computational Complexity 17(3): 377-406 (2008) |
| 2007 |
| 10 |  | Ivona Bezáková,
Nayantara Bhatnagar,
Eric Vigoda:
Sampling binary contingency tables with a greedy start.
Random Struct. Algorithms 30(1-2): 168-205 (2007) |
| 2006 |
| 9 |  | Nayantara Bhatnagar,
Sam Greenberg,
Dana Randall:
The Effect of Boundary Conditions on Mixing Rates of Markov Chains.
APPROX-RANDOM 2006: 280-291 |
| 8 |  | Nayantara Bhatnagar,
Dana Randall,
Vijay V. Vazirani,
Eric Vigoda:
Random Bichromatic Matchings.
LATIN 2006: 190-201 |
| 7 |  | Ivona Bezáková,
Nayantara Bhatnagar,
Eric Vigoda:
Sampling binary contingency tables with a greedy start.
SODA 2006: 414-423 |
| 6 |  | Nayantara Bhatnagar,
Parikshit Gopalan,
Richard J. Lipton:
Symmetric polynomials over Zm and simultaneous communication protocols.
J. Comput. Syst. Sci. 72(2): 252-285 (2006) |
| 2004 |
| 5 |  | Saugata Basu,
Nayantara Bhatnagar,
Parikshit Gopalan,
Richard J. Lipton:
Polynomials That Sign Represent Parity and Descartes Rule of Signs.
IEEE Conference on Computational Complexity 2004: 223-235 |
| 4 |  | Nayantara Bhatnagar,
Dana Randall:
Torpid mixing of simulated tempering on the Potts model.
SODA 2004: 478-487 |
| 3 |  | Nayantara Bhatnagar,
Parikshit Gopalan,
Richard J. Lipton:
The Degree of Threshold Mod 6 and Diophantine Equations
Electronic Colloquium on Computational Complexity (ECCC)(022): (2004) |
| 2003 |
| 2 |  | Nayantara Bhatnagar,
Parikshit Gopalan,
Richard J. Lipton:
Symmetric Polynomials over Zm and Simultaneous Communication Protocol.
FOCS 2003: 450-459 |
| 1 |  | Nayantara Bhatnagar,
Parikshit Gopalan,
Richard J. Lipton:
Symmetric Polynomials over Zm and Simultaneous Communication Protocols
Electronic Colloquium on Computational Complexity (ECCC)(047): (2003) |