Bhadrachalam Chitturi, Ph.D.
Affiliations: | 2007 | University of Texas at Dallas, Richardson, TX, United States |
Area:
Computer ScienceGoogle:
"Bhadrachalam Chitturi"Parents
Sign in to add mentor| Ivan H. Sudborough | grad student | 2007 | UT Dallas | |
| (On transforming sequences.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Nair PP, Sundaravaradhan R, Chitturi B. (2020) A new upper bound for sorting permutations with prefix transpositions Discrete Mathematics, Algorithms and Applications. 2050077 |
| Kuppili SS, Chitturi B. (2020) Exact upper bound for sorting Rn with LE Discrete Mathematics, Algorithms and Applications. 12: 2050033 |
| Das DK, Chitturi B, Kuppili SS. (2020) An Upper Bound For Sorting Permutations With A Transposition Tree Procedia Computer Science. 171: 72-80 |
| Chitturi B, Das P. (2019) Sorting permutations with transpositions in O(n3) amortized time Theoretical Computer Science. 766: 30-37 |
| Chitturi B, Balachander S, Satheesh S, et al. (2018) Layered Graphs: Applications and Algorithms Algorithms. 11: 93 |
| Chitturi B. (2015) Tighter upper bound for sorting permutations with prefix transpositions Theoretical Computer Science. 602: 22-31 |
| CHITTURI B. (2013) ERRATUM: "UPPER BOUNDS FOR SORTING PERMUTATIONS WITH A TRANSPOSITION TREE" Discrete Mathematics, Algorithms and Applications. 5: 1392001 |
| CHITTURI B. (2013) UPPER BOUNDS FOR SORTING PERMUTATIONS WITH A TRANSPOSITION TREE Discrete Mathematics, Algorithms and Applications. 5: 1350003 |
| Feng X, Chitturi B, Sudborough H. (2010) Sorting circular permutations by bounded transpositions. Advances in Experimental Medicine and Biology. 680: 725-36 |
| Chitturi B, Bein D, Grishin NV. (2010) Complete enumeration of compact structural motifs in proteins Isb 2010 Proceedings - International Symposium On Biocomputing |