理论计算机科学研究中心

2026-05-13 Range Avoidance and Arthur-Merlin (Zeyong Li)
2026-04-16 On Cheeger-Type Inequalities and Higher-Order Cheeger-Type Inequalities (Jiyu Zhang)
2026-04-13 Mathematics in the Age of AI: From Proving to Verifying (Xiaohui Bei)
2026-03-06 A Faster Directed Single-Source Shortest Path Algorithm (Longhui Yin)
2026-03-05 Strategically Robust No-Regret Learning: Characterization and Bidding Algorithms (Junyao Zhao)
2026-01-12 Optimal Stopping with a Predicted Prior (Zhiyi Huang)
2026-01-04 Non-Bayesian Information Design: Learning and LLM-Based Approaches (Tao Lin)
2025-12-31 Pseudodeterministic Communication Complexity (Weiqiang Yuan)
2025-12-25 Stable Open Addressing and the Curse of Reappearance Dependencies (Jingxun Liang)
2025-12-24 Why "1 + 1 < 2" for Space-Efficient Data Structures (Renfei Zhou)
2025-12-17 Online Non-Clairvoyant Polytope Scheduling to Minimize -Norms of Flow Time (Qingyun Chen)
2025-12-11 Joint Design of Mechanisms and Information: Applications to Screening and Contracts (Jinzhao Wu)
2025-11-26 d-Galvin Families (Joseph Swernofsky)
2025-11-20 Paths and Intersections: Exact Emulators for Planar Graphs (Zihan Tan)

每页 14 记录总共 240 记录
第一页 <<上一页下一页>> 尾页
页码 1/18 跳转到