ACT Lab : Algorithms and Complexity Theory LabLink to Lab Webpage

Research AreasAlgebra and Computation, Computational Geometry, Distributed Algorithms, Graph Algorithms, Parameterized Algorithms, Circuit Complexity Theory, Algebraic Complexity Theory, Structural Complexity Theory, Communication Complexity, Pseudorandomness, Boolean Function Analysis.
MembersFaculty : John Augustine, B. V. Raghavendra Rao, Jayalal Sarma.

Students/Scholars :
Project Staffs :

Recent Publications
  • Space Complexity of Reachability Testing in Labelled Graphs.  
           Vidhya Ramaswamy , Jayalal Sarma , Sunil.K.S
          Appeared in Language and Automata Theory and Applications - 11th International Conference, LATA 2017, Ume, Sweden, March 6-9, 2017, Proceedings, Lecture Notes in Computer Science, Vol 10168, pp.351-363, Mar 2017
  • Depth Lower Bounds against Circuits with Sparse Orientation.  
           Sajin.K , Jayalal Sarma
          Appeared in Fundamamentae Informormatica, Vol 152, pp.123-144, Jan 2017
  • Min/Max-Poly Weighting Schemes and the NL versus UL Problem.  
           Anant Dhayal , Jayalal Sarma , Saurabh Sawlani
          Appeared in TOCT, Vol 9, pp.10:1-10:25, Jan 2017
  • Sum of Products of Read-Once Formulas.  
           Ramya C. , B. V. Raghavendra Rao
          Appeared in 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016, December 13-15, 2016, Chennai, India, LIPIcs, Vol 65, pp.39:1-39:15, Dec 2016
  • Characterization and Lower Bounds for Branching Program Size Using Projective Dimension.  
           Dinesh K , Sajin.K , Jayalal Sarma
          Appeared in 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2016, December 13-15, 2016, Chennai, India, LIPIcs, Vol 65, pp.37:1-37:14, Dec 2016

Sponsored Projects

© 2016 - All Rights Reserved - Dept of CSE, IIT Madras
Website Credits