Computational complexity and computability are central themes in theoretical computer science that address the fundamental question of what can be computed and at what cost. Computability theory ...

Computer Science Professors Christos Papadimitriou and Mihalis Yannakakis received the John von Neumann Theory Prize for their research in computational complexity theory that explores the boundaries ...

Professor Uehara from JAIST works at the intersection of theoretical computer science, discrete mathematics, and the art of solving puzzles. His research strives to understand the computational ...

This course covers special topics in theory within Computer Science. Understanding theory is fundamental in any Computational Science venture as it is the foundation on which all work and applications ...

Computational scientist and mathematician Avi Wigderson of the Institute for Advanced Study (IAS) in Princeton has won the 2023 A.M. Turing Award. The prize, which is given annually by the Association ...

For Shang-Hua Teng, theoretical computer science has never been purely theoretical. Now 58, Teng is a professor of computer science at the University of Southern California and a two-time winner of ...

My past research has existed in the intersection of logic and descriptive set theory with computational complexity theory. Particular topics relevant to this research have centered around oracle ...

Prof. V. Kamakoti, Director of IIT Madras, expressed his gratitude saying, "The generosity of Mr. Raghunathan and his continued commitment to the students of IIT Madras through ARtCS will advance ...

Madras today announced a generous commitment from its alumnus Arvind Raghunathan to the Centre for Theoretical Computer Science.