Algorithms and Logic Group

Chengdu A&L Seminars

  1. Bingkai Lin: Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis
  2. 王艺源: 大规模离散优化问题求解算法
  3. Bainian Hao: Inefficiency of the Pure Nash Equilibria in Structured Congestion Games
  4. Yiding Feng: Beyond Regularity: Simple versus Optimal Mechanisms, Revisited
  5. Lev D. Beklemishev: Provability and computability
  6. Markus Lohrey: Selected topics in streaming algorithms
  7. Qi Shi: Responsibility and Norms in Multiagent Systems
  8. Weili (Lily) Wu: The Art of Big Data: Accomplishments and Research Needs
  9. Boting Yang: On the One-Visibility Cops and Robber Game
  10. Qingyun Chen: Survivable Network Design Revisited: Group-Connectivity