-
Online Primal Dual Algorithms for Generalized Online Bipartite Matching Problems
Speaker: Qiankun Zhang(The University of Hong Kongy) Time: 12:00-13:00 (Time in Beijing) 16:00-17:00 (Time in Auckland) July 6, 2021 (Tuesday) Venue: VooV meeting ID: 695 375 031 Abstract: Online bipartite matching, first defined by Karp, Vazirani, and Vazirani (STOC 1990) three decades ago, has received significant attention in recent years due to its many applications […]
-
Reconstruction Under Outliers for Fourier-sparse functions
Speaker: Xue Chen(George Mason University) Time: 11:00 – 12:00 (Time in Beijing) 15:00 – 16:00 (Time in Auckland) June 28, 2021 (Monday) Venue: B1-501, Main Building Abstract: We consider the problem of learning an unknown f with a sparse Fourier spectrum in the presence of outlier noise. In particular, the algorithm has access to a noisy oracle […]
-
Automata-Theoretical Decision Procedures For Path Feasibility of String Manipulating Programs
Speaker: Zhilin Wu(Chinese Academy of Sciences) Time: 9:00 (Time in Beijing) 13:00 (Time in Auckland) June 17, 2021 (Thursday) Venue: Baixue Tang,UESTC Library Abstract: The design and implementation of decision procedures for checking path feasibility in string-manipulating programs is an important problem, with such applications as symbolic execution of programs manipulating strings and automated detection […]
-
Zero Knowledge Proofs: From Crypto to Fintech
Speaker: Yi Deng(Chinese Academy of Sciences) Time: 10:00 (Time in Beijing) 14:00 (Time in Auckland) June 17, 2021 (Thursday) Venue: Baixue Tang, UESTC Library Abstract: 这一报告里我们将综述零知识证明的发展历史,从原始的理论研究到目前飞速发展金融科技中的重要应用。这一发展历史充分体现了密码学和计算机科学之间的相互促进,我们将着重解释其背后的一些主要思想。 Speaker Bio: 邓燚,中国科学院信息工程研究所研究员。2008年获中国科学院软件所信息安全国家重点实验室博士学位。曾先后在英国伦敦大学学院和新加坡南洋理工大学从事博士后研究工作。主要从事密码学研究,特别是有关零知识证明和密码协议的通信与计算复杂性的问题。曾在一些密码学和计算机科学领域旗舰会议–如 FOCS, Eurocrypt, Asiacrypt,PKC上发表多篇论文。2011年获中国密码学会首届优秀青年奖,2014年获中国密码学会首届创新奖一等奖,2019年获中国电子学会自然科学奖一等奖。 Download poster
-
New Algorithms for Constrained Clustering Problems
Speaker: Qilong Feng(Central South University) Time: 11:00 (Time in Beijing) 15:00 (Time in Auckland) June 17, 2021 (Thursday) Venue: Baixue Tang, UESTC Library Abstract: Designing approximation algorithms for the clustering problem remains an active area of research. However, these algorithms can significantly deteriorate their performance in real-world applications. The major reason is that real-world applications […]
-
Some efficient algorithms for the k-vertex cover problem
Speaker: Yijia Chen(Shanghai Jiao Tong University) Time: 11:00-12:00 (Time in Beijing) 15:00-16:00 (Time in Auckland) May 20, 2021 (Thursday) Venue: B1-501, Main Building Abstract: Let be a fixed constant. The -vertex cover problem asks, for an input graph , whether contains vertices which intersect every edge in . The problem has been studied extensively both […]
-
Mathematical Principles of Information Sciences, II: Mathematical Theory of Intuitive Reasoning
Speaker: Angsheng Li(Beihang University) Time: 14:00-15:00 (Time in Beijing) 18:00-19:00 (Time in Auckland) April 9, 2021 (Friday) Venue: B1-501, Main Building Abstract: Started at Hilbert’s 1900 program of axiomatizing mathematics, in 1930s, mathematicians including Gödel proposed the definition of “proof” and established the subject of mathematical logic, and more importantly, Turing 1936 proposed a mathematical […]
-
Mathematical Principles of Information Sciences, I: The Laws of Information
Speaker: Angsheng Li(Beihang University) Time: 11:00-12:00(Time in Beijing) 15:00-16:00(Time in Auckland) April 8, 2021 (Thursday) Venue: Coffee Beanery (宾诺咖啡) Abstract: Shannon 1945 and 1948 started the mathematical studies of cryptography and of communication, respectively. In 1945,Shannon proposed an information theoretical protocol for data security, leading to the mathematical theory of data security. In 1948, Shannon […]
-
Computation, Randomness and Dimensionality
Speaker: George Barmpalias (Chinese Academy of Sciences) Time: 11:00AM(Time in Beijing) 4:00PM(Time in Auckland) March 11, 2021 (Thursday) Address: Online meeting VooVmeeting: ID: 222 489 953 Password: 202103 Link: https://meeting.tencent.com/s/OgG2rzHAiky1 Abstract: Randomness is a precious resource in computation and modeling, where access to a random source with specific properties is needed. Transforming one type of […]
-
A simple deterministic pseudopolynomial time algorithms for subset sum
Speaker: Chao Xu(The Voleon Group) Time: 11:00AM(Time in Beijing) 4:00PM(Time in Auckland) January 6, 2021 (Wednesday) VooVmeeting ID:360572001 Password: 1936 Link: https://meeting.tencent.com/s/Hu6RyhQq2MPc Abstract: Given a set of n positive integers and a target integer t, the subset sum problem asks if there exists a subset with elements sum to t. Bellman (1956) found a dynamic […]