| | |
- CSB - MetaPress - Google - Bing - Yahoo
Ask others: ACM DL/Guide - - CSB - MetaPress - Google - Bing - Yahoo
| 161 |       | Sanjeev Khanna, Madhu Sudan: Delays and the Capacity of Continuous-Time Channels. FOCS 2011: 758-767 |
| 159 | | Brendan Juba, Adam Tauman Kalai, Sanjeev Khanna, Madhu Sudan: Compression without a common prior: an information-theoretic justification for ambiguity in language. ICS 2011: 79-86 |
| 154 | | Sanjeev Khanna, Madhu Sudan: Delays and the Capacity of Continuous-time Channels CoRR abs/1105.3425: (2011) |
| 38 | | Sanjeev Khanna, Madhu Sudan, Luca Trevisan, David P. Williamson: The Approximability of Constraint Satisfaction Problems. SIAM J. Comput. 30(6): 1863-1920 (2000) |
| 22 | | Sanjeev Khanna, Rajeev Motwani, Madhu Sudan, Umesh V. Vazirani: On Syntactic versus Computational Views of Approximability. SIAM J. Comput. 28(1): 164-191 (1998) |
| 20 | | Sanjeev Khanna, Madhu Sudan, Luca Trevisan: Constraint Satisfaction: The Approximability of Minimization Problems. IEEE Conference on Computational Complexity 1997: 282-296 |
| 18 | | Sanjeev Khanna, Madhu Sudan, David P. Williamson: A Complete Classification of the Approximability of Maximization Problems Derived from Boolean Constraint Satisfaction. STOC 1997: 11-20 |
| 12 | | Sanjeev Khanna, Madhu Sudan: The Optimization Complexity of Constraint Satisfaction Problems Electronic Colloquium on Computational Complexity (ECCC) 3(28): (1996) |
| 11 | | Sanjeev Khanna, Madhu Sudan, David P. Williamson: A Complete Characterization of the Approximability of Maximization Problems Derived from Boolean Constraint Satisfaction Electronic Colloquium on Computational Complexity (ECCC) 3(62): (1996) |
| 10 | | Sanjeev Khanna, Madhu Sudan, Luca Trevisan: Constraint satisfaction: The approximability of minimization problems. Electronic Colloquium on Computational Complexity (ECCC) 3(64): (1996) |
| 9 | | Sanjeev Khanna, Rajeev Motwani, Madhu Sudan, Umesh V. Vazirani: On Syntactic versus Computational Views of Approximability Electronic Colloquium on Computational Complexity (ECCC) 2(23): (1995) |
| 7 | | Sanjeev Khanna, Rajeev Motwani, Madhu Sudan, Umesh V. Vazirani: On Syntactic versus Computational Views of Approximability FOCS 1994: 819-830 |
Selection of 12 from 171 records - Sanjeev Khanna has 137 coauthors
Last update 2012-09-10 CET by the DBLP Team —
Content released under the ODC-BY 1.0 license — See also our legal information page