Future and Past Conferences

29th CCC* , June 11-13, 2014, Vancouver, British Columbia, Canada

PC Chair: Michael Saks
Local Chair: Valentine Kabanets

Call for Papers | Program | Local Arrangements

28th CCC* , June 5-7, 2013, Stanford, California, USA

PC Chair: Chris Umans
Local Chair: Luca Trevisan

Best Student Paper: On the Power of Non-Adaptive Learning Graphs by Aleksandrs Belovs and Ansis Rosmanis
Best Paper: The Correct Exponent for the Gotsman-Linial Conjecture by Daniel Kane
Best Paper: Approaching the Chasm at Depth Four by Ankit Gupta, Pritish Kamath, Neeraj Kayal, and Ramprasad Saptharishi

Collocation: STOC June 1-4

Call for Papers | Program | Local Arrangements | Proceedings: IEEExplore | Special Issue: CC 23(2)

27th CCC* , June 26-29, 2012, Porto, Portugal

PC Chair: Venkatesan Guruswami
Local Chair: Luis Antunes

Best Student Paper: Limitations of Lower-Bound Methods for the Wire Complexity of Boolean Operators by Andrew Drucker

Call for Papers | Program | Local Arrangements | Proceedings: CSDL/IEEExplore | Special Issue: CC 22(2)

26th CCC* , June 8-10, 2011, San Jose, California, USA

PC Chair: Omer Reingold
Part of FCRC

Best Student Paper: Improved Direct Product Theorems for Randomized Query Complexity by Andrew Drucker
Best Paper: Non-Uniform ACC Circuit Lower Bounds by Ryan Williams

Call for Papers | Program | Local Arrangements | Proceedings: CSDL/IEEExplore | Special Issue: CC 21(2)

25th CCC* , June 9-11, 2010, Cambridge, Massachusetts, USA

PC Chair: Dieter van Melkebeek
Local Chair: Salil Vadhan

Best Student Paper: The Gaussian surface area and noise sensitivity of degree-d polynomial threshold functions by Daniel Kane

Collocation: STOC June 5-8

Call for Papers | Program | Local Arrangements | Proceedings: CSDL/IEEExplore | Special Issue: CC 20(2)

24th CCC* , July 15-18, 2009, Paris, France

PC Chair: Johan Håstad
Local Chair: Sophie Laplante

Best Student Paper: Lipschitz Continuous Ordinary Differential Equations Are Polynomial-Space Complete by Akitoshi Kawamura
Best Paper: Poly-logarithmic Independence Fools AC^0 Circuits by Mark Braverman

Call for Papers | Program | Local Arrangements | Proceedings: CSDL/IEEExplore | Special Issue: CC 19(2)

23rd CCC* , June 23-26, 2008, College Park, Maryland, USA

PC Chair: Paul Beame
Local Chair: William Gasarch

Best Student Paper: Approximate Inclusion-Exclusion for Arbitrary Symmetric Functions by Alexander Sherstov
Best Paper: Lower Bounds and Separations for Constant Depth Multilinear Circuits by Ran Raz and Amir Yehudayoff
Best Paper: The Sum of d Small-Bias Generators Fools Polynomials of Degree d by Emanuele Viola

Call for Papers | Program | Local Arrangements | Proceedings: CSDL/IEEExplore | Special Issue: CC 18(2)

22nd CCC* , June 13-16, 2007, San Diego, California, USA

PC Chair: Peter Bro Miltersen
Part of FCRC

Best Student Paper: Halfspace Matrices by Alexander Sherstov
Best Student Paper: Time-Space Tradeoffs for Counting NP Solutions Modulu Integers by Ryan Williams
Best Paper: Unbalanced Expanders and Randomness Extractors from Parvaresh-Vardy Codes by Venkatesan Guruswami, Christopher Umans, and Salil Vadhan

Call for Papers | Program | Local Arrangements | Proceedings: CSDL/IEEExplore | Special Issue: CC 17(2)

21st CCC* , July 17-20, 2006, Prague, Czech Republic

PC Chair: Manindra Agrawal
Local Chair: Pavel Pudlák

Best Student Paper: Polynomial Identity Testing for Depth 3 Circuits by Neeraj Kayal and Nitin Saxena
Best Paper: Polynomial Identity Testing for Depth 3 Circuits by Neeraj Kayal and Nitin Saxena

Call for Papers | Program | Local Arrangements | Proceedings: CSDL/IEEExplore | Special Issue: CC 16(2)

20th CCC* , June 12-15, 2005, San Jose, California, USA

PC Chair: Luca Trevisan
Local Chair: D. Sivakumar and Ravi Kumar

Best Student Paper: Better Time-Space Lower Bounds for SAT and Related Problems by Ryan Williams
Best Paper: Pseudorandomness for Approximate Counting and Sampling by Ronen Shaltiel and Chris Umans

Call for Papers | Proceedings: CSDL/IEEExplore | Special Issue: CC 15(2 and 4)

19th CCC* , June 21-24, 2004, Amherst, Massachusetts, USA

PC Chair: Russell Impagliazzo
Local Chair: David Mix Barrington and Neil Immerman

Best Student Paper: Limitations of Quantum Advice and One-Way Communication by Scott Aaronson
Best Paper: Deterministic Polynomial Identity Testing in Non-commutative Models by Ran Raz and Amir Shpilka

Call for Papers | Program | Local Arrangements | Proceedings: CSDL/IEEExplore | Special Issue: CC 14(1, 2, and 3)

18th CCC* , July 7-10, 2003, Århus, Denmark

PC Chair: Harry Buhrman
Local Chair: Peter Bro Miltersen

Best Student Paper: Quantum Certificate Complexity by Scott Aaronson
Best Paper: Extremal Properties of Polynomial Threshold Functions by Ryan O'Donnell and Rocco Servedio

Kolmogorov Day (Sunday, July 6th, 2003)

Call for Papers | Program | Local Arrangements | Proceedings: CSDL/IEEExplore | Special Issue: JCSS 74(3)

17th CCC* , May 21-24, 2002, Montréal, Québec, Canada

PC Chair: Anne Condon
Local Chair: Pierre McKenzie

Best Student Paper: Hardness Amplification within NP by Ryan O'Donnell
Best Paper: Resolution Lower Bounds for Perfect Matching Principles by Ran Raz
Best Paper: Resolution Lower Bounds for the Weak Pigeon Hole Princple by Alexander Razborov

Collocation: STOC May 19-21

Call for Papers | Program | Local Arrangements | Proceedings: CSDL/IEEExplore | Special Issue: JCSS 69(1)

16th CCC* , June 18-21, 2001, Chicago, Illinois, USA

PC Chair: Madhu Sudan
Local Chair: John Rogers

Best Student Paper: A Linear Lower Bound on the Unbounded Error Probabilistic Communication Complexity by Juergen Forster
Best Paper: In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time by Russell Impagliazzo, Valentine Kabanets, and Avi Wigderson

Call for Papers | Program | Proceedings: CSDL/IEEExplore | Special Issue: JCSS 65(4)

15th CCC* , July 4-7, 2000, Florence, Italy

PC Chair: Pavel Pudlák
Local Chair: Pierluigi Crescenzi

Best Student Paper: Easiness Assumptions and Hardness Tests: Trading Time for Zero Error by Valentine Kabanets

Call for Papers | Program | Proceedings: CSDL/IEEExplore | Special Issue: JCSS 63(2)

14th CCC* , May 4-6, 1999, Atlanta, Georgia, USA

PC Chair: Lance Fortnow
Part of FCRC

Best Student Paper: Graph Ramsey Theory and the Polynomial Hierarchy by Marcus Schaefer

Call for Papers | Program | Proceedings: CSDL/IEEExplore | Special Issue: JCSS 62(2)

13th CCC* , June 15-18, 1998, Buffalo, New York, USA

PC Chair: Joan Feigenbaum
Local Chair: Ken Regan

Best Student Paper: Relationships Between Quantum and Classical Space-Bounded Complexity Classes by John Watrous

Call for Papers | Program | Local Arrangements | Proceedings: CSDL/IEEExplore | Special Issue: JCSS 59(2)

12th CCC* , June 24-27, 1997, Ulm, Germany

PC Chair: José Balcázar
Local Chair: Uwe Schöning and Jacobo Torán

Best Student Paper: LR(k) Testing is Average-Case Complete by Cristoph Karg

Call for Papers | Program | Proceedings: CSDL/IEEExplore | Special Issue: JCSS 60(2)

11th CCC* , May 24-27, 1996, Philadelphia, Pennsylvania, USA

PC Chair: Jin-Yi Cai
Part of FCRC

Best Student Paper: Reducing P to a Sparse Set Using a Constant Number of Queries Collapses P to L by Dieter van Melkebeek

Proceedings: CSDL/IEEExplore | Special Issue: JCSS 57(2)

* From 1996 till 2014 CCC stands for Annual IEEE Conference on Computational Complexity rather than Computational Complexity Conference.