default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKanduru V. Krishna
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Tithi Dwary, Kanduru V. Krishna
:
Word-representability of graphs with respect to split recomposition. Discret. Appl. Math. 357: 310-321 (2024)- [j3]Sagar Saha, Kanduru Venkata Krishna:
A branch group in a class of non-contracting weakly regular branch groups. Int. J. Algebra Comput. 34(6): 901-918 (2024)
2010 – 2019
- 2018
- [c2]Shubh Narayan Singh, Kanduru V. Krishna:
On Syntactic Complexity of Circular Semi-flower Automata. CIAA 2018: 312-323 - [i9]Gayatri Panicker, Kanduru V. Krishna, Purandar Bhaduri:
On the structure of C-algebras through atomicity and if-then-else. CoRR abs/1804.00568 (2018) - 2017
- [j2]Gayatri Panicker, Kanduru V. Krishna, Purandar Bhaduri:
Axiomatization of if-then-else over possibly non-halting programs and tests. Int. J. Algebra Comput. 27(3): 273-297 (2017) - [i8]Gayatri Panicker, Kanduru V. Krishna, Purandar Bhaduri:
Axiomatization of if-then-else over monoids of possibly non-halting programs and tests. CoRR abs/1702.05752 (2017) - 2016
- [j1]Shubh Narayan Singh, Kanduru V. Krishna:
The Holonomy Decomposition of some Circular Semi-Flower Automata. Acta Cybern. 22(4): 791-805 (2016) - [i7]Gayatri Panicker, Kanduru V. Krishna, Purandar Bhaduri:
Axiomatization of if-then-else over possibly non-halting programs and tests. CoRR abs/1609.00132 (2016) - 2015
- [i6]Jitender Kumar, Kanduru V. Krishna:
Syntactic semigroup problem for the semigroup reducts of Affine Near-semirings over Brandt Semigroups. CoRR abs/1506.02972 (2015) - 2014
- [i5]Shubh Narayan Singh, Kanduru V. Krishna:
$L$-Primitive Words in Submonoids. CoRR abs/1403.5788 (2014) - 2013
- [i4]Shubh Narayan Singh, Kanduru V. Krishna:
The Holonomy Decomposition of Circular Semi-Flower Automata. CoRR abs/1306.2548 (2013) - [i3]Shubh Narayan Singh, Kanduru V. Krishna:
Syntactic Complexity of Circular Semi-Flower Automata. CoRR abs/1306.3492 (2013) - 2011
- [c1]Vedala T. K. Pramod, Kanduru V. Krishna:
Towards Shortest Synchronizing Words in Polynomial Time. AFL 2011: 358-367 - [i2]Shubh Narayan Singh, Kanduru V. Krishna:
The Rank and Hanna Neumann Property of Some Submonoids of a Free Monoid. CoRR abs/1112.4250 (2011) - [i1]Shubh Narayan Singh, Kanduru V. Krishna:
A Sufficient Condition for Hanna Neumann Property of Submonoids of a Free Monoid. CoRR abs/1112.4256 (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-10-23 21:22 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:
