-
12-10
2025
可计算性、结构与逻辑：Bakh Khoussainov教授特邀学术讲座
2025年12月9日，欧洲科学院院士、新西兰皇家学会会士、中国电子科技大学算法与逻辑实验室主任Bakh Khoussainov教授做客清华大学交叉信息院，带来题为“可计算性、结构与逻辑（Computability, structures, and logic）”特邀报告。交叉信息院院长姚期智教授主持讲座。师生齐聚FIT楼多功能厅，聆听讲座。精彩讲座姚先生首先介绍Bakh Khoussainov教授在数理逻辑与理论计算机科学领域的核心贡献。Khoussainov教授曾荣获欧洲理论计算...
-
12-16
2025
Digital Protection in the Era of Generative Models
演讲人：贺笛 [北京大学] 时间：12:00-13:00, Dec 16, 2025 (Tue)地点：FIT 1-312内容：随着大规模视觉生成模型的迅速扩展，内容来源可追溯性与模型滥用检测成为影响生成式 AI 健康发展的关键问题。模型级水印通过在生成过程中内嵌可识别信号，为判断图像是否由特定模型生成提供了必要的技术基础。然而，传统学习式水印依赖黑箱神经网络，其检测结果缺乏严格的可靠性保证，难以量化错误率。相比之下，具备统计可证性的水印方法...
-
12-11
2025
量子算法：量子世界的计算之法
演讲人：李绿周 [中山大学]时间：11:00-12:00, Dec 11, 2025 (Thu)地点：MMW S727内容：量子计算的有用性有赖于量子算法。量子算法的设计具有挑战性，需要在量子视角下找到有利于量子特性发挥作用的结构信息，从而到达返璞归真，大道至简的效果。基于量子计算领域现状，除了要在量子计算硬件方面做出长足努力，也需要进一步发展量子算法基础理论，拓展量子计算能力边界。本报告以量子算法为核心，汇报团队近年来在量子算法设计...
-
12-11
2025
Deciding regular games: a playground for exponential time algorithms
演讲人：Bakh Khoussainov [电子科技大学] 时间：10:00-11:00, Dec 11, 2025 (Thu)地点：RM 1-222, FIT Building内容：Regular games form a well-established class of games for analysis and synthesis of reactive systems. They include coloured Muller, McNaughton, Muller, Rabin, and Streett games. These games are played on directed graphs G where Player 0 and Player 1 play by generating an infinite path ...
-
12-09
2025
Computability, structures, and logic
演讲人：Bakh Khoussainov（University of Electronic Science and Technology of China）时间：14:00-15:00, Dec 9, 2025 (Tue)地点：Lecture Hall, FIT Building内容：In this presentation, we explore the relationships among several fundamental concepts in mathematics and computer science: computability, structures, and logic. Our focus will be on the foundational ideas that underpin these concepts and h...
-
11-28
2025
Local Computation of PageRank: Simple and Optimal
演讲人：Hanzhi Wang [University of Melbourne]时间：14:00-15:00, Nov 28, 2025 (Fri)地点： RM 1-222, FIT Building内容：PageRank is a classic node centrality measure in graphs, originally proposed by the co-founders of Google to rank web pages in their search engine. With the expansion of the web and modern networks, an important problem is the design of local algorithms that estimate a node’s Pa...