Ce Jin

Publication Activity (10 Years)

Years Active: 2023-2024
Publications (10 Years): 23

Top Topics

Computational Complexity

Computationally Demanding

Top Venues

Publications

Ce Jin, Hongxun Wu
A Faster Algorithm for Pigeonhole Equal Sums. CoRR (2024)
Ce Jin, Hongxun Wu
A Faster Algorithm for Pigeonhole Equal Sums. ICALP (2024)
Shyan Akmal, Ce Jin
An Efficient Algorithm for All-Pairs Bounded Edge Connectivity. Algorithmica 86 (5) (2024)
Ce Jin, Yinzhan Xu
Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More. CoRR (2024)
Alina Harbuzova, Ce Jin, Virginia Vassilevska Williams, Zixuan Xu
Improved Roundtrip Spanners, Emulators, and Directed Girth Approximation. SODA (2024)
Ce Jin, R. Ryan Williams, Nathaniel Young
A VLSI Circuit Model Accounting for Wire Delay. ITCS (2024)
Lijie Chen, Ce Jin, Rahul Santhanam, Ryan Williams
Constructive Separations and Their Consequences. TheoretiCS 3 (2024)
Daniel Gibney, Ce Jin, Tomasz Kociumaka, Sharma V. Thankachan
Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization. SODA (2024)
Ce Jin, Virginia Vassilevska Williams, Renfei Zhou
Listing 6-Cycles. SOSA (2024)
Ce Jin, Michael Kapralov, Sepideh Mahabadi, Ali Vakilian
Streaming Algorithms for Connectivity Augmentation. ICALP (2024)
Ce Jin
0-1 Knapsack in Nearly Quadratic Time. STOC (2024)
Ce Jin, Yinzhan Xu
Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More. STOC (2024)
Ce Jin, Ryan Williams, Nathaniel Young
A VLSI Circuit Model Accounting For Wire Delay. Electron. Colloquium Comput. Complex. (2023)
Ce Jin
0-1 Knapsack in Nearly Quadratic Time. CoRR (2023)
Ce Jin
Solving Knapsack with Small Items via L0-Proximity. CoRR (2023)
Shyan Akmal, Ce Jin
Near-Optimal Quantum Algorithms for String Problems. Algorithmica 85 (8) (2023)
Ce Jin, Virginia Vassilevska Williams, Renfei Zhou
Listing 6-Cycles. CoRR (2023)
Alina Harbuzova, Ce Jin, Virginia Vassilevska Williams, Zixuan Xu
Improved Roundtrip Spanners, Emulators, and Directed Girth Approximation. CoRR (2023)
Timothy M. Chan, Ce Jin, Virginia Vassilevska Williams, Yinzhan Xu
Faster Algorithms for Text-to-Pattern Hamming Distances. FOCS (2023)
Timothy M. Chan, Ce Jin, Virginia Vassilevska Williams, Yinzhan Xu
Faster Algorithms for Text-to-Pattern Hamming Distances. CoRR (2023)
Shyan Akmal, Lijie Chen, Ce Jin, Malvika Raj, R. Ryan Williams
Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity. Algorithmica 85 (8) (2023)
Shyan Akmal, Ce Jin
An Efficient Algorithm for All-Pairs Bounded Edge Connectivity. ICALP (2023)
Daniel Gibney, Ce Jin, Tomasz Kociumaka, Sharma V. Thankachan
Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization. CoRR (2023)