Jiayi Lian
Scholar

Jiayi Lian

Google Scholar ID: lx7OR8IAAAAJ
Zhejiang University
Algorithms and Complexity
Citations & Impact
All-time
Citations
60
 
H-index
4
 
i10-index
3
 
Publications
8
 
Co-authors
0
 
Publications
8 items
Browse publications on Google Scholar (top-right) ↗
Resume (English only)
Academic Achievements
  • Publications:
  • 1. Weakly Approximating Knapsack in Subquadratic Time (ICALP 2025)
  • 2. An Improved Pseudopolynomial Time Algorithm for Subset Sum (FOCS 2024)
  • 3. A Nearly Quadratic-Time FPTAS for Knapsack (STOC 2024, SICOMP journal version)
  • 4. Approximating partition in near-linear time (STOC 2024)
  • 5. Faster algorithms for bounded knapsack and bounded subset sum via fine-grained proximity results (SODA 2024)
Research Experience
  • No specific work experience or research project information provided
Education
  • Ph.D.: College of Computer Science and Technology, Zhejiang University, Advisor: Professor Guochuan Zhang; B.S.: Chu Kochen Honors College, Zhejiang University, Major: Computer Science and Technology
Background
  • Research Interests: Theoretical Computer Science; Major: Computer Science and Technology
Miscellany
  • Chinese Name: 连佳宜; Nickname: Lianlian or +1 (sounds like 佳宜 in Chinese); Hobbies: Bridge; Blogs
Co-authors
0 total
Co-authors: 0 (list not available)