default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPrateek Karandikar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j5]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)- [i7]Jean Goubault-Larrecq, Simon Halfon, Prateek Karandikar, K. Narayan Kumar, Philippe Schnoebelen:
The Ideal Approach to Computing Closed Subsets in Well-Quasi-Ordering. CoRR abs/1904.10703 (2019) - 2016
- [j4]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: 91-107 (2016) - [c6]Prateek Karandikar, Philippe Schnoebelen:
The Height of Piecewise-Testable Languages with Applications in Logical Complexity. CSL 2016: 37:1-37:22 - 2015
- [b1]Prateek Karandikar:
Subwords : automata, embedding problems, and verification. (Sous-mots : automates, problèmes de plongement, et vérification). École normale supérieure de Cachan, France, 2015 - [j3]Petr Jancar
, Prateek Karandikar, Philippe Schnoebelen:
On Reachability for Unidirectional Channel Systems Extended with Regular Tests. Log. Methods Comput. Sci. 11(2) (2015) - [j2]Prateek Karandikar, Manfred Kufleitner, Philippe Schnoebelen:
On the index of Simon's congruence for piecewise testability. Inf. Process. Lett. 115(4): 515-519 (2015) - [j1]Prateek Karandikar, Philippe Schnoebelen:
Generalized Post Embedding Problems. Theory Comput. Syst. 56(4): 697-716 (2015) - [c5]Prateek Karandikar, Philippe Schnoebelen:
Decidability in the Logic of Subsequences and Supersequences. FSTTCS 2015: 84-97 - [i6]Prateek Karandikar, Philippe Schnoebelen:
Decidability in the logic of subsequences and supersequences. CoRR abs/1510.03994 (2015) - [i5]Prateek Karandikar, Philippe Schnoebelen:
Hierarchy of piecewise-testable languages and complexity of the two-variable logic of subsequences. CoRR abs/1511.01807 (2015) - 2014
- [c4]Prateek Karandikar, Philippe Schnoebelen:
On the State Complexity of Closures and Interiors of Regular Languages with Subwords. DCFS 2014: 234-245 - [i4]Prateek Karandikar, Philippe Schnoebelen:
On the state complexity of closures and interiors of regular languages with subwords. CoRR abs/1406.0690 (2014) - 2013
- [c3]Prateek Karandikar, Sylvain Schmitz:
The Parametric Ordinal-Recursive Complexity of Post Embedding Problems. FoSSaCS 2013: 273-288 - [i3]Prateek Karandikar, Philippe Schnoebelen:
On the index of Simon's congruence for piecewise testability. CoRR abs/1310.1278 (2013) - 2012
- [c2]Prateek Karandikar, Philippe Schnoebelen:
Cutting through Regular Post Embedding Problems. CSR 2012: 229-240 - [c1]Petr Jancar, Prateek Karandikar, Philippe Schnoebelen:
Unidirectional Channel Systems Can Be Tested. IFIP TCS 2012: 149-163 - [i2]Prateek Karandikar, Sylvain Schmitz:
The Parametric Ordinal-Recursive Complexity of Post Embedding Problems. CoRR abs/1211.5259 (2012) - 2011
- [i1]Prateek Karandikar, Philippe Schnoebelen:
Cutting Through Regular Post Embedding Problems. CoRR abs/1109.1691 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
