dblp.uni-trier.dewww.uni-trier.de

Subhash Khot

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
63EESubhash Khot, Ashok Kumar Ponnuswami: Minimizing Wide Range Regret with Time Selection Functions. COLT 2008: 81-86
62EESubhash Khot, Rishi Saket: Hardness of Minimizing and Learning DNF Expressions. FOCS 2008: 231-240
61EESubhash Khot, Assaf Naor: Approximate Kernel Clustering. FOCS 2008: 561-570
60EESanjeev Arora, Subhash Khot, Alexandra Kolla, David Steurer, Madhur Tulsiani, Nisheeth K. Vishnoi: Unique games on expanding constraint graphs are easy: extended abstract. STOC 2008: 21-28
59EESubhash Khot, Rishi Saket: On hardness of learning intersection of two halfspaces. STOC 2008: 345-354
58EESubhash Khot, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta: Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions. Algorithmica 52(1): 3-18 (2008)
57EESubhash Khot, Assaf Naor: Approximate kernel clustering CoRR abs/0807.4626: (2008)
56EESubhash Khot, Oded Regev: Vertex cover might be hard to approximate to within 2-epsilon. J. Comput. Syst. Sci. 74(3): 335-349 (2008)
55EESubhash Khot, Assaf Naor: Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies. SIAM J. Comput. 38(4): 1448-1463 (2008)
2007
54EESubhash Khot, Ashok Kumar Ponnuswami: Approximation Algorithms for the Max-Min Allocation Problem. APPROX-RANDOM 2007: 204-217
53EESubhash Khot, Rishi Saket: Hardness of Embedding Metric Spaces of Equal Size. APPROX-RANDOM 2007: 218-227
52EESubhash Khot, Assaf Naor: Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies. FOCS 2007: 318-328
51EEParikshit Gopalan, Subhash Khot, Rishi Saket: Hardness of Reconstructing Multivariate Polynomials over Finite Fields. FOCS 2007: 349-359
50EEParikshit Gopalan, Subhash Khot, Rishi Saket: Hardness of Reconstructing Multivariate Polynomials over Finite Fields. Electronic Colloquium on Computational Complexity (ECCC) 14(073): (2007)
49EEAmit Chakrabarti, Subhash Khot: Improved lower bounds on the randomized complexity of graph properties. Random Struct. Algorithms 30(3): 427-440 (2007)
48EESubhash Khot, Guy Kindler, Elchanan Mossel, Ryan O'Donnell: Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?. SIAM J. Comput. 37(1): 319-357 (2007)
2006
47EESubhash Khot, Ryan O'Donnell: SDP gaps and UGC-hardness for MAXCUTGAIN. FOCS 2006: 217-226
46EEVitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami: New Results for Learning Noisy Parities and Halfspaces. FOCS 2006: 563-574
45EESubhash Khot, Ashok Kumar Ponnuswami: Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion. ICALP (1) 2006: 226-237
44EESubhash Khot, Rishi Saket: A 3-Query Non-Adaptive PCP with Perfect Completeness. IEEE Conference on Computational Complexity 2006: 159-169
43EENikhil R. Devanur, Subhash Khot, Rishi Saket, Nisheeth K. Vishnoi: Integrality gaps for sparsest cut and minimum linear arrangement problems. STOC 2006: 537-546
42EEHoward J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani: On earthmover distance, metric labeling, and 0-extension. STOC 2006: 547-556
41EEVitaly Feldman, Parikshit Gopalan, Subhash Khot, Ashok Kumar Ponnuswami: New Results for Learning Noisy Parities and Halfspaces. Electronic Colloquium on Computational Complexity (ECCC) 13(059): (2006)
40EESubhash Khot: Hardness of approximating the Shortest Vector Problem in high lp norms. J. Comput. Syst. Sci. 72(2): 206-219 (2006)
39EESubhash Khot: Ruling Out PTAS for Graph Min-Bisection, Dense k-Subgraph, and Bipartite Clique. SIAM J. Comput. 36(4): 1025-1071 (2006)
2005
38EESubhash Khot, Assaf Naor: Nonembeddability theorems via Fourier analysis. FOCS 2005: 101-112
37EEMikhail Alekhnovich, Subhash Khot, Guy Kindler, Nisheeth K. Vishnoi: Hardness of Approximating the Closest Vector Problem with Pre-Processing. FOCS 2005: 216-225
36EESubhash Khot: On the Unique Games Conjecture. FOCS 2005: 3
35EESubhash Khot, Nisheeth K. Vishnoi: The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1. FOCS 2005: 53-62
34EEVenkatesan Guruswami, Subhash Khot: Hardness of Max 3SAT with No Mixed Clauses. IEEE Conference on Computational Complexity 2005: 154-162
33EESubhash Khot, Richard J. Lipton, Evangelos Markakis, Aranyak Mehta: Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions. WINE 2005: 92-101
32EEHoward J. Karloff, Subhash Khot, Aranyak Mehta, Yuval Rabani: On earthmover distance, metric labeling, and 0-extension Electronic Colloquium on Computational Complexity (ECCC)(064): (2005)
31EEGuy Kindler, Ryan O'Donnell, Subhash Khot, Elchanan Mossel: Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs? Electronic Colloquium on Computational Complexity (ECCC)(101): (2005)
30EESubhash Khot: Hardness of approximating the shortest vector problem in lattices. J. ACM 52(5): 789-808 (2005)
29EEIrit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev: A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover. SIAM J. Comput. 34(5): 1129-1146 (2005)
28EESubhash Khot: Guest column: inapproximability results via Long Code based PCPs. SIGACT News 36(2): 25-42 (2005)
27EEJohan Håstad, Subhash Khot: Query Efficient PCPs with Perfect Completeness. Theory of Computing 1(1): 119-148 (2005)
2004
26EESubhash Khot: Hardness of Approximating the Shortest Vector Problem in Lattices. FOCS 2004: 126-135
25EESubhash Khot: Ruling Out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique. FOCS 2004: 136-145
24EESubhash Khot, Guy Kindler, Elchanan Mossel, Ryan O'Donnell: Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs? FOCS 2004: 146-154
23EEJonas Holmerin, Subhash Khot: A new PCP outer verifier with applications to homogeneous linear equations and max-bisection. STOC 2004: 11-20
22EET. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Rabani: Cell-probe lower bounds for the partial match problem. J. Comput. Syst. Sci. 69(3): 435-447 (2004)
2003
21EESubhash Khot: Hardness of Approximating the Shortest Vector Problem in High Lp Norms. FOCS 2003: 290-297
20EEAmit Chakrabarti, Subhash Khot, Xiaodong Sun: Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness. IEEE Conference on Computational Complexity 2003: 107-117
19EEJonas Holmerin, Subhash Khot: A Strong Inapproximability Gap for a Generalization of Minimum Bisection. IEEE Conference on Computational Complexity 2003: 371-378
18EESubhash Khot, Oded Regev: Vertex Cover Might be Hard to Approximate to within 2-\varepsilon. IEEE Conference on Computational Complexity 2003: 379-
17EEIrit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev: A new multilayered PCP and the hardness of hypergraph vertex cover. STOC 2003: 595-601
16EET. S. Jayram, Subhash Khot, Ravi Kumar, Yuval Rabani: Cell-probe lower bounds for the partial match problem. STOC 2003: 667-672
15EEIrit Dinur, Venkatesan Guruswami, Subhash Khot, Oded Regev: A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover CoRR cs.CC/0304026: (2003)
14EESanjeev Arora, Subhash Khot: Fitting algebraic curves to noisy data. J. Comput. Syst. Sci. 67(2): 325-340 (2003)
2002
13EESubhash Khot: Hardness Results for Coloring 3 -Colorable 3 -Uniform Hypergraphs. FOCS 2002: 23-32
12EESubhash Khot: On the Power of Unique 2-Prover 1-Round Games. IEEE Conference on Computational Complexity 2002: 25
11EESanjeev Arora, Subhash Khot: Fitting algebraic curves to noisy data. STOC 2002: 162-169
10EESubhash Khot: Hardness results for approximate hypergraph coloring. STOC 2002: 351-359
9EESubhash Khot: On the power of unique 2-prover 1-round games. STOC 2002: 767-775
8EEIrit Dinur, Venkatesan Guruswami, Subhash Khot: Vertex Cover on k-Uniform Hypergraphs is Hard to Approximate within Factor (k-3-epsilon) Electronic Colloquium on Computational Complexity (ECCC)(027): (2002)
7 Subhash Khot, Venkatesh Raman: Parameterized complexity of finding subgraphs with hereditary properties. Theor. Comput. Sci. 289(2): 997-1008 (2002)
2001
6 Subhash Khot: Improved Inaproximability Results for MaxClique, Chromatic Number and Approximate Graph Coloring. FOCS 2001: 600-609
5 Johan Håstad, Subhash Khot: Query Efficient PCPs with Perfect Completeness. FOCS 2001: 610-619
4EEAmit Chakrabarti, Subhash Khot: Improved Lower Bounds on the Randomized Complexity of Graph Properties. ICALP 2001: 285-296
3EEAmit Chakrabarti, Subhash Khot, Yaoyun Shi: Evasiveness of Subgraph Containment and Related Properties. STACS 2001: 110-120
2EEAmit Chakrabarti, Subhash Khot, Yaoyun Shi: Evasiveness of Subgraph Containment and Related Properties. SIAM J. Comput. 31(3): 866-875 (2001)
2000
1EESubhash Khot, Venkatesh Raman: Parameterized Complexity of Finding Subgraphs with Hereditary Properties. COCOON 2000: 137-147

Coauthor Index

1Mikhail Alekhnovich [37]
2Sanjeev Arora [11] [14] [60]
3Amit Chakrabarti [2] [3] [4] [20] [49]
4Nikhil R. Devanur [43]
5Irit Dinur [8] [15] [17] [29]
6Vitaly Feldman [41] [46]
7Parikshit Gopalan [41] [46] [50] [51]
8Venkatesan Guruswami [8] [15] [17] [29] [34]
9Johan Håstad [5] [27]
10Jonas Holmerin [19] [23]
11T. S. Jayram (Jayram S. Thathachar) [16] [22]
12Howard J. Karloff [32] [42]
13Guy Kindler [24] [31] [37] [48]
14Alexandra Kolla [60]
15Ravi Kumar (S. Ravi Kumar) [16] [22]
16Richard J. Lipton [33] [58]
17Evangelos Markakis (Vangelis Markakis) [33] [58]
18Aranyak Mehta [32] [33] [42] [58]
19Elchanan Mossel [24] [31] [48]
20Assaf Naor [38] [52] [55] [57] [61]
21Ryan O'Donnell [24] [31] [47] [48]
22Ashok Kumar Ponnuswami [41] [45] [46] [54] [63]
23Yuval Rabani [16] [22] [32] [42]
24Venkatesh Raman [1] [7]
25Oded Regev [15] [17] [18] [29] [56]
26Rishi Saket [43] [44] [50] [51] [53] [59] [62]
27Yaoyun Shi [2] [3]
28David Steurer [60]
29Xiaodong Sun [20]
30Madhur Tulsiani [60]
31Nisheeth K. Vishnoi [35] [37] [43] [60]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)