About the Conference:
Theoretical computer science is a part of general computer science and focuses on more abstract or mathematical aspects of computing. The major areas covered under this field include algorithms, data
structures, logic, computational complexity theory, distributed computation, parallel computation, Nature (Bio) Inspired Computing Techniques, VLSI, machine
learning, computational biology, computational geometry, information theory, cryptography, quantum computation, computational number theory and algebra,
program semantics and verification, automata theory, the study of randomness, Graphs and Combinatorics. Work in this field is often distinguished by its emphasis on
mathematical technique and rigor.
Discrete Mathematics provides the underpinnings of most of fields in Theoretical Computer Science. Problems in many areas of discrete mathematics, such as combinatorics and graph theory, naturally lend themselves to algorithmic techniques. Modern applications of discrete mathematics abound in areas such as business and social and physical sciences. This has fueled much research in discrete mathematics and theoretical computer science, including that being carried out in the departments of Mathematics and Computer Science in various institutions all over the country and in several leading institutions outside the country.
The purpose of this conference is to bring together experts and young researchers and provide a platform for discussion of recent advances in the relevant research areas and presentation of research papers by young scientists. We hope to have in-depth discussion on the front-line challenging problems on various topics. Apart from invited talks by leading experts in the field and presentation of research papers by other delegates, we hope to organize informal interactive after-dinner discussion sessions that will provide opportunities for young researchers to interact with the leading experts in the field. In these informal sessions, young researchers can freely interact with experts, identify potential problems for further research and the possible tools that can be employed in solving them. It is hoped that these in-depth discussions and lectures by the invited speakers will motivate the young researchers to enter into some of the highly fertile research areas in Theoretical Computer Science and Discrete Mathematics.