Prateek Karandikar

Publication Activity (10 Years)

Years Active: 2011-2019
Publications (10 Years): 4

Top Venues

CoRR

Log. Methods Comput. Sci.

FoSSaCS

Inf. Process. Lett.

École normale supérieure de Cachan, France (PHD)

Education History

École normale supérieure de Cachan, France

PHD

Publications

Jean Goubault-Larrecq, Simon Halfon, Prateek Karandikar, K. Narayan Kumar, Philippe Schnoebelen
The Ideal Approach to Computing Closed Subsets in Well-Quasi-Ordering. CoRR (2019)
Prateek Karandikar, Philippe Schnoebelen
The height of piecewise-testable languages and the complexity of the logic of subwords. Log. Methods Comput. Sci. 15 (2) (2019)
Prateek Karandikar, Matthias Niewerth, Philippe Schnoebelen
On the state complexity of closures and interiors of regular languages with subwords and superwords. Theor. Comput. Sci. 610 (2016)
Prateek Karandikar, Philippe Schnoebelen
The Height of Piecewise-Testable Languages with Applications in Logical Complexity. CSL (2016)
Prateek Karandikar, Philippe Schnoebelen
Generalized Post Embedding Problems. Theory Comput. Syst. 56 (4) (2015)
Prateek Karandikar, Manfred Kufleitner, Philippe Schnoebelen
On the index of Simon's congruence for piecewise testability. Inf. Process. Lett. 115 (4) (2015)
Prateek Karandikar, Philippe Schnoebelen
Hierarchy of piecewise-testable languages and complexity of the two-variable logic of subsequences. CoRR (2015)
Prateek Karandikar, Philippe Schnoebelen
Decidability in the Logic of Subsequences and Supersequences. FSTTCS (2015)
Prateek Karandikar, Philippe Schnoebelen
Decidability in the logic of subsequences and supersequences. CoRR (2015)
Petr Jancar, Prateek Karandikar, Philippe Schnoebelen
On Reachability for Unidirectional Channel Systems Extended with Regular Tests. Log. Methods Comput. Sci. 11 (2) (2015)
Prateek Karandikar, Philippe Schnoebelen
On the state complexity of closures and interiors of regular languages with subwords. CoRR (2014)
Prateek Karandikar, Philippe Schnoebelen
On the State Complexity of Closures and Interiors of Regular Languages with Subwords. DCFS (2014)
Prateek Karandikar, Sylvain Schmitz
The Parametric Ordinal-Recursive Complexity of Post Embedding Problems. FoSSaCS (2013)
Prateek Karandikar, Philippe Schnoebelen
On the index of Simon's congruence for piecewise testability. CoRR (2013)
Prateek Karandikar, Sylvain Schmitz
The Parametric Ordinal-Recursive Complexity of Post Embedding Problems CoRR (2012)
Petr Jancar, Prateek Karandikar, Philippe Schnoebelen
Unidirectional Channel Systems Can Be Tested. IFIP TCS (2012)
Prateek Karandikar, Philippe Schnoebelen
Cutting through Regular Post Embedding Problems. CSR (2012)
Prateek Karandikar, Philippe Schnoebelen
Cutting Through Regular Post Embedding Problems CoRR (2011)

Prateek Karandikar.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Prateek Karandikar