Edit Profile Karandikar, Prateek Compute Distance To: Compute Author ID: karandikar.prateek Published as: Karandikar, P.; Karandikar, Prateek Documents Indexed: 12 Publications since 2012 all top 5 Co-Authors 0 single-authored 11 Schnoebelen, Philippe 2 Jančar, Petr 1 Goubault-Larrecq, Jean 1 Halfon, Simon 1 Kufleitner, Manfred 1 Kumar, K. Narayan 1 Niewerth, Matthias 1 Schmitz, Sylvain Serials 2 Logical Methods in Computer Science 1 Information Processing Letters 1 Theoretical Computer Science 1 Theory of Computing Systems Fields 9 Computer science (68-XX) 7 Mathematical logic and foundations (03-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH 8 Publications have been cited 25 times in 15 Documents Cited by ▼ Year ▼ On the index of Simon’s congruence for piecewise testability. Zbl 1312.68160Karandikar, P.; Kufleitner, M.; Schnoebelen, Ph. 7 2015 On the state complexity of closures and interiors of regular languages with subwords and superwords. Zbl 1332.68118Karandikar, P.; Niewerth, M.; Schnoebelen, Ph. 4 2016 Decidability in the logic of subsequences and supersequences. Zbl 1366.03167Karandikar, Prateek; Schnoebelen, Philippe 4 2015 The height of piecewise-testable languages with applications in logical complexity. Zbl 1369.68221Karandikar, Prateek; Schnoebelen, Philippe 3 2016 The parametric ordinal-recursive complexity of Post embedding problems. Zbl 1260.68179Karandikar, Prateek; Schmitz, Sylvain 3 2013 Cutting through regular Post embedding problems. Zbl 1315.03064Karandikar, Prateek; Schnoebelen, Philippe 2 2012 Generalized Post embedding problems. Zbl 1316.03020Karandikar, Prateek; Schnoebelen, Philippe 1 2015 Unidirectional channel systems can be tested. Zbl 1362.68174Jančar, Petr; Karandikar, Prateek; Schnoebelen, Philippe 1 2012 On the state complexity of closures and interiors of regular languages with subwords and superwords. Zbl 1332.68118Karandikar, P.; Niewerth, M.; Schnoebelen, Ph. 4 2016 The height of piecewise-testable languages with applications in logical complexity. Zbl 1369.68221Karandikar, Prateek; Schnoebelen, Philippe 3 2016 On the index of Simon’s congruence for piecewise testability. Zbl 1312.68160Karandikar, P.; Kufleitner, M.; Schnoebelen, Ph. 7 2015 Decidability in the logic of subsequences and supersequences. Zbl 1366.03167Karandikar, Prateek; Schnoebelen, Philippe 4 2015 Generalized Post embedding problems. Zbl 1316.03020Karandikar, Prateek; Schnoebelen, Philippe 1 2015 The parametric ordinal-recursive complexity of Post embedding problems. Zbl 1260.68179Karandikar, Prateek; Schmitz, Sylvain 3 2013 Cutting through regular Post embedding problems. Zbl 1315.03064Karandikar, Prateek; Schnoebelen, Philippe 2 2012 Unidirectional channel systems can be tested. Zbl 1362.68174Jančar, Petr; Karandikar, Prateek; Schnoebelen, Philippe 1 2012 all cited Publications top 5 cited Publications all top 5 Cited by 20 Authors 4 Schnoebelen, Philippe 3 Karandikar, Prateek 3 Rigo, Michel 2 Leroy, Julien 2 Masopust, Tomáš 2 Thomazo, Michaël 1 Halfon, Simon 1 Holub, Štěpán 1 Lazić, Ranko 1 Lejeune, Marie 1 Niewerth, Matthias 1 Okhotin, Alexander 1 Ouaknine, Joel O. 1 Pach, Péter Pál 1 Salomaa, Kai T. 1 Schmitz, Sylvain 1 Selivanov, Viktor L’vovich 1 Stipulanti, Manon 1 Thinniyam, Ramanathan S. 1 Worrell, James B. all top 5 Cited in 11 Serials 3 Theoretical Computer Science 2 Logical Methods in Computer Science 1 Discrete Mathematics 1 Information Processing Letters 1 Journal of Combinatorial Theory. Series A 1 Semigroup Forum 1 Information and Computation 1 Indagationes Mathematicae. New Series 1 Theory of Computing Systems 1 ACM Transactions on Computational Logic 1 ACM Transactions on Computation Theory Cited in 4 Fields 12 Computer science (68-XX) 6 Mathematical logic and foundations (03-XX) 1 Combinatorics (05-XX) 1 Number theory (11-XX) Citations by Year