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
  • Energy and Output Patterns in Boolean Circuits.  
           Jayalal Sarma , Kei Uchizawa
          Appeared in Theory and Applications of Models of Computation - 18th Annual Conference, TAMC 2024, Hong Kong, China, May 13-15, 2024, Proceedings, Lecture Notes in Computer Science, Vol 14637, pp.185-196, May 2024
  • Awake Complexity of Distributed Minimum Spanning Tree.  
           John Augustine , William K. Moses Jr. , Gopal Pandurangan
          Appeared in Structural Information and Communication Complexity - 31st International Colloquium, SIROCCO 2024, Vietri sul Mare, Italy, May 27-29, 2024, Proceedings, Lecture Notes in Computer Science, Vol 14662, pp.45-63, May 2024
  • On Rotation Distance of Rank Bounded Trees.  
           S. K. M. Anoop , Jayalal Sarma
          Appeared in Fundam. Informaticae, Vol 191, No., pp.79-104, Jan 2024
  • Proper q-caterpillars are distinguished by their Chromatic Symmetric Functions.  
           Arunkumar Ganesan , Narayanan Narayanan , B. V. Raghavendra Rao , Sagar S. Sawant
          Appeared in Discret. Math., Vol 347, No., pp.114162, Jan 2024
  • Local Recurrent Problems in the SUPPORTED Model.  
           Akanksha Agrawal , John Augustine , David Peleg , Srikkanth Ramachandran
          Appeared in 27th International Conference on Principles of Distributed Systems, OPODIS 2023, December 6-8, 2023, Tokyo, Japan, LIPIcs, Vol 286, pp.22:1-22:19, Dec 2023

Sponsored Projects

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