A good theoretical foundation adds undeniable strength to any computing paradigm. We investigate the theoretical boundaries of the computation problems in Information Technology and Computer Science. Our projects are collaborative by nature and we work with the other groups at IIIT-Delhi on various projects.
Designing algorithms for emerging computation problems using the concepts of randomization, approximation and parameterization.
Designing new quantum algorithms and investigating the limits of quantum computation.
Designing solutions to optimization & graph-theoretic problems.
Theoretical aspects of cryptography and blockchain.
Current Faculty Members
- Debajyoti Bera (Associate Professor) B-508 dbera @ ... Quantum computing, Randomized & graph algorithms
- Rajiv Raman (Associate Professor) B-507 rajiv @ ... Algorithms, Combinatorial optimization, Graph theory, Discrete & computational geometry
- Syamantak Das (Assistant Professor) B-512 syamantak @ ... Algorithms, Approximation algorithms, Discrete optimization
- Diptapriyo Majumdar (Assistant Professor) B-501 diptapriyo @ ... Parameterized algorithms, Graph algorithms
- Subhabrata Samajder (Assistant Professor) B-505 subhabrata @ ... Cryptpgraphy, Blockchain, Random graphs
- Tharrmashastha SAPV (2019-) tharrmashasthav @ ... Quantum computing
- Sagnik Chatterjee (2019-) sagnikc @ ... Quantum computing
- Suryendu Dalal (2020-) suryendud @ ... Computational Geometry, Fine-Grained Complexity and Algorithms
- Ritesh Seth (2021-) riteshs @ ... Graph algorithms
- Jaya Sharma (2022-) jayas @ ... Lattice-based cryptography
- Rahul Gangopadhyay (graduated, 2020) Rectilinear Crossing Number of Uniform Hypergraphs
Publications in the last 5 years are listed below.
- Discrete Mathematics
- Data Structures and Algorithms
- Analysis and Design of Algorithms
- Theory of Computation
- Advanced Algorithms
- Theory of Moden Cryptography
- Modern Algorithm Design
- Applied Cryptograpy
- Topics in Cryptanalysis
- Approximation Algorithms
- Graduate Algorithms