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

SEMINARS [ Subscribe ]

2022-07-26: Ordinal Approximation Algorithms for MMS Allocation of Chores (Xiaowei Wu)

2022-07-19: Combining Length and Capacity: An Approximation Algorithm for the weighted Label s-t Cut Problem (Peng Zhang)

2022-07-05: Survivable Network Design: Group Connectivity (Yuhao Zhang)

2022-06-28: Efficient Submodular Optimization under Noise: Local Search is Robust (Lingxiao Huang)

2022-06-21: Cheeger inequalities for vertex expansion and reweighted eigenvalues (Tsz Chiu Kwok)

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

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

Mechanism Design with Predictions

(IJCAI 2022)Chenyang Xu, Pinyan Lu

General Graphs are Easier than Bipartite Graphs: Tight Bounds for Secretary Matching

(EC 2022)Tomer Ezra, Michal Feldman, Nick Gravin, Zhihao Gavin Tang

Bayesian and Randomized Clock Auctions

(EC 2022)Michal Feldman, Vasilis Gkatzelis, Nick Gravin, Daniel Schoepflin

(Fractional) online stochastic matching via fine-grained offline statistics

(STOC 2022)Zhihao Gavin Tang, Jinzhao Wu, Hongxun Wu

上财ITCS四篇论文被FOCS 2022接收

长期悬而未决的第一价格拍卖效率问题被彻底解决

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