☰

Rajsekar Manokaran, Ph.D. - Publications

Affiliations: 
2012 Computer Science Princeton University, Princeton, NJ 
Area:
Uses of randomness in complexity theory and algorithms; Efficient algorithms for finding approximate solutions to NP-hard problems (or proving that they don't exist); Cryptography.
Tree Info Similar researchers PubMed Report error

11 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2018 Dalmau V, Krokhin AA, Manokaran R. Towards a characterization of constant-factor approximable finite-valued CSPs Journal of Computer and System Sciences. 97: 14-27. DOI: 10.1016/J.Jcss.2018.03.003  0.407
2015 Håstad J, Huang S, Manokaran R, O'Donnell R, Wright J. Improved NP-inapproximability for 2-variable linear equations Leibniz International Proceedings in Informatics, Lipics. 40: 341-360. DOI: 10.4086/Toc.2017.V013A019  0.365
2015 Dalmau V, Krokhin A, Manokaran R. Towards a characterization of constant-factor approximable min CSPs Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 2015: 847-857.  0.33
2014 Makarychev K, Manokaran R, Sviridenko M. Maximum quadratic assignment problem: Reduction from maximum label cover and LP-based approximation algorithm Acm Transactions On Algorithms. 10. DOI: 10.1145/2629672  0.473
2013 Austrin P, Manokaran R, Wenner C. On the NP-hardness of approximating ordering constraint satisfaction problems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8096: 26-41. DOI: 10.4086/Toc.2015.V011A010  0.415
2012 Arora S, Bhattacharyya A, Manokaran R, Sachdeva S. Testing permanent oracles - Revisited Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7408: 362-373. DOI: 10.1007/978-3-642-32512-0_31  0.375
2012 Bhaskara A, Charikar M, Manokaran R, Vijayaraghavan A. On quadratic programming with a ratio objective Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7391: 109-120. DOI: 10.1007/978-3-642-31594-7_10  0.431
2011 Guruswami V, H̊Astad J, Manokaran R, Raghavendra P, Charikar M. Beating the random ordering is hard: Every ordering csp is approximation resistant Siam Journal On Computing. 40: 878-914. DOI: 10.1137/090756144  0.398
2011 Kumar A, Manokaran R, Tulsiani M, Vishnoi NK. On LP-based Approximability for strict CSPs Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1560-1573.  0.366
2009 Charikar M, Guruswami V, Manokaran R. Every permutation CSP of arity 3 is approximation resistant Proceedings of the Annual Ieee Conference On Computational Complexity. 62-73. DOI: 10.1109/CCC.2009.29  0.41
2008 Guruswami V, Manokaran R, Raghavendra P. Beating the random ordering is hard: inapproximability of maximum acyclic subgraph Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 573-582. DOI: 10.1109/FOCS.2008.51  0.395
Show low-probability matches.