| | |
- CSB - MetaPress - Google - Bing - Yahoo
 | 2011 | |
|---|---|---|
| 4 |      | Mikhail Alekhnovich, Sanjeev Arora, Iannis Tourlakis: Towards Strong Nonapproximability Results in the Lovász-Schrijver Hierarchy. Computational Complexity 20(4): 615-648 (2011) |
| 3 | | Mikhail Alekhnovich, Subhash Khot, Guy Kindler, Nisheeth K. Vishnoi: Hardness of Approximating the Closest Vector Problem with Pre-Processing. Computational Complexity 20(4): 741-753 (2011) |
| 2007 | ||
| 2 | | Mikhail Alekhnovich, Eli Ben-Sasson: Linear Upper Bounds for Random Walk on Small Density Random 3-CNFs. SIAM J. Comput. 36(5): 1248-1263 (2007) |
| 2005 | ||
| 1 | | Mikhail Alekhnovich, Subhash Khot, Guy Kindler, Nisheeth K. Vishnoi: Hardness of Approximating the Closest Vector Problem with Pre-Processing. FOCS 2005: 216-225 |
| 1 | Sanjeev Arora | [4] |
| 2 | Eli Ben-Sasson | [2] |
| 3 | Subhash Khot | [1] [3] |
| 4 | Guy Kindler | [1] [3] |
| 5 | Iannis Tourlakis | [4] |
| 6 | Nisheeth K. Vishnoi | [1] [3] |
Colors in the list of coauthors
Last update Sat May 26 04:23:17 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page