invited speakers

Jeong Han Kim (NIMS, Korea) - "Optimal Query Complexity Bounds for Finding Graphs" abstracts
Jin-Yi Cai (Wisconsin, USA) - "Progress on the Complexity of Counting Problems" abstracts

preliminary program

Note that on April 16 (Fri) dinner starts at 18:30 at Posco IC(5th floor, Chinese), followed by a reception starting at 20:00 at Loghouse.

instructions for speakers

Presentation format
Each (normal) talk lasts for 20 min. including questions/answers. Try to prepare your talk such that it you still have a few minutes to answer questions after your talk. If you give a long talk, you're allowed to use up to 30 min.

Slide files
There will be a computer available in each session hall. We strongly encourage you to use the provided computers and to upload your files before your session. If you want to upload the file in advance, send it to us by April 15: