-
Lev D. Beklemishev: Provability and computability
Speaker: Lev D. Beklemishev (Moskow State University) Time: 16:20-17:20 Beijing Time October 18, 2024 (Friday) Venue: 518, Research Building 4 Abstract: In this lecture we will give an introduction to the theory of computations and proofs. We will start with classical results such as decidable and undecidable problems and the Gödel incompleteness theorems. Then we […]
-
Markus Lohrey: Selected topics in streaming algorithms
Speaker: () Time: 18:00-19:30 Beijing Time Sept 23, 2024 (Monday) Venue: 518, Research Building 4 Abstract: Speaker Bio: Professor Markus Lohrey, Head of Theoretical Computer Science Group, The University of Siegen, Germany. His research interests are Decidability and complexity of problems in automata theory and algebra, Combinatorial Group theory, data compression, Logic in computer science […]
-
Qi Shi: Responsibility and Norms in Multiagent Systems
Speaker: () Time: 16:20-17:20 (Time in Beijing) 11 September, 2024 (Tuesday) Venue: 518 Abstract: Paper Link: https://www.ijcai.org/proceedings/2024/394
-
Weili (Lily) Wu: The Art of Big Data: Accomplishments and Research Needs
Speaker: () Time: 11:00-12:00 (Time in Beijing) June 11, 2024 (Tuesday) Venue: 518 Abstract: Speaker Bio: Dr. Weili (Lily) Wu received her MS and PhD degrees in computer science both from University of Minnesota, in 1998 and 2002 respectively. She is currently a full professor and a lab director of the Data Communication and Data […]
-
Boting Yang: On the One-Visibility Cops and Robber Game
Speaker: Boting Yang (The University of Regina) Time: 16:20-17:20 (Time in Beijing) May 30, 2024 (Thursday) Venue: 518, Research Building 4 Abstract: In this talk, we consider the one-visibility cops and robber game. The one-visibility cops and robber game is a variation of the classic cops and robber game, where one-visibility means that the information […]
-
Qingyun Chen: Survivable Network Design Revisited: Group-Connectivity
Speaker: Qingyun Chen (University of California, Merced) Time: 10:00-11:00 (Time in Beijing) May 14, 2024 (Tuesday) Venue: B1-104，Main building Abstract: In the classical survivable network design problem (SNDP), we are given an undirected graph with costs on edges and a connectivity requirement for each pair of vertices. The goal is to find a minimum-cost subgraph […]
-
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 […]
-
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 […]
-
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