Items where Author is "Radhakrishnan, J."

Article

Ben-Sasson, E. ; Kopparty, S. ; Radhakrishnan, J. (2010) Subspace polynomials and limits to list decoding of Reed-Solomon codes IEEE Transactions on Information Theory, 56 (1). pp. 113-120. ISSN 0018-9448

Harsha, P. ; Jain, R. ; McAllester, D. ; Radhakrishnan, J. (2007) The communication complexity of correlation Proceedings - IEEE Conference on Computational Complexity . pp. 10-23. ISSN 1093-0159

Jain, R. ; Radhakrishnan, J. ; Sen, P. (2005) Prior entanglement, message compression and privacy in quantum communication Proceedings - IEEE Conference on Computational Complexity . pp. 285-296. ISSN 1093-0159

Jain, R. ; Radhakrishnan, J. ; Sen, P. (2003) A lower bound for the bounded round quantum communication complexity of set disjointness Proceedings - Annual Symposium on Foundations of Computer Science . pp. 220-229. ISSN 0272-5428

Buhrman, H. ; Miltersen, P. B. ; Radhakrishnan, J. ; Venkatesh, S. (2002) Are bitvectors optimal? SIAM Journal on Computing, 31 (6). pp. 1723-1744. ISSN 0097-5397

Deshpande, A. ; Jain, R. ; Kavitha, T. ; Lokam, S. V. ; Radhakrishnan, J. (2002) Better lower bounds for locally decodable codes Proceedings of 17th IEEE Annual Conference on Computational Complexity, 2002 . pp. 152-161.

Jain, R. ; Radhakrishnan, J. ; Sen, P. (2002) Privacy and interaction in quantum communication complexity and a theorem about the relative entropy of quantum states Proceedings - Annual Symposium on Foundations of Computer Science . pp. 429-438. ISSN 0272-5428

Radhakrishnan, J. ; Sen, P. ; Venkatesh, S. (2000) The quantum complexity of set membership Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000 . pp. 554-562.

Radhakrishnan, J. ; Srinivasan, A. (1998) Improved bounds and algorithms for hypergraph two-coloring Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998 . pp. 684-693.

Radhakrishnan, J. ; Ta-Shma, A. (1997) Tight bounds for depth-two superconcentrators Proceedings - Annual Symposium on Foundations of Computer Science . pp. 585-594. ISSN 0272-5428

Halldórsson, M. M. ; Radhakrishnan, J. (1997) Greed is good: approximating independent sets in sparse and bounded-degree graphs Algorithmica, 18 (1). pp. 145-163. ISSN 0178-4617

Radhakrishnan, J. (1996) Pi-sigma-pi threshold formulas Theory of Computing Systems, 26 (4). pp. 357-374. ISSN 1432-4350

Halldorsson, M. M. ; Radhakrishnan, J. ; Subrahmanyam, K. V. (1993) Directed vs. undirected monotone contact networks for threshold functions Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993 . pp. 604-613.

Sukumar, R. ; Dattaraja, H. S. ; Suresh, H. S. ; Radhakrishnan, J. ; Vasudeva, R. ; Nirmala, S. ; Joshi, N. V. (1992) Long term monitering of vegetation in a tropical deciduous forest in Mudumalai, Southern India Current Science, 62 (9). pp. 608-616. ISSN 0011-3891

Radhakrishnan, J. (1991) Better bounds for threshold formulas Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991 . pp. 314-323.

Desai, H. K. ; Gawad, D. H. ; Govindachari, T. R. ; Joshi, B. S. ; Kamat, V. N. ; Modi, J. D. ; Parthasarathy, P. C. ; Radhakrishnan, J. ; Shanbhag, M. N. ; Sidhaye, A. R. ; Viswanathan, N. (1973) Chemical investigation of Indian plants. Part VII Indian Journal of Chemistry, 11 (8). pp. 840-842. ISSN 0019-5103

Govindachari, T. R. ; Viswanathan, N. ; Radhakrishnan, J. ; Pai, B. R. ; Natarajan, S. ; Subramaniam, P. S. (1973) Minor alkaloids of Tylophora asthmatica: revised structure of tylophorinidine Tetrahedron, 29 (6). pp. 891-897. ISSN 0040-4020