Logo
  • English
  • 主页
  • 中心概况
    • 中心介绍
    • 联系我们
  • 人员队伍
    • 全职教师
    • 讲席教授
    • 博士后
    • 学生
    • 行政人员
  • 讲座
  • 学术活动
    • 学术会议
    • 暑期课程
  • 论文发表
  • 访问学者
    • 2025
  • 招生/招聘
  • A proof of the Sensitivity Conjecture (Hao Huang)
  • Fair Division of Indivisible Goods (Rohit Vaish)
  • O(log2 k/loglogk)-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm (...
  • Near Minimax-Optimal Regret for Linearly Parameterized Bandits (Yuan Zhou)
  • Modified log-Sobolev inequalities for strongly log-concave distributions (Heng Guo)
  • Classification Program for Counting Problems (Jin-Yi Cai)
  • Fair Division in a Connected World (Xiaohui Bei)
  • Inapproximability of Clustering in L_p metrics (Karthik C. S)
  • Matrix-related Problems In Data Streams (Yi Li)
  • On Building Generalizable Learning Agents (Yi Wu)
  • Fairness in Automated Decision-Making Tasks (Lingxiao Huang)
  • Collaborative Learning with Limited Interaction: Tight Bounds for Distributed Exploration in Multi-Armed Bandi...
  • Improved Metric Distortion for Deterministic Social Choice Rules (Kangning Wang)
  • Interactive information complexity and its applications (Yaqiao Li)
  • 每页 14 记录  总共 232 记录 
  • 第一页 <<上一页 下一页>> 尾页
  • 页码 10/17 跳转到 
上海市杨浦区武东路100号
财经大学信息管理与工程学院6楼
版权所有ITCS@SUFE