BASICS Symposium 2018

时间: 2018年1月25日-2018年1月26日
地点: 上海交通大学徐汇校区总办公厅二楼
简介: 由上海交通大学BASICS实验室(BAsic Studies In Computing Science)、上海财经大学理论计算机科学研究中心(ITCS)、复旦大学计算机学院算法与复杂性研究中心、上海市计算机学会理论计算机科学专委会联合举办的“BASICS Symposium 2018”(即以前的“BASICS新年学术研讨会”)将于2018年元月25-26日在上海交通大学徐汇校区举行。我们诚邀您参加此次活动!


1. 邀请信
2. 回执
3. 日程安排


25 January, 2018
09:00-09:30 Chen, Yijia A Parameterized Halting Problem, the Linear Time Hierarchy, and the MRDP Theorem
09:30-10:00 Li, Angsheng Structural Information Theory and Its Applications: Principles for Distinguishing Order from Disorder
10:00-10:30 Deng, Yuxin Logical Characterizations of Probabilistic Bisimilarity
10:30-11:00 Tea Break
11:00-11:30 Lu, Pinyan The Value of Information Concealment
11:30-12:00 Zhang, Peng Max k-Uncut, Densest k-Subgraph, and Unique Games
12:00-12:30 Gravin, Nick Separation in Correlation-Robust Monopolist Problem with Budget
12:30-13:30 Lunch
13:30-14:00 Sun, Xiaoming Exact Quantum Algorithms for Weight Decision Problem
14:00-14:30 Li, Lvzhou Quantum Algorithms for Powers of a Matrix
14:30-15:00 Zheng, Shenggen On Advantages of Several Exact Quantum Computing Models
15:00-15:30 Yan, Jun Quantum Zero-Knowledge Proof for NP
15:30-16:00 Tea Break
16:00-16:30 Fu, Yuxi Final Remark on the Decidability of PDA
16:30-17:00 Jansen, David An O(m log n) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation
17:00-17:30 Chen, Zhe Parametric Runtime Verification is NP-Complete and coNP-Complete
17:30-18:00 Yin, Qiang Two Lower Bounds for BPA
26 January, 2018
09:00-09:30 Wang, Hanpin Logic for Reasoning about Cloud Storage Systems
09:30-10:00 Feng, Xinyu Progress of Concurrent Objects with Partial Methods
10:00-10:30 Cheng, Tong Analyzing Probabilistic Programs with Dynamic Logic
10:30-11:00 Tea Break
11:00-11:30 Xia, Mingji About Variable Lovász Local Lemma
11:30-12:00 Lin, Yuan Assessing Percolation Threshold Based on High-Order Non- backtracking Matrices
12:00-12:30 Scheder, Dominik The PPSZ k-SAT Algorithm on Formulas with Many Solutions
12:30-13:30 Lunch
13:30-14:00 Jiang,Ying Towards Combining Model Checking and Proof Checking
14:00-14:30 Liao, Chao Counting Hypergraph Colorings in the Local Lemma Regime
14:30-15:00 Yang, Qizhe Counting Finite Computations
15:00-15:30 Tea Break
15:30-16:00 Fang, Zhixuan Prices and Subsidies in the Sharing Economy
16:00-16:30 Zhang, Tianyi Improved Distance Sensitivity Oracles via Tree Partitioning
16:30-17:00 Wang, Zihe An Improved Welfare Guarantee for First Price Auctions
17:00-17:10 Closing Speech


电话: 021-34205060转602
Last updated: January 22, 2018