Prateek Karandikar

19 papers B 2Misc 1Journal 12Unranked 3
YearRankTypeTitle / Venue / Authors
2019 J jnl
The Ideal Approach to Computing Closed Subsets in Well-Quasi-Ordering.
CoRR
Jean Goubault-Larrecq, Simon Halfon, Prateek Karandikar, K. Narayan Kumar, Philippe Schnoebelen
2019 J jnl
The height of piecewise-testable languages and the complexity of the logic of subwords.
Log. Methods Comput. Sci.
Prateek Karandikar, Philippe Schnoebelen
2016 J jnl
On the state complexity of closures and interiors of regular languages with subwords and superwords.
Theor. Comput. Sci.
Prateek Karandikar, Matthias Niewerth, Philippe Schnoebelen
2016 B conf
The Height of Piecewise-Testable Languages with Applications in Logical Complexity.
CSL
Prateek Karandikar, Philippe Schnoebelen
2015 — conf
Decidability in the Logic of Subsequences and Supersequences.
FSTTCS
Prateek Karandikar, Philippe Schnoebelen
2015 J jnl
Decidability in the logic of subsequences and supersequences.
CoRR
Prateek Karandikar, Philippe Schnoebelen
2015 J jnl
Generalized Post Embedding Problems.
Theory Comput. Syst.
Prateek Karandikar, Philippe Schnoebelen
2015 J jnl
Hierarchy of piecewise-testable languages and complexity of the two-variable logic of subsequences.
CoRR
Prateek Karandikar, Philippe Schnoebelen
2015 J jnl
On Reachability for Unidirectional Channel Systems Extended with Regular Tests.
Log. Methods Comput. Sci.
Petr Jancar, Prateek Karandikar, Philippe Schnoebelen
2015 J jnl
On the index of Simon's congruence for piecewise testability.
Inf. Process. Lett.
Prateek Karandikar, Manfred Kufleitner, Philippe Schnoebelen
2015 — —
Subwords : automata, embedding problems, and verification. (Sous-mots : automates, problèmes de plongement, et vérification).
Prateek Karandikar
2014 — conf
On the State Complexity of Closures and Interiors of Regular Languages with Subwords.
DCFS
Prateek Karandikar, Philippe Schnoebelen
2014 J jnl
On the state complexity of closures and interiors of regular languages with subwords.
CoRR
Prateek Karandikar, Philippe Schnoebelen
2013 J jnl
On the index of Simon's congruence for piecewise testability.
CoRR
Prateek Karandikar, Philippe Schnoebelen
2013 B conf
The Parametric Ordinal-Recursive Complexity of Post Embedding Problems.
FoSSaCS
Prateek Karandikar, Sylvain Schmitz
2012 Misc conf
Cutting through Regular Post Embedding Problems.
CSR
Prateek Karandikar, Philippe Schnoebelen
2012 J jnl
The Parametric Ordinal-Recursive Complexity of Post Embedding Problems
CoRR
Prateek Karandikar, Sylvain Schmitz
2012 — conf
Unidirectional Channel Systems Can Be Tested.
IFIP TCS
Petr Jancar, Prateek Karandikar, Philippe Schnoebelen
2011 J jnl
Cutting Through Regular Post Embedding Problems
CoRR
Prateek Karandikar, Philippe Schnoebelen