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, Yadu Vasudev.

Students/Scholars :
Project Staffs :

Recent Publications
  • Shortest Paths in a Hybrid Network Model.  
           John Augustine , Kristian Hinnenthal , Fabian Kuhn , Christian Scheideler , Philipp Schneider
          Appeared in Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020., pp.1280-1299, Jan 2020
  • Lower bounds for special cases of syntactic multilinear ABPs.  
           Ramya C , B. V. Raghavendra Rao
          Appeared in Theor. Comput. Sci., Vol 809, pp.1-20, Jan 2020
  • On hard instances of non-commutative permanent.  
           Christian Engels , B. V. Raghavendra Rao
          Appeared in Discret. Appl. Math., Vol 277, pp.127-138, Jan 2020
  • Lower Bounds for Multilinear Order-Restricted ABPs.  
           Ramya C , B. V. Raghavendra Rao
          Appeared in 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany., LIPIcs, Vol 138, pp.52:1-52:14, Aug 2019
  • Sensitivity, Affine Transforms and Quantum Communication Complexity.  
           Krishnamoorthy Dinesh , Jayalal Sarma
          Appeared in Computing and Combinatorics - 25th International Conference, COCOON 2019, Xi'an, China, July 29-31, 2019, Proceedings, Lecture Notes in Computer Science, Vol 11653, pp.140-152, Jul 2019

Sponsored Projects

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