Bhadrachalam Chitturi

Associate Professor of Instruction, Computer Science
School of Engineering and Computer Science
Ph. D., University of Texas at Dallas
Reseach Associate, UTSW Medical Center

The University of Texas at Dallas
P. O. Box 830688
Richardson, TX 75083-0688
Phone: (972) 883-2136

Teaching

Please check here (often) for updates to the policies, these are influenced by the university, school and department policies

Read your E-learning announcements and e-mails regularly.
All material will be posted in Elearning.
There is a strong correlation between attending classes, participating in the class and the performance.
Students are encouraged to discuss in Elearning discusion forums.
A student is expected to be pro-active; e.g. one is expected to immediately communicate to the instructor about any issues (technological or otherwise).
Students who cannot take the exams at the prescribed time must inform the instructor in advance (except in the case of emergencies). Reasonable alternatives will be given.
Students must not discuss exams/quizzes with anyone exept the instructor during the office hours.

Algorithms Material

Research Areas

Algorithm design, discrte mathematics, bioinformatics, biocomputing, machine learning.

Recent Publications:

"Optimal Algorithms for Sorting Permutations with Brooms", (with Indulekha TS), Algorithms, 15(7)220, 2022, https://doi.org/10.3390/a15070220.
"Approximation Algorithms for Sorting Permutations by Extreme Block-interchanges", (with Jayakumar P), Theoretical Computer Science , (891)105-115, 2021.
"Improved Upper Bound for Sorting Permutations with Prefix Transpositions", (with P Nair, R Sundavaradhan), Theoretical Computer Science , (896)158-167, 2021.
"Computing cardinalities of subsets of S_n with k adjacencies", JCMCC CXIII, pp.183-195, May 2020.
"Exact upper bound for sorting R_n with LE", (with S S Kuppili) DMAA , 12(03)2050033, 2020.
"Sorting permutations with transpositions in O(n³) amortized time", (with P Das), Theoretical Computer Science , 766 (2019).
"Layered Graphs: Applications and Algorithms", (with S Balachander, S Satheesh, K Puthiyoppil), Algorithms, 11 (2018).
“Compact structure patterns in proteins”, (with Shuoyong Shi, Lisa Kinch and Nick Grishin), Journal of Molecular Biology, 428(21), 2016

Profiles

Researchgate: https://www.researchgate.net/profile/Bhadrachalam_Chitturi

Linkedin: https://www.linkedin.com/in/chalam-c-3409891/

Errata

B. Chitturi, Krishnaveni K S. “Adjacencies in Permutations.” arXiv preprint arXiv:1601.04469 (2016). We detected some minor errors in the computation of the probabilities. Certain assumptions must have been more explicit.

B. Chitturi, IH Sudborough: Bounding prefix transposition distance for strings and permutations. Theor. Comput. Sci. 421: 15-24 (2012) In page 4: (3) for all i, the symbol ti-1 is in a position to the right of si+1 . ti-1 should be read as ti-1. This is explained in the text that follows this condition.

B. Chitturi, D. Bein, NV Grishin. Complete enumeration of compact structural motifs in proteins. In Proceedings of the International Symposium on Biocomputing 2010 Feb 15 (p. 19). ACM. Dom_Set algorithm was meant to be the knowm standard DP algorithm. However, it is written incorrectly. At that time, the authors were unfamiliar with the corr. reference (given below). In later articles the reference was cited. EJ Cockayne, S Goodman, S Hedetniemi. A linear algorithm for the domination number of a tree. Information Processing Letters, 4(2):41-4, 1 Nov 1975.

B. Chitturi, I.H. Sudborough, Prefix reversals on strings, in: Proceedings of International Conference in Bioinformatics and Computational Biology, BIOCOMP 2010, pp. 591-598. PTAS must be simply read as an approximation algorithm.