Category: Seminars

  • 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 […]

  • Andrei Bulatov: Homomorphism counts and graph equivalence

    Speaker: () Time: First Lecture: 17:00-18:00 Beijing Time April 18, 2025 (Friday) Second Lecture: 10:00-11:00 Beijing Time April 20, 2025 (Sunday) Third Lecture: 16:00-17:00 Beijing Time April 23, 2025 (Wednesday) 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 […]

  • Giorgos Mousa: Broken Circuit Complex: Introduction and Open Questions

    Speaker: Giorgos Mousa Time: 16:20-17:20 Beijing Time March 28, 2025 (Friday) Venue: 518, Research Building 4 Abstract: Speaker Bio: Giorgos Mousa obtained his PhD from the University of Edinburgh, where he worked with Professor Heng Guo in the Laboratory for the Foundations of Computer Science. His research interests include matroid theory, Markov chains, and sampling […]

  • Yi Li: Near-optimal Active Regression of Single-Index Models

    Speaker: () Time: 10:20-11:20 Beijing Time March 4, 2025 (Tuesday) Venue: 518, Research Building 4 Abstract: Speaker Bio: Yi Li is an associate professor in the Division of Mathematical Sciences and holds a joint appointment in the School of Computing and Data Science at Nanyang Technological University. His main research interests lie in algorithms for […]

  • Md. Saidur Rahman: Design of Enumeration Algorithms: A Tool to Assist 4IR

    Speaker: () Time: 10:30-11:30 Beijing Time February 27, 2025 (Thursday) Venue: 518, Research Building 4 Abstract: Speaker Bio: Dr. Md. Saidur Rahman, a professor (on deputation) of Bangladesh University of Engineering and Technology (BUET) and a fellow of Bangladesh Academy of Sciences, is currently serving as a member of University Grants Commission of Bangladesh. He […]

  • Venkatesan Guruswami: The Parameterized Inapproximability Hypothesis

    Speaker: () Time: 9:00-10:00 Beijing Time February 26, 2025 (Wednesday) Venue: 518, Research Building 4 Abstract: Speaker Bio: Venkatesan Guruswami is a Professor of Computer Science and Mathematics at UC Berkeley and senior scientist at the Simons Institute for the Theory of Computing. Venkat received his Bachelor’s degree from the Indian Institute of Technology, Madras, […]

  • Siyue Liu: Approximately Packing Dijoins via Nowhere-Zero Flows

    Speaker: () Time: 16:20-17:20 Beijing Time Dec 13, 2024 (Friday) Venue: 518, Research Building 4 Abstract: Speaker Bio: Siyue Liu is a Ph.D. student in the Algorithms, Combinatorics, and Optimization program at the Tepper School of Business, Carnegie Mellon University. Her research focuses on combinatorial optimization and integer programming. She has published in Mathematical Programming […]

  • Bingkai Lin: Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis

    Speaker: () Time: 16:20-17:20 Beijing Time Dec 2, 2024 (Monday) Venue: 518, Research Building 4 Abstract: Speaker Bio: 林冰凯,南京大学计算机学院教授,博士生导师。博士毕业于日本东京大学,硕士及本科毕业于上海交通大学ACM试点班。研究领域是理论计算机科学,具体领域是参数复杂性(Parameterized Complexity) 及近似算法 (Approximation Algorithms)。主要成果包括独自解决了参数复杂性领域基础性难题——k-BICLIQUE问题的参数复杂性;在图嵌入问题参数复杂性的二分猜想这一长达十多年的公开问题上取得重要进展;对经典NP-难优化问题集合覆盖问题取得首个以及当前最好的参数算法不可近似比;证明了指数时间假设蕴含参数不可近似假设,推动了参数PCP理论的发展。成果获得理论计算机国际一流会议STOC 2024与计算机科学图论领域重要国际会议WG 2017最佳论文奖。两篇单独作者论文分别获国际算法会议SODA 2015最佳论文奖和最佳学生论文奖以及欧洲理论计算机重要会议ICALP 2019最佳论文奖。