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 the emerging computation
problems, which have characteristics like inaccurate data, acceptance of
approximate solutions, huge sized data, requirement of fast response time,
requirement of robustness & implications on privacy and
security.
Cryptanalysis of stream ciphers, block ciphers & hash functions. Design of
lighweight cryptographic primitives. Research & development of practice
oriented cryptography.
Investigate Quantum Circuit as a model of computation. Designing new quantum
algorithms and quantum cryptographic protocols.
Faculty Members
- Astrid Kiehn (Associate Professor) B-205 astrid @ ...
- Debajyoti Bera (Assistant Professor) B-204 dbera @ ...
- Rajiv Raman (Assistant Professor) B-202 rajiv @ ...
- Ashwin Srinivasan (Professor, Affiliated faculty) B-203 ashwin @ ...
- Donghoon Chang (Assistant Professor, Affiliated faculty) A-401 donghoon @ ...
- Somitra Kr. Sanadhya (Assistant Professor, Affiliated faculty) A-402 somitra @ ...
PhD Students
- Monalisa Jena (2012-) 2nd Floor B-Wing PhD Lab monalisaj @ ...
Some of our research interests are:
- Logic
- Process algebras, modeling and verification of distributed systems
- Complexity theory
- Quantum computing, quantum complexity
- Theoretical aspects of privacy and security
- Algorithms
- Cryptography
- Combinatorial optimisation
- Graph theory
UG Courses
- Discrete mathematics
- Data Structures and Algorithms
- Analysis and Design of Algorithms
- Theory of computation
Advanced Courses
- Advanced Algorithms
- Probability in Computing
- Logic in Computer Science
- Verification of Reactive Systems
- Theory of Moden Cryptography
Mailing list: theory@iiitd.ac.in
(To join, visit this page)
T-Talks is an informal meeting for all members of IIIT-D interested in theoretical aspect of computer science and its application.
We meet once a week with tea (or coffee) and high interest to learn and discuss something new. Basis of this can be a presentation by any of the T-Talks members (about current work or interest, a conference paper, a student's project, etc). It is also possible to read a paper or book together, where each week one person is (better) prepared and takes the lead. Presentations should be such that all members get out something of it (including first year students). Unless otherwise specified, we meet in the ground floor glassroom near cafeteria during 1-2pm.
Schedule for 2013 Winter Semester:- 8th Feb - Rajiv Raman (Solving zero-sum games approximately)
- 15th Feb - Turing Award lecture by Judea Pearl (Video)
- 22nd Feb - Somitra Sanadhya(A certain Arithmetic Progression)
- 8th Mar - N Is a Number: A Portrait of Paul Erdös (Video)
- 22nd Mar - Debajyoti Bera(Probabilistic Method)