This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| IEEE Conference on Computational Complexity | |
|---|---|
| Name | IEEE Conference on Computational Complexity |
| Abbreviation | CCC |
| Discipline | Theoretical computer science |
| Publisher | IEEE |
| Established | 1986 |
| Frequency | annual |
IEEE Conference on Computational Complexity
The IEEE Conference on Computational Complexity is an annual academic meeting focusing on computational complexity theory, bringing together researchers from institutions such as Massachusetts Institute of Technology, Stanford University, University of California, Berkeley, and Princeton University. The conference features presentations that intersect work from laboratories like Microsoft Research and IBM Research, and collaborations with groups at Harvard University, University of Chicago, and Carnegie Mellon University. Attendees often include members from centers such as Institute for Advanced Study, Simons Institute for the Theory of Computing, and RIKEN, alongside representatives from funding agencies like the National Science Foundation and the European Research Council.
The conference traces its roots to meetings among researchers affiliated with Richard Karp's circle at University of California, Berkeley, connections to workshops held at DIMACS, and early programs involving faculty from Courant Institute of Mathematical Sciences and University of Toronto. Founding discussions included participants from Bell Labs, AT&T Labs, and the National Institute of Standards and Technology, with program committees that later incorporated scholars from Princeton University and Cornell University. Over time the event aligned with other forums such as FOCS, STOC, and ICALP, and some plenary sessions echoed themes introduced at the Karp Prize ceremonies hosted by the Association for Computing Machinery. Historical venues have included campuses associated with University of Illinois Urbana-Champaign, Columbia University, and University of Washington.
Sessions cover themes linked to results by researchers from Stephen Cook, Leonid Levin, Scott Aaronson, and László Lovász, examining problems like P versus NP problem, NP-completeness, and Probabilistically Checkable Proofs. Other topics reflect work from groups at Tel Aviv University, ETH Zurich, and École Polytechnique Fédérale de Lausanne on areas such as circuit complexity, communication complexity, and derandomization. Cross-cutting talks relate to developments from Google Research and Amazon Web Services collaborators on topics like approximation algorithms and interactive proofs, while specialized sessions highlight advances tied to contributions by Sanjeev Arora, Oded Goldreich, Mihalis Yannakakis, and Noam Nisan.
The program committee is typically staffed by researchers affiliated with University of California, San Diego, Yale University, University of Maryland, College Park, New York University, and Brown University. Sponsorship and logistical support often come from organizations such as IEEE Computer Society, ACM SIGACT, Simons Foundation, and corporate partners including Google, Intel, NVIDIA, and Facebook. Local hosts have included departments at University of British Columbia, University of Michigan, University of Pennsylvania, and University of Sydney, coordinating with societies like European Association for Theoretical Computer Science and research hubs such as Seoul National University.
The format commonly includes peer-reviewed technical papers, invited talks, poster sessions, and panel discussions with participants from University of Edinburgh, University of Oxford, University of Cambridge, Imperial College London, and Zhejiang University. Proceedings are published under IEEE auspices and indexed alongside publications from SIAM and Springer collections, mirroring archival standards used by venues like NeurIPS and ICALP. Workshops and tutorial days sometimes feature lecturers from California Institute of Technology, Duke University, Rutgers University, and University of California, Santa Barbara.
The conference has been a forum for results building on foundational work by Alan Turing, John von Neumann, Kurt Gödel, and modern theorists including Uriel Feige, Andrew Yao, Richard Lipton, and Michael Sipser. Highlights include structural complexity classifications, lower bound techniques influenced by research from Valiant-linked projects at Harvard, advances in proof complexity connected to Paul Beame, and randomness-extraction frameworks related to efforts at Tel Aviv University and Weizmann Institute of Science. Contributions have impacted adjacent arenas involving researchers from Los Alamos National Laboratory, Lawrence Berkeley National Laboratory, and Sandia National Laboratories.
The conference recognizes outstanding papers and lifetime contributions, echoing awards such as the A.M. Turing Award, ACM Prize in Computing, and Gödel Prize in spirit. Recipients have often been faculty from University of Texas at Austin, University of California, Los Angeles, Northwestern University, University of Wisconsin–Madison, and Peking University. Honorary lectures have been delivered by scholars affiliated with Columbia University, Johns Hopkins University, and University of Southern California.
Participants include graduate students, postdoctoral researchers, and faculty from institutions such as Brown University, University of Minnesota, Ohio State University, University of Pittsburgh, Indiana University Bloomington, University of North Carolina at Chapel Hill, Boston University, Dartmouth College, Vanderbilt University, University of Notre Dame, University of Florida, McGill University, University of Alberta, University of Waterloo, McMaster University, Queen's University, University of Tokyo, Kyoto University, Peking University, Tsinghua University, and Nanjing University. The community also engages with societies like Association for Computing Machinery, IEEE Computer Society, and research programs at ERCIM and INRIA.
The conference rotates annually among host institutions in regions including North America, Europe, and Asia, with prior editions held at locations such as Princeton University, Cornell University, Technische Universität München, Universität Wien, University of Tokyo, National University of Singapore, University of Melbourne, Trinity College Dublin, Tel Aviv University, University of Amsterdam, and Seoul National University. The typical cadence is yearly, coordinated to avoid conflicts with FOCS, STOC, and major workshops at Banff Centre for Arts and Creativity.
Category:Theoretical computer science conferences