ITCS Workshop

Brief Introduction

This year is the fifth anniversary of the Institute for Theoretical Computer Science (ITCS). ITCS is an academic unit at Shanghai University of Finance and Economics (SUFE) established to create a world-class environment for research in broad areas of theoretical computer science. To celebrate the anniversary, ITCS will hold a two-day workshop starting on June 18, 2021. The workshop will bring most of the people working in theoretical computer science in China and will feature more than 10 lectures by leading researchers in their respective areas. The workshop will give ample opportunities for research discussions and hopefully will stimulate collaboration between many ITCS visitors, researchers and students from other universities in big Shanghai area. Please come and enjoy it.

Time

2021-06-18   09:30 ~ 18:00   

2021-06-19   09:00 ~ 12:00   

Lecturers

• John Hopcroft, Cornell University

• Wei Chen, Microsoft Research Asia 

• Ding Hu,  University of Science and Technology of China
  
• Hu Fu, ITCS, Shanghai University of Finance and Economics 
  
• Siyao Guo, NYU Shanghai 
  
• Lingxiao Huang, Huawei TCS Lab 
  
• Shaofeng Jiang, Peking University 
  
• Bingkai Lin, Nanjing University 
  
• Xiaoming Sun, The Institute of Computing Technology of the Chinese Academy of Sciences
  
• Biaoshuai Tao, Shanghai Jiao Tong University
  
• Xiao Wang, ITCS, Shanghai University of Finance and Economics 
  
• Kewen Wu, University of California at Berkeley 
  
• Yuan Zhou, University of Illinois at Urbana-Champaign 
  

Venue

Guangdong Hotel Shanghai

Application and Registration

It is free and open to everyone; in particular, students are encouraged to attend.

Program

June 18

09:30~10:00 Openning Ceremony

10:00~10:30 Tea Break & Group Photo

10:30~11:00 Space-Depth Trade-Off of CNOT Circuits (Xiaoming Sun)

11:00~11:30 Coresets for learning tasks with time series data (Lingxiao Huang)

11:30~12:00 Data-dependent Coreset for Large-scale, Robust, and Dynamic Machine Learning (Hu Ding)

12:00~14:00 Lunch

14:00~14:30 Optimization from Structured Samples —— An Effective Approach for Data-driven Optimization (Wei Chen)

14:30~15:00 Streaming Algorithms for Geometric Steiner Forest (Shaofeng Jiang)

15:00~15:30 Constant Approximating k-Clique is W[1]-hard (Bingkai Lin)

15:30~16:30 Tea Break

16:30~17:00 Linear Bandits with Limited Adaptivity and Learning Distributional Optimal Design (Yuan Zhou)

17:00~17:30 Time-Space Tradeoffs for Function Inversion (Siyao Guo)

17:30~18:00 Multiplicative Weights Update: Aspects of Optimism, Chaos and Acceleration (Xiao Wang)

18:00~20:00 Dinner

June 19

09:00~09:30 Learning Utilities and Equilibria in Non-Truthful Auctions (Hu Fu)

09:30~10:00 The importance of Computer Science and AI to the future (John Hopcroft)

10:00~11:00 Tea Break

11:00~11:30 On Existence of Truthful Fair Cake Cutting Mechanisms (Biaoshuai Tao)

11:30~12:00 Perfect Sampling for (Atomic) Lovász Local Lemma (kewen Wu)

12:00~14:00 Lunch 

Contact Us

Huili Liang