Submission deadline: Sunday, August 7, 2011 at 23:59 EST.


ITCS (2012) News: In addition to the program, there are going to be a few novelties that we would like to point out to you.

  1. GRADUATING BITS In one session of the conference, students graduating this academic year (as well as researchers completing their postdoc this academic year) will be given few minutes to present themselves and their work. The presentations will be grouped by University, in alphabetic order. We hope this will give all of us an opportunity to have a synopsis of the great work being done by the "graduating" members of our community. In order to speak in this special session, please send an email by DECEMBER 15. Registration fees will not be required for participating at Graduating Bits 2012. If you/your students are graduating this year, or you plan to hire this year, we are encourage to attend ITCS 2012!

  2. COMMUNITY BUILDING To strengthen our (legendary!) friendship and collaboration, we will treat you to a PLAY BACK show: an improvisational theater where OUR actors will bring to life YOUR stories.

  3. CHAIR RANTS In addition to the chair of each session introducing the speakers and coauthors of the session (who will then introduce themselves and their coauthors), our chairs will provide us with their insights on the papers in their sessions.

The 3rd Innovations in Theoretical Computer Science (ITCS) conference, sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT), will be held in Cambridge, Massachusetts, January 8-10, 2012 with a welcome reception on January 7.

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 2012 is sponsored by SIGACT (ACM Special Interest Group on Algorithms and Computation Theory).

Steering Committee:

Sanjeev Arora, Manuel Blum, Bernard Chazelle, Oded Goldreich, Shafi Goldwasser, Richard Karp, Ueli Maurer, Silvio Micali, Peter Bro Miltersen, Christos Papadimitriou, Michael Rabin, Madhu Sudan, Leslie Valiant, Umesh Vazirani, Avi Wigderson, and Andy Yao.

Program Committee:

Bonnie Berger (CSAIL, MIT)
Jeff Erickson (U. Ilinois Urbana-Champaign)
Shafi Goldwasser (Chair, CSAIL MIT, and Weizmann)
Johan Hastad (KTH, Sweden)
Yael Tauman Kalai (Microsoft Research New England)
Richard Karp (U. C. Berkeley)
Robert Kleinberg (Cornell)
Adam Klivans (University of Texas Austin)
Robert Krauthgamer (Weizmann)
Yoram Moses (Technion)
Rafail Ostrovsky (U. C. Los Angeles)
Madhu Sudan (Microsoft Research New England)
Umesh Vazirani (U. C. Berkeley)

Organizing Committee:

Silvio Micali (CSAIL, MIT)
Yael Tauman Kalai (Microsoft Research New England)