CONFERENCES & WORKSHOPS
SUMMER & WINTER SCHOOLS
On optimal sampling complexity for combinatorial multi-armed bandits (Jian Li)
On the Optimality of Tape Merge (Xiaoming Sun)
Local max-cut in smoothed polynomial time (Fan Wei）
Approximating Survivable Network Design via Rounding-by-Tree-Embedding (Bundit Laekhanukit)
Constrained Counting and Sampling: Bridging the Gap between Theory and Practice (Kuldeep Meel)
How to find relations between two networks? (Yangjing Long)
Computing minimum cuts in hypergraphs (Chao Xu)
Distributed matrix sketching (Zengfeng Huang)
Some Recent Progress on Quantum Information Complexity (Penghui Yao)
Pareto Stable Matching Mechanisms with Application to Course Allocation (Mengling Li)
6F, School of Information Management and Engineering, Shanghai University of Finance and Economics.
No. 100, Wudong Road, Yangpu District, Shanghai, 200433, PRC.
Copyright: ITCS, SHUFE. All Rights Reserved.