理论计算机科学研究中心英文网

SEMINARS [ Subscribe ]

2022-06-14: Finding All-Pair Correlation (Bundit Laekhanukit)

2022-06-07: A simplified proof of the k^{o(1)}-lower bound for approximating the parameterized clique problem (Yijia Chen)

2022-05-31: Stability of Decentralized Queueing Network ——Beyond Bipartite Cases (Qun Hu)

2022-05-24: The Cardinal Complexity of Comparison-based Online Algorithms (Nick Gravin)

2022-05-17: Non-convergence to undesirable critical points by adaptive gradient methods (Xiao Wang)

2022-05-10: Order Selection Prophet Inequality: From Threshold Optimization to Arrival Time Design (Zhihao Tang)

SUMMER & WINTER SCHOOLS

2021/02/25~2021/06/24: Introduction to Theoretical Computer Science 2021 @SJTU

2018/07/24 ~ 2018/08/02: Mathematical Tools and Efficient Algorithms (Richard Peng)

2018/07/11 ~ 2018/08/05: Mathematical Tools and Efficient Algorithms (Richard Peng)

NEW RESEARCH RESULTS

Online Stochastic Matching with Edge Arrivals

(ICALP 2021)Nick Gravin, Zhihao Gavin Tang, Kangning Wang

Random Order Vertex Arrival Contention Resolution Schemes for Matching, with Applications

(ICALP 2021)Hu Fu, Zhihao Gavin Tang, Hongxun Wu, Jinzhao Wu, Qianfan Zhang

Generalizing Complex Hypotheses on Product Distributions: Auctions, Prophet Inequalities, and Pandora's Problem

(COLT 2021)Chenghao Guo, Zhiyi Huang, Zhihao Gavin Tang, Xinzhi Zhang

Tight Revenue Gaps among Multi-Unit Mechanisms

(EC 2021)Yaonan Jin, Shunhua Jiang, Pinyan Lu, Hengjie Zhang

ITCS · 新进教师| 王晓博士

ITCS · 新进教师| 伏虎博士

CONFERENCES & WORKSHOPS

2021/06/18 ~ 2021/06/19: ITCS Workshop

2019/12/08 ~ 2019/12/11: ISAAC 2019: The 30th International Symposium on Algorithms and Computation

2019/06/18: Shanghai Theory Day 2019

VISITORS