CONFERENCES & WORKSHOPS
SUMMER & WINTER SCHOOLS
Zero-Visibility Cops-and-Robber Problems on Graphs (Boting Yang)
Edit Distance: Sketching, Streaming and Document Exchange (Qin Zhang)
The Query Complexity of Bayesian Auctions (Jing Chen)
Determinant-Preserving Sparsification of SDDM Matrices with Applications to Counting and Sampling Spanning Trees (Richard Peng)
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)
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.