I completed my PhD in computer science jointly from CMI and LSV, ENS Cachan, France. My advisors are Narayan Kumar and Philippe Schnoebelen.
Publications
Journals
- Prateek Karandikar, Matthias Niewerth, Philippe Schnoebelen: On the state complexity of closures and interiors of regular languages with subwords. Theoretical Computer Science, October 2015. (arxiv)
DOI: 10.1016/j.tcs.2015.09.028
- Petr Jančar, Prateek Karandikar, Philippe Schnoebelen: On reachability for unidirectional channel systems extended with regular tests. Logical Methods in Computer, April 2015. (arxiv)
DOI: 10.2168/LMCS-11(2:2)2015
- Prateek Karandikar, Manfred Kufleitner, Philippe Schnoebelen: On the index of Simon's congruence for piecewise testability. Information Processing Letters, November 2014. (arxiv)
DOI:10.1016/j.ipl.2014.11.008
- Prateek Karandikar, Philippe Schnoebelen: Generalized Post embedding problems. Theory of Computing Systems, September 2014. (arxiv)
DOI: 10.1007/s00224-014-9561-9
Conferences
- Prateek Karandikar, Philippe Schnoebelen: Decidability in the logic of subsequences and supersequences. FSTTCS 2015. (arxiv)
- Prateek Karandikar, Philippe Schnoebelen: On the state complexity of closures and interiors of regular languages with subwords. DCFS 2014. (arxiv)
DOI:10.1007/978-3-319-09704-6_21
- Prateek Karandikar, Sylvain Schmitz: The parametric ordinal-recursive complexity of Post embedding problems. FoSSaCS 2013. (arxiv)
DOI:10.1007/978-3-642-37075-5_18
- Petr Jančar, Prateek Karandikar, Philippe Schnoebelen: Unidirectional channel systems can be tested. IFIP TCS 2012. (arxiv)
DOI:10.1007/978-3-642-33475-7_11
- Prateek Karandikar, Philippe Schnoebelen: Cutting through regular Post embedding problems. CSR 2012. (arxiv)
DOI:10.1007/978-3-642-30642-6_22
(dblp)
Other stuff
Contact
[firstname]@cmi.ac.in