| 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 |