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

SEMINARS [ Subscribe ]

2025-12-25: Stable Open Addressing and the Curse of Reappearance Dependencies

2025-12-24: Why "1 + 1 < 2" for Space-Efficient Data Structures

2025-12-17: Online Non-Clairvoyant Polytope Scheduling to Minimize -Norms of Flow Time

2025-12-11: Joint Design of Mechanisms and Information: Applications to Screening and Contracts

2025-11-26: d-Galvin Families

2025-11-20: Paths and Intersections: Exact Emulators for Planar Graphs

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

Pay to (Not) Play: Monetizing Impatience in Mobile Games

(AAAI 2024)Taylor Lundy, Narun Raman, Hu Fu, Kevin Leyton-Brown

Max-min greedy matching problem: Hardness for the adversary and fractional variant

(Theoretical Computer Science 2024)T.-H. Hubert Chan, Zhihao Gavin Tang, Quan Xue

Two-State Spin Systems with Negative Interactions

(Innovations in Theoretical Computer Science Conference, ITCS 2024)Yumou Fei, Leslie Ann Goldberg, Pinyan Lu

Toward a Better Understanding of Randomized Greedy Matching

(Journal of the ACM 2023)Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang

ITCS · 新进教师 | 贺烈博士

ITCS · 新进教师 | 韩恺博士

CONFERENCES & WORKSHOPS

2025/08/01 ~ 2025/08/02: HCP2025

2025/06/14 ~ 2025/06/15: ITCS Workshop 2025

2025/03/20: Shanghai Theory Day 2025

VISITORS