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

2021/12/15 Hardness vs Randomness, Revised: Uniform, Non-Black-Box, and Instance-Wise
2021/06/19 Time-Space Tradeoffs for Function Inversion (Siyao Guo)
2021/06/19 On Existence of Truthful Fair Cake Cutting Mechanisms (Biaoshuai Tao)
2021/06/19 The importance of Computer Science and AI to the future (John Hopcroft)
2021/06/19 Perfect Sampling for (Atomic) Lovász Local Lemma (Kewen Wu)
2021/06/19 Learning Utilities and Equilibria in Non-Truthful Auctions (Hu Fu)
2021/06/18 Optimization from Structured Samples —— An Effective Approach for Data-driven Optimization (Wei Chen)
2021/06/18 Data-dependent Coreset for Large-scale, Robust, and Dynamic Machine Learning (Hu Ding)
2021/06/18 Multiplicative Weights Update: Aspects of Optimism, Chaos and Acceleration (Xiao Wang)
2021/06/18 Constant Approximating k-Clique is W[1]-hard (Bingkai Lin)

per page 10 records total 147 records
firstpage <<previouspage nextpage>> endpage
PageNumber 1/15 jumpto