-
蔡少伟: SAT与EDA形式化验证
Speaker: () Time: 10:30-11:30 Beijing Time December 19, 2025 (Friday) Venue: B1-501, Main Building Abstract: Speaker Bio: 蔡少伟，中国科学院软件研究所研究员，中国科学院优秀导师，CCF杰出会员/学术工委执行委员，研究约束求解和形式化验证，主持自然基金委青年B项目和重点项目，获得领域顶级会议CAV、CP、SAT等会议的最佳/杰出论文奖，多次获得SAT比赛、SMT比赛和MaxSAT比赛冠军，以及鸿蒙创新大赛冠军等，担任SAT 会议程序委员会主席，受邀到SAT，CP，FMCAD等领域顶级会议做特邀报告。其求解器应用于包括华为、华大九天、中国航空集团、国家电网、阿里巴巴、微软等多家企业/机构在内的多个实际场景，包括集成电路验证、操作系统验证、云计算调度和航空制造调度等。
-
Tian Bai: A Quadratic Vertex Kernel and a Subexponential Algorithm for Subset Feedback Arc Set in Tournaments
Speaker: () Time: 20:00-21:00 Beijing Time December 12, 2025 (Friday) Venue: 518, Research Building 4 Abstract: Speaker Bio: Tian Bai is currently a postdoctoral researcher at the University of Bergen (UiB). Previously, he worked as a postdoctoral researcher at the University of Hong Kong (HKU) in the ALGO Lab. He received his Ph.D. from the […]
-
Sk Samim Islam: Multipacking in Graphs: Hardness Results and Approximation Algorithms on Graph Subclasses
Speaker: () Time: 16:30-17:20 Beijing Time December 12, 2025 (Friday) Venue: Join Zoom Meetinghttps://us06web.zoom.us/j/87293332992?pwd=RwexmgEeYOaHpBaprbdO4P7FKC7KRV.1 Meeting ID: 872 9333 2992Passcode: 009710 Abstract: Speaker Bio: Sk Samim Islam, Ph.D. scholar at the Indian Statistical Institute, Kolkata, India.
-
Yiding Feng: Calibration and Decision Making:An Information Design Perspective
Speaker: () Time: 20:00-21:00 Beijing Time December 03, 2025 (Wednesday) Venue: 四号科研楼A区-518 Abstract: Speaker Bio: Yiding Feng is an assistant professor at HKUST IEDA. Previously, he worked as a principal researcher atthe University of Chicago Booth School of Business, and postdoctoral researcher at Microsoft Research New England. He received his Ph.D. from the Department of […]
-
Yibin Zhao: Closing the Gap Between Undirected and Eulerian Spectral Sparsification
Speaker: Yibin Zhao (The University of Toronto) Time: 16:20-17:20 Beijing Time October 31, 2025 (Friday) Venue: 518, Research Building 4 Abstract: Although spectral sparsification is well understood for undirected graphs, developing efficient algorithms for Eulerian directed graphs — a key step towards efficient directed Laplacian solvers — has long been challenging. Eulerian sparsification requires preserving degree […]
-
Angsheng Li: 谋算智能：模型、原理与方法
Speaker: () Time: 10:20-11:20 Beijing Time June 29, 2025 (Sunday) Venue: 主楼B1-501 Abstract: Speaker Bio: 北京航空航天大学教授。2003年国家杰出青年基金获得者，2008年中国科学院百人计划入选者。现任中国人工智能学会人工智能基础专业委员会主任。 1993年中国科学院软件研究所研究生毕业，获博士学位。1993年7月-2018年7月在中国科学院软件研究所工作，分别于1995，1999年被聘为副研究员、研究员。分别于1998年1月-1999年1月，2000年2月-2002年2月在英国Leeds大学做访问学者、研究员。2008年9月-2009年3月在美国Cornell大学做访问科学家。2012年1月-2012年3月，英国剑桥大学牛顿数学研究所做访问学者。2018年7月-今，入职北京航空航天大学计算机学院。 研究计算、信息与智能的数学原理。2008 – 2016年，提出编码树的概念、结构熵的度量，创立了《结构信息论》。2016 – 2024，提出信息世界的层谱抽象科学范式，建立了包括信息演算理论、信息生成原理和信息解码原理为三大支柱的信息的数学原理；建立了包括（观察）学习的信息理论、自我意识的信息理论和博弈/谋算理论为三大支柱的人工智能信息科学原理。2024年在科学出版社出版《人工智能科学 — 智能的数学原理》和《人工智能原理 — 从计算到谋算的模型、原理与方法》专著。 目前主要研究“谋算智能机器原理”和“《孙子兵法》的人工智能原理”。
-
Zhiyi Huang: Optimal 4-Approximation for the Correlated Pandora’s Problem
Speaker: () Time: 09:30-10:30 Beijing Time June 13, 2025 (Friday) Venue: 518, Research Building 4 Abstract: Speaker Bio: Zhiyi Huang is an Associate Professor of Computer Science at the University of Hong Kong. Before joining HKU, he was a postdoc at Stanford University from 2013 to 2014, working with Tim Roughgarden. He earned his Ph.D. […]
-
Yiding Feng: On the Efficiency of Fair and Truthful Trade Mechanisms
Speaker: () Time: 16:20-17:20 Beijing Time May 23, 2025 (Friday) Venue: 518, Research Building 4 Abstract: Speaker Bio: Yiding Feng is an assistant professor at HKUST IEDA. Previously, he worked as a principal researcher at the University of Chicago Booth School of Business, and postdoctoral researcher at Microsoft Research New England. He received his Ph.D. […]
-
Andrei Bulatov: Counting Problems, Partition Functions, Statistical Physics, and Computational Complexity
Speaker: () Time: 16:20-17:20 Beijing Time April 25, 2025 (Friday) Venue: 518, Research Building 4 Abstract: Speaker Bio: Dr Bulatov received his PhD in 1995 from the Ural State University in Ekaterinburg, Russia. His early research area was universal algebra and clone theory. When connections between universal algebra and computer science had been discovered, he […]
-
Ziyang Men: Parallel kd-tree with Batch Updates
Speaker: () Time: 16:20-17:20 Beijing Time April 22, 2025 (Tuesday) Venue: 518, Research Building 4 Abstract: Speaker Bio: Ziyang Men is a 3rd-year Ph.D. student at University of California, Riverside, where he is fortune to be supervised by Yihan Sun and Yan Gu. Prior to that, Ziyang received the M.Sc. from University of Copenhagen, and […]