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
  • Sensitivity, Affine Transforms and Quantum Communication Complexity.  
           Krishnamoorthy Dinesh 0001 , 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
  • On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models.  
           Purnata Ghosal , B. V. Raghavendra Rao
          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.178-192, Jul 2019
  • Distributed Computation in Node-Capacitated Networks.  
           John Augustine , Mohsen Ghaffari , Robert Gmyr , Kristian Hinnenthal , Christian Scheideler , Fabian Kuhn , Jason Li
          Appeared in The 31st ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Phoenix, AZ, USA, June 22-24, 2019., pp.69-79, Jun 2019
  • Fast distributed algorithms for testing graph properties.  
           Keren Censor-Hillel , Eldar Fischer , Gregory Schwartzman , Yadu Vasudev
          Appeared in Distributed Computing, Vol 32, pp.41-57, Jan 2019
  • Space complexity of reachability testing in labelled graphs.  
           Vidhya Ramaswamy , Jayalal Sarma , K. S. Sunil
          Appeared in J. Comput. Syst. Sci., Vol 105, pp.40-53, Jan 2019

Sponsored Projects

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