CCC 2016 Satellite Kyoto Workshop

June 2-3, 2016

Clock Tower Centennial Hall, Kyoto University, Kyoto, Japan


Access

The conference will be held at Clock Tower Centennial Hall in Yoshida campus (the main campus) of Kyoto University.

Access information is available in  the Venues and Transportation pages.

Quick links:


Schedule

June 2

10:00 – 10:50 Session 1

10:00 – 10:25 Talk 1
Speaker: Rüdiger Reischuk
Title: The Complexity of Universal Stegosystems and Channels Based on Pattern Languages

10:25 – 10:50 Talk 2
Speaker: David J. Rosenbaum
Title: On the Group and Color Isomorphism Problems

10:50 – 11:10 Break

11:10 – 12:00 Session 2

11:10 – 11:35 Talk 3
Speaker: Jakob Nordstrom
Title: How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity)

11:35 – 12:00 Talk 4
Speaker: Brendan Juba
Title: AC0(MOD2) Lower Bounds for the Boolean Inner Product

12:00 – 13:40 Lunch Break

13:40 – 14:55 Session 3

13:40 – 14:05 Talk 5
Speaker: Shiteng Chen
Title: Depth reduction with composite moduli

14:05 – 14:30 Talk 6
Speaker: Rahul Santhanam
Title: Stronger Connections between Learning and Lower Bounds

14:30 – 14:55 Talk 7
Speaker: Shinichi Matsubara
Title: On parsimonious reductions from the accepting path counting problem for $\Sigma_2$-machines to the counting problems for $\Sigma_2$SAT

14:55 – 15:15 Break

15:15 – 16:30 Session 4

15:15 – 15:40 Talk 8
Speaker: Amir Shpilka
Title: Reed-Muller Codes for Random Erasures and Errors

15:40 – 16:05 Talk 9
Speaker: Sivakanth Gopi
Title: 2-Server PIR with sub-polynomial communication

16:05 – 16:30 Talk 10
Speaker: Anand Natarajan
Title: Interactive Proofs for the Local Hamiltonian Problem with Constant Completeness-Soundness Gap

17:30 – 19:30 Reception

June 3

10:00 – 12:00 Free discussion


Contributed talks

We invite the participants to give a contributed talk in the workshop. Talk proposals can be made at the OnLine Registration page. Talk proposals are handled on a first-come and first-served basis, if the number of proposals exceeds the limit.

(Added on April 22:) We have closed talk proposals.