Lab Details

ACT Lab : Algorithms and Complexity Theory LabLink to Lab Webpage

Research Areas	Algebra 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.
Members	Faculty : John Augustine, B. V. Raghavendra Rao, Jayalal Sarma, Yadu Vasudev. Students/Scholars : . PhD : Sumathi S, Om Prakash, Anoop S K M, Bhabya Deep Rai. MS : Aiyer Anand Ravi, Subhadra Nanda, Ankit Kumar Yadav, Sagar Bisoyi, Barath Ashok, Sampriti Roy, Amit Kumar Roy, Prithaj Banerjee, Dipra Bhagat, Pranjal Agadh Chitale, Omkar Dilip Dhawal, Saurabh Kumar Jain, Kondapalli Jayavardhan, Nandini Mundra, Indranil Paul, A K Raghavan, Bhabya Deep Rai, Srikkanth Ramachandran, Akshay G Rao, Bhargavi Sriram, Amit Tiwari, Keshav Tiwari, Praveen Srinivasa Varadhan. M.Tech : Akshay M Potey. 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 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 Testing Properties of Distributions in the Streaming Model. Sampriti Roy , Yadu Vasudev Appeared in 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, LIPIcs, Vol 283, pp.56:1-56:17, Dec 2023 Separating Words Problem over Groups. Neha Kuntewar , S. K. M. Anoop , Jayalal Sarma Appeared in Descriptional Complexity of Formal Systems - 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4-6, 2023, Proceedings, Lecture Notes in Computer Science, Vol 13918, pp.109-120, Jul 2023
Sponsored Projects	Explorations on Computational Problems for Polynomials related to Arithmetic Circuit Complexity (Funding Agency :DST) Explorations on Computational Problems for Polynomials related to Arithmetic Circuit Complexity (Funding Agency :DST-SERB) Distributed Algorithms for Dynamic Networks (Funding Agency :DST-SERB) Algebraic and Parameterized Complexities (Funding Agency :IMPECS) Resource Bounds for Boolean/Arithmetic Circuits under Combinatorial and Algebraic constraints (Funding Agency :NFSG)

Department of Computer Science & Engineering

Indian Institute of Technology Madras, Chennai, India.