Research Direction and Goals

The Institute for Theoretical Computer Science is dedicated to fundamental research in computer science, focusing on core theoretical problems related to computation. Our main scope covers Algorithm Design and Analysis and Formal Verification, alongside exploring interdisciplinary applications with economics and data science. Our goal is to provide cutting-edge, reliable, and universal theoretical frameworks to build a solid scientific foundation for complex systems, efficient algorithms, and cross-disciplinary solutions in the information society.

Research Characteristics

Novelty: We aim to explore the theoretical limits of computer science and solve open theoretical problems. Our goal is to provide general principles and methodologies for algorithm design and formal verification, establishing universal theoretical frameworks to guide innovation.

Reliability: We provide strict theoretical analysis and formal verification for algorithms and programs, primarily focusing on worst-case scenarios. Using rigorous mathematics, we ensure mathematically provable properties, thus guaranteeing high-confidence reliability for the correctness, security, and performance of core systems.

1、Algorithm Design and Analysis

Graph Algorithms：Yijia Chen, Sixue Liu, Yuhao Zhang

Online Algorithms: Yuhao Zhang

Counting Algorithms: Chihao Zhang, Kuan Yang

2、Formal Verification

Concurrent Systems: Yuxi Fu, Huan Long

Automated Verification: Yuting Wang

Novel Program Theory: Hongfei Fu

3、Interdisciplinary Fields

(Mathematics) High-Dimensional Probability: Chihao Zhang

(Economics) Computational Economics: Biaoshuai Tao

(Data Science) Data Query Processing and Optimization: Qiang Yin

(Artificial Intelligence) Visualization and Explainability: Xiaoju Dong