English
主页
中心概况
中心介绍
联系我们
人员队伍
全职教师
讲席教授
博士后
学生
行政人员
讲座
学术活动
学术会议
暑期课程
论文发表
访问学者
2025
招生/招聘
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)
Uniform Sampling through the Lovász Local Lemma (Heng Guo)
On the Complexity of Coalitional Stability in Two-Sided Markets with Budget Constraints (Anisse Ismaili)
Uniform Sampling through the Lovász Local Lemma (Heng Guo)
Balancing Efficiency and Fairness in Resource Allocation (Xiaohui Bei)
General Randomness Amplification with Non-signaling Security (Kai-Min Chung)
Applied mechanism design (Pingzhong Tang)
每页
14
记录
总共
232
记录
第一页
<<上一页
下一页>>
尾页
页码
15
/
17
跳转到
