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

2017-05-11 On optimal sampling complexity for combinatorial multi-armed bandits (Jian Li)
2017-04-13 On the Optimality of Tape Merge (Xiaoming Sun)
2017-03-28 Local max-cut in smoothed polynomial time (Fan Wei）
2017-02-22 Approximating Survivable Network Design via Rounding-by-Tree-Embedding (Bundit Laekhanukit)
2017-02-20 Constrained Counting and Sampling: Bridging the Gap between Theory and Practice (Kuldeep Meel)
2017-01-12 How to find relations between two networks? (Yangjing Long)
2017-01-10 Computing minimum cuts in hypergraphs (Chao Xu)
2017-01-05 Distributed matrix sketching (Zengfeng Huang)
2016-12-21 Balancing Efficiency and Fairness in Resource Allocation (Xiaohui Bei)
2016-12-21 On the Complexity of Coalitional Stability in Two-Sided Markets with Budget Constraints (Anisse Ismaili)
2016-12-21 Uniform Sampling through the Lovász Local Lemma (Heng Guo)
2016-12-21 Some Recent Progress on Quantum Information Complexity (Penghui Yao)
2016-12-01 General Randomness Amplification with Non-signaling Security (Kai-Min Chung)
2016-11-30 Applied mechanism design (Pingzhong Tang)

每页 14 记录总共 232 记录
第一页 <<上一页下一页>> 尾页
页码 15/17 跳转到