English
主页
中心概况
中心介绍
联系我们
人员队伍
全职教师
讲席教授
博士后
学生
行政人员
讲座
学术活动
学术会议
暑期课程
论文发表
访问学者
招生/招聘
Efficient Approximations for the Online Dispersion Problem (Jing Chen)
Cake cutting: networked fairness, envy and truth (Xiaohui Bei)
A Network Game of Dynamic Traffic (Changjun Wang)
Edit Distance: Sketching, Streaming and Document Exchange (Qin Zhang)
High Performance Linear System Solvers with Focus on Graph Laplacians (Richard Peng)
The Query Complexity of Bayesian Auctions (Jing Chen)
Determinant-Preserving Sparsification of SDDM Matrices with Applications to Counting and Sampling Spanning Tre...
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)
每页
14
记录
总共
240
记录
第一页
<<上一页
下一页>>
尾页
页码
15
/
18
跳转到
