Booth Center for Advanced Technology
I am a graduate student in
Computer Science & Engineering
Dr.Sanguthevar Rajasekaran .
I Work in Applied Algorithms Lab.
My research interests include Algorithm Design,Complexity,Combinatorial Optimization,Computational Geometry and Applied Algorithms for VLSI Design Automation and BioInformatics. This is kind of a static page visit my Blog for a more dynamic side of mine. Also you might find some of my open-source (Launchpad) and (Sourceforge) projects, useful to you.
J.8 V.Kundeti and S.Rajasekaran, On the Hardness of the Border Length Minimization Problem on a Rectangular Array, International Journal of Foundations of Computer Science, Volume 21, Issue 6, December 2010, pp. 1089-1100.
J.7 V.Kundeti, S.Rajasekaran, H. Dinh, M. Vaughn and V. Thapar, Efficient Parallel and Out of Core Algorithms for Constructing Large bi-directed de Bruijn Graphs, BMC Bioinformatics, Volume 11, Number 1, November 2010, pp. 560-588.
J.6 V.Kundeti and S.Rajasekaran, Fast Algorithms for Permuting Large Entries along the Diagonal of a Sparse Matrix, Journal of Computational and Applied Mathematics , Volume 235, Issue 3, December 2010, pp. 756-764.
J.5 S. Rajasekaran, V. Kundeti, V. Kumar, S. Sahni, and R. Birge, Efficient Algorithms for Computing With Protein-based Volumetric Memory Processors, IEEE Transactions on Nanotechnology. [doi: 10.1109/TNANO.2010.2089531] (in press) .
J.4 V.Kundeti and S.Rajasekaran, Efficient Algorithms for Self Assembling Non-Rectangular Nano Structures, Journal of Natural Computing , 2011, Vol. 10, pp. 583-605(1).[DOI: 10.1007/s11047-010-9210-4].
J.3 V.Kundeti and S.Rajasekaran, Spectrum Based Techniques for Graph Isomorphism, International Journal on Foundations of Computer Science, 2009, Vol. 20, pp.479-499(3).
J.2 S.Rajasekaran, S.Balla, P.Gradie, M.R.Gryk, K.Kadaveru, V.Kundeti, M.W. Maciejewski, T.Mi, N.Rubino, J.Vyas, M.R. Schiller, Minimotif miner-II: a database and web system for motif search, Nucleic Acids Research, 2009, Vol. 37, pp.185-190.
J.1 V.Kundeti and P.Gupta, Optimal Algorithms for Some Polygon Enclosure Problems for VLSI Layout Analysis, Journal of Mathematical Modelling and Algorithms, Volume 5, Number 3, September 2006 , pp. 259-271(13)
C.12 V.Kundeti, S.Rajasekaran and H.Dinh, An Efficient Algorithm For Chinese Postman Walk on Bi-directed de Bruijn Graphs. (To Appear) In Proceedings of The 4th Annual International Conference on Combinatorial Optimization and Applications (COCOA-2010), Hawaii, December, 2010 [arxiv:1006.4828]
C.11 V.Kundeti, S.Rajasekaran and H.Dinh, On the Border Length Minimization Problem (BLMP) on a Square Array, In Proceedings of ACM International Conference on Bioinformatics and Computational Biology (ACM-BCB), New York, August, 2010, pp. 112-119. [arxiv:1003.2839]
C.10 V.Kundeti and S.Rajasekaran, Randomized Self Assembly of Rectangular Nano Structures, in Proceedings of 16th International Conference on DNA Computing and Molecular Programming (DNA-16 ), Hong Kong, June, 2010, pp.12-24.
C.9 V.Kundeti and S.Rajasekaran, On The Hardness Of The Border Length Minimization Problem, in Proceedings of 9th Annual IEEE International Conference on BioInformatics and BioEngineering (IEEE BIBE-09), June, 2009, pp.248-253.
C.8 V.Kundeti and S.Rajasekaran, Efficient Algorithms for Self Assembling Triangular and other Nano Structures, in Proceedings of 5th International Symposium on Bioinformatics Research and Applications (ISBRA-09), May, 2009, pp.148-158.
C.7 V.Kundeti and S.Rajasekaran, Generalized Algorithms for Generating Balanced Modulation Codes In Protein-based Volumetric Memories, in Proceedings of 10th Annual IEEE Congress on Evolutionary Computation (IEEE CEC-09), May, 2009, pp.1585-1590.
C.6 V.Kundeti and J.Chandy, FEARLESS: Flash Enabled Active Replication of Low End Survivable Storage, in Proceedings of 1st (ACM ASPLOS-09) satellite Workshop on Integrating Solid-state Memory into the Storage Hierarchy (WISH), March, 2009.
C.5 V.Kundeti and S.Rajasekaran, Efficient PDM Sorting Algorithms, in Proceedings of 15th Annual IEEE International Conference on High Performance Computing (IEEE/ACM HiPC-08), December, 2008, pp.97-107.
C.4 V.Kundeti and S.Rajasekaran, A Local Structual Alignment Algorithm with Variable Length Alignment Fragment Pairs, in Proceedings of 8th Annual IEEE International Conference on BioInformatics and BioEngineering (IEEE BIBE-08), October, 2008, pp.1-7.
C.3 V.Kundeti, Y.Fei and S.Rajasekaran, An Efficient Digital Circuit for Implementing Sequence Alignment Algorithm in an Extended Processor, in Proceedings of 19th Annual IEEE International Conference on Application-specific Systems, Architectures and Processors (IEEE ASAP-08), July, 2008, pp.156-161.
C.2 V.Kundeti and S.Rajasekaran, Extending the Four Russian Algorithm to Compute the Edit Script in Linear Space, in Proceedings of 8th International Conference on Computational Science (ICCS-08), June, 2008, Springer-Verlag,5101-0893, pp.893-902.
C.1 V.Kundeti and P.Gupta, Efficient Polygon Enclosure Algorithms for Device Extraction from VLSI Layouts, in Proceedings of the Canadian Conference on Computational Geometry (CCCG-04), August, 2004, pp.82-85.