-
Andre Nies: Prime numbers, factorisation, and algorithms
Speaker: Andre Nies (The University of Auckland) Time: 16:20-17:20 (Time in Beijing) April 19, 2024 (Friday) Venue: 518, Research Building 4 Abstract: Euclid in around 300 BC proved that the sequence of prime numbers is infinite. This sequence starts 2,3,5,7,11, 13, …; the largest currently known prime number is obtained by raising 2 to the […]
-
Alexander Zapryagaev: Presburger arithmetic and related theories
Speaker: Alexander Zapryagaev (University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) April 12, 2024 (Friday) Venue: 518, Research Building 4 Abstract: The talk introduces Presburger arithmetic PrA, the theory of natural numbers with addition, and Büchi arithmetics BA_n, a series of algorithmically decidable extensions of PrA. The main logical and […]
-
Junqiang Peng: A Fast Algorithm for MaxSAT Above Half Number of Clauses
Speaker: Junqiang Peng (University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) March 29, 2024 (Friday) Venue: 518, Research Building 4 Abstract: In the MaxSAT problem, given a CNF formula with clauses and an integer , we are asked whether there is a truth assignment that satisfies at least clauses of […]
-
Yinyu Ye: Online Market Design: Dynamic Equilibrium Pricing
() Time: 11:00-12:00 (Time in Beijing) March 25, 2023 (Monday) Venue: 518, Research Building 4 Abstract: Speaker Bio: Yinyu Ye is currently the K.T. Li Professor of Engineering at Department of Management Science and Engineering and Institute of Computational and Mathematical Engineering, Stanford University. His current research topics include Continuous and Discrete Optimization, Data Science […]
-
Zihui Liang: Two new algorithms for solving Muller games and their applications
Speaker: Zihui Liang (University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) March 22, 2024 (Friday) Venue: 518, Research Building 4 Abstract: Muller games form a well-established class of games for model checking and verification. These games are played on directed graphs $\mathcal G$ where Player 0 and Player 1 play […]
-
Lu Liu: A Fast Exact Solver with Theoretical Analysis for the Maximum Edge-Weighted Clique Problem
Speaker: Lu Liu (University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) March 15, 2024 (Friday) Venue: 518, Research Building 4 Abstract: The maximum vertex-weighted clique problem (MVWCP) and the maximum edge-weighted clique problem (MEWCP) are two natural extensions of the fundamental maximum clique problem. In this paper, we systematically study […]
-
Yi Zhou: Recent advances in algorithms for k-plex problems
Speaker: Yi Zhou (University of Electronic Science and Technology of China) Time: 16:20-17:20 (Time in Beijing) March 8, 2024 (Friday) Venue: 518, Research Building 4 Abstract: In the field of graph mining, the k-plex is a well-known extension of the clique model. A k-plex is nearly a clique except that each vertex is allowed to […]
-
Guanghao Ye: Nested Dissection Meets IPMs: Fast Algorithms for Flows and LPs in Separable Graphs
() Time: 10:00-11:00 (Time in Beijing) January 19, 2023 (Friday) Venue: 518, Research Building 4 Abstract: Speaker Bio: Guanghao Ye is a PhD student at MIT EECS, advised by Jon Kelner. He previously earned his Bachelor’s and Master’s degrees at the University of Washington, under the supervision of Yin Tat Lee. His research broadly focuses […]
-
2023 UESTC Algorithms and Logic Workshop
会议详情见：https://mp.weixin.qq.com/s/r4w5K4WzHxY3ia1_QuBuzA
-
尹一通：计算采样的理论基础（Theoretical Foundations of Computational Sampling）
Yitong Yin (Nanjing University) Time: 16:20-17:20 (Time in Beijing) November 30, 2023 (Thursday) Venue: Binnuo Coffee Abstract: 蒙特卡罗法（Monte Carlo methods）是与计算机同一时期诞生的二十世纪最重要的科技产物之一。这一方法利用随机采样来高效计算原本传统确定性方法难以计算的量。它的发现拓展了人类高效计算的边界，深刻地影响了人们对计算本质的理解。在这一计算优越性的帮助下带来的科学新发现也塑造了人们今天对客观世界的认识。 本报告将系统介绍报告人近年来在计算采样理论、以及现代蒙特卡罗算法的设计与分析等方面取得的系统性的重要进展，包括：刻画高位概率分布可高效采样条件的“计算相变”定理；马尔可夫链蒙特卡罗（MCMC）采样的并行与分布式算法和局部与动态算法等。 Speaker Bio: 尹一通，南京大学教授，新基石研究员；本科毕业于南京大学，博士毕业于耶鲁大学；博士毕业后在南京大学工作至今，目前担任南京大学理论计算机科学团队负责人。尹一通的研究领域为理论计算机科学，主要研究兴趣包括：随机算法、计算采样，数据结构、并行与分布式计算理论等。在JACM、SICOMP、STOC、FOCS、SODA等理论计算机科学的重要期刊与会议发表论文五十余篇。主持国家重点研发计划项目“数据科学的若干基础理论”，获国家自然科学基金-优秀青年科学基金支持，曾获CCF/IEEE CS青年科学家、CCF优博导师、中创软件人才奖、教育部新世纪人才、南京大学青年五四奖章等荣誉。