Towards Shortest Synchronizing Words in Polynomial Time. - Vedala T. K. Pramod; Kanduru V. Krishna (AFL, 2011)

The Rank and Hanna Neumann Property of Some Submonoids of a Free Monoid - Shubh Narayan Singh; Kanduru V. Krishna (CoRR, 2011)

A Sufficient Condition for Hanna Neumann Property of Submonoids of a Free Monoid - Shubh Narayan Singh; Kanduru V. Krishna (CoRR, 2011)

The Holonomy Decomposition of Circular Semi-Flower Automata. - Shubh Narayan Singh; Kanduru V. Krishna (CoRR, 2013)

$L$-Primitive Words in Submonoids. - Shubh Narayan Singh; Kanduru V. Krishna (CoRR, 2014)

Syntactic semigroup problem for the semigroup reducts of Affine Near-semirings over Brandt Semigroups. - Jitender Kumar; Kanduru V. Krishna (CoRR, 2015)

The Holonomy Decomposition of some Circular Semi-Flower Automata. - Shubh Narayan Singh; Kanduru V. Krishna (Acta Cybern., 2016)

Axiomatization of if-then-else over monoids of possibly non-halting programs and tests. - Gayatri Panicker; Kanduru V. Krishna; Purandar Bhaduri (CoRR, 2017)

Axiomatization of if-then-else over possibly non-halting programs and tests. - Gayatri Panicker; Kanduru V. Krishna; Purandar Bhaduri (Int. J. Algebra Comput., 2017)

On Syntactic Complexity of Circular Semi-flower Automata. - Shubh Narayan Singh; Kanduru V. Krishna (CIAA, 2018)

On the structure of C-algebras through atomicity and if-then-else. - Gayatri Panicker; Kanduru V. Krishna; Purandar Bhaduri (CoRR, 2018)

Characterization of Double-Arborescences and their Minimum-Word-Representants. - Tithi Dwary; Kanduru V. Krishna (CoRR, 2024)

Characterization of Word-Representable Graphs using Modular Decomposition. - Tithi Dwary; Kanduru V. Krishna (CoRR, 2024)

Word-representability of graphs with respect to split recomposition. - Tithi Dwary; Kanduru V. Krishna (Discret. Appl. Math., 2024)

A branch group in a class of non-contracting weakly regular branch groups. - Sagar Saha; Kanduru Venkata Krishna (Int. J. Algebra Comput., 2024)