☰

Rajsekar Manokaran, Ph.D.

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.
Google:
"Rajsekar Manokaran"
Tree Publications Similar researchers PubMed Report error

Parents

Sign in to add mentor
Sanjeev Arora grad student 2012 Princeton
 (Approximability and mathematical relaxations.)

Children

Sign in to add trainee

Collaborators

Sign in to add collaborator
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Dalmau V, Krokhin AA, Manokaran R. (2018) Towards a characterization of constant-factor approximable finite-valued CSPs Journal of Computer and System Sciences. 97: 14-27
Håstad J, Huang S, Manokaran R, et al. (2015) Improved NP-inapproximability for 2-variable linear equations Leibniz International Proceedings in Informatics, Lipics. 40: 341-360
Dalmau V, Krokhin A, Manokaran R. (2015) Towards a characterization of constant-factor approximable min CSPs Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 2015: 847-857
Makarychev K, Manokaran R, Sviridenko M. (2014) Maximum quadratic assignment problem: Reduction from maximum label cover and LP-based approximation algorithm Acm Transactions On Algorithms. 10
Austrin P, Manokaran R, Wenner C. (2013) 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
Arora S, Bhattacharyya A, Manokaran R, et al. (2012) Testing permanent oracles - Revisited Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7408: 362-373
Bhaskara A, Charikar M, Manokaran R, et al. (2012) 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
Guruswami V, H̊Astad J, Manokaran R, et al. (2011) Beating the random ordering is hard: Every ordering csp is approximation resistant Siam Journal On Computing. 40: 878-914
Kumar A, Manokaran R, Tulsiani M, et al. (2011) On LP-based Approximability for strict CSPs Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1560-1573
Charikar M, Guruswami V, Manokaran R. (2009) Every permutation CSP of arity 3 is approximation resistant Proceedings of the Annual Ieee Conference On Computational Complexity. 62-73
See more...