Theory of Computation (TOC) is the study of the inherent capabilities and limitations of computers: not just the computers of today, but any computers that could ever be built. By its nature, the subject is close to mathematics, with progress made by conjectures, theorems, and proofs. What sets TOC apart, however, is its goal of understanding computation — not only as a tool but as a fundamental phenomenon in its own right.

At MIT, we are interested in a broad range of TOC topics, including algorithms, complexity theory, cryptography, distributed computing, computational geometry, computational biology, and quantum computing.


The CIS group seeks to develop techniques for securing tomorrow’s global information infrastructure by exploring theoretical foundations, near-term practical applications, and long-range speculative research.We aim to understand the theoretical power of cryptography and the practical engineering of secure information systems, from appropriate definitions and proofs of security, through cryptographic algorithm and protocol design, to implementations of real applications with easy-to-use security features.We are also interested in the relationship of our field to others, such as complexity theory, quantum computing, algorithms, machine learning, and cryptographic policy debates.



The Weizmann Institute of Science is one of the world’s leading multidisciplinary research institutions. Hundreds of scientists, laboratory technicians and research students working on its lushly landscaped campus embark daily on fascinating journeys into the unknown, seeking to improve our understanding of nature and our place within it. 

Guiding these scientists is the spirit of inquiry so characteristic of the human race. It is this spirit that propelled humans upward along the evolutionary ladder, helping them reach their utmost heights.

It prompted humankind to pursue agriculture, learn to build lodgings, invent writing, harness electricity to power emerging technologies, observe distant galaxies, design drugs to combat various diseases, develop new materials and decipher the genetic code embedded in all the plants and animals on Earth.



The 5th Innovations in Theoretical Computer Science (ITCS) conference, sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT), will be held in Princeton, New Jersey, January 12-14, 2014 with a welcome reception on January 11.

ITCS (previously known as ICS) seeks to promote research that carries a strong conceptual message (e.g., introducing a new concept or model, opening a new line of inquiry within traditional or cross-interdisciplinary areas, or introducing new techniques or new applications of known techniques). ITCS welcomes all submissions, whether aligned with current theory of computation research directions or deviating from them.

ITCS 2014 is sponsored by SIGACT (ACM Special Interest Group on Algorithms and Computation Theory).



The Ninth Theory of Cryptography Conference was held in Taormina, Italy, sponsored by the International Association for Cryptologic Research (IACR). Papers presenting original research on foundational and theoretical aspects of cryptography are sought.

The Theory of Cryptography Conference deals with the paradigms, approaches, and techniques used to conceptualize natural cryptographic problems and provide algorithmic solutions to them. More specifically, the scope of the conference includes, but is not limited to the:
• Study of known paradigms, approaches, and techniques, directed towards their better understanding and utilization
• Discovery of new paradigms, approaches and techniques that overcome limitations of the existing ones
• Formulation and treatment of new cryptographic problems
• Study of notions of security and relations among them
• Modeling and analysis of cryptographic algorithms
• Study of the complexity assumptions used in cryptography


Editorial Activities

SIAM J. of Computing (editing a special issue on probabilistic checkable proofs).
JCSS (editing a special issue for FOCS94).
SIAM J. on Discrete Math (editor).