Subrahmanyam Kalyanasundaram
Assistant Professor
Dept. of Computer Science and Engineering
IIT Hyderabad

About me

I completed my ACO Ph.D. in the Theory Group at College of Computing, Georgia Institute of Technology.
My Ph.D. advisors were Dick Lipton and Asaf Shapira.
My research interests are Complexity Theory, Combinatorics, Algebra, Randomized Algorithms.
Email me for my CV.


    - An Optimal Algorithm for Computing Frieze-Kannan Regular Partitions (pdf)
            (with D. Dellamonica, D. Martin, V. Rödl, and A. Shapira)
    - A Note on Even Cycles and Quasi-Random Tournaments (pdf) (arXiv)
            (with A. Shapira)
            Journal of Graph Theory, Volume 73, Issue 3, pages 260-266, July 2013
    - A Wowzer-Type Lower Bound for the Strong Regularity Lemma (arXiv)
            (with A. Shapira)
            Proceedings of the London Mathematical Society, Volume 106, Issue 3, pages 621-649, March 2013
    - A Deterministic Algorithm for the Frieze-Kannan Regularity Lemma (pdf)
            (with D. Dellamonica, D. Martin, V. Rödl, and A. Shapira)
            SIAM Journal on Discrete Math (SIDMA) 26, pages 15-29, January 2012
            Preliminary version appeared in the Proceedings of the 15th. International Workshop on Randomization and Computation (RANDOM'2011)
    - Faster Simulation of Counting Classes
            (with K.W. Regan)
    - Improved Simulation of Nondeterministic Turing Machines (pdf)
            (with R.J. Lipton, K.W. Regan, and F. Shokrieh)
            Theoretical Computer Science (Special MFCS 2010 Issue) Volume 417, pages 66-73, February 2012
            Preliminary version appeared in the Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science (MFCS 2010)
    - Algorithms for Message Ferrying on Mobile ad hoc Networks (pdf)
            (with M. Ammar, D. Chakrabarty, A. Das Sarma, and R.J. Lipton)
            Proceedings of IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS) 2009
    - High-rate, full-diversity STBC's from Field Extensions (pdf)
            (with V. Shashidhar, R. Chandrasekharan, B. Sundar Rajan, and B.A. Sethuraman)
            Proceedings of IEEE International Symposium on Information Theory (ISIT) 2003

Teaching this semester

    - CS 2010 Data Structures and Algorithms (Course webpage)
    - CS 2011 Data Structures and Programming Lab (Course webpage)
    - Courses taught previously


    - Turing Machine Algorithms and Studies in Quasi-randomness (pdf)
            Ph.D. Thesis, Georgia Institute of Technology, 2011
    - On Coding Gain of STBC's from Field Extensions (pdf)
            Master's Thesis, Indian Institute of Science, 2003


World's most successful businessmen.

This page was last modified on