1 / 4

Submissions Stats

Submissions Stats. 119 submissions Paris ‘09: 113 (deadline after STOC) Prague '06: 87 Aarhus '03: 65 Florence '00: 63 18 junk submissions 34 papers accepted Second highest ever? Paris ’09 had 37 papers The 3 ½ day format offers some flexibility

karis
Télécharger la présentation

Submissions Stats

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Submissions Stats • 119submissions • Paris ‘09: 113 (deadline after STOC) Prague '06: 87 Aarhus '03: 65 Florence '00: 63 • 18 junk submissions • 34 papers accepted • Second highest ever? Paris ’09 had 37 papers • The 3 ½ day format offers some flexibility • Two invited talks: • Peter Bürgisser & ToniannPitassi

  2. Papers by areas (approximate)

  3. Conference on Computational Complexity The Ronald V. Book Prize for Best Student Paper of the 27th Conference on Computational Complexity, CCC’12 Is Awarded To Andrew Drucker For the Paper Limitations of Lower-Bound Methods for the Wire Complexity of Boolean Operators

  4. CCC’12 special issue of Computational Complexity journal Amplifying Circuit Lower Bounds Against Polynomial Time With applications Is the Valiant-Vazirani Isolation Lemma Improvable? Parallel approximation of min-max problems with applications to classical and quantum zero-sum games A Satisfiability Algorithm and Average-Case Hardness for Formulas over Full bInary basis DNF Sparsification and Faster Deterministic Counting A strong direct product theorem for quantum query complexity On sunflowers and matrix multiplication

More Related