| 2026 | ICALP | Deterministic Monotone Min-Plus Product and Convolution. | Ce Jin, Jaewoo Park, Barna Saha, Yinzhan Xu |
| 2026 | SODA | Improved Additive Approximation Algorithms for APSP. | Ce Jin, Yael Kirkpatrick, Michal Stawarz, Virginia Vassilevska Williams |
| 2026 | SODA | Algorithms and Lower Bounds for the Maximum Overlap of Two Polygons Under Translation. | Mikkel Abrahamsen, Sujoy Bhore, Maike Buchin, Jacobus Conradi, Ce Jin, Andr Nusser, Carolin Rehs |
| 2026 | STOC | Classifying Identities: Subcubic Distributivity Checking and Hardness from Arithmetic Progression Detection. | Bartlomiej Dudek, Nick Fischer, Geri Gokaj, Ce Jin, Marvin Knnemann, Xiao Mao, Mirza Redzic |
| 2026 | STOC | Memory Reallocation with Polylogarithmic Overhead. | Ce Jin |
| 2025 | ESA | New Algorithms for Pigeonhole Equal Subset Sum. | Ce Jin, Ryan Williams, Stan Zhang |
| 2025 | FOCS | Near-Optimal Property Testers for Pattern Matching. | Ce Jin, Tomasz Kociumaka |
| 2025 | SODA | Approximately Counting Knapsack Solutions in Subquadratic Time. | Weiming Feng, Ce Jin |
| 2025 | SODA | Beyond 2-Approximation for | Ce Jin, Yael Kirkpatrick, Virginia Vassilevska Williams, Nicole Wein |
| 2025 | SODA | New Applications of 3SUM-Counting in Fine-Grained Complexity and Pattern Matching. | Nick Fischer, Ce Jin, Yinzhan Xu |
| 2025 | STOC | All-Pairs Shortest Paths with Few Weights per Node. | Amir Abboud, Nick Fischer, Ce Jin, Virginia Vassilevska Williams, Zoe Xi |
| 2024 | ICALP | Streaming Algorithms for Connectivity Augmentation. | Ce Jin, Michael Kapralov, Sepideh Mahabadi, Ali Vakilian |
| 2024 | ICALP | A Faster Algorithm for Pigeonhole Equal Sums. | Ce Jin, Hongxun Wu |
| 2024 | SODA | Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization. | Daniel Gibney, Ce Jin, Tomasz Kociumaka, Sharma V. Thankachan |
| 2024 | SODA | Improved Roundtrip Spanners, Emulators, and Directed Girth Approximation. | Alina Harbuzova, Ce Jin, Virginia Vassilevska Williams, Zixuan Xu |
| 2024 | STOC | Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More. | Ce Jin, Yinzhan Xu |
| 2024 | STOC | 0-1 Knapsack in Nearly Quadratic Time. | Ce Jin |
| 2023 | FOCS | Faster Algorithms for Text-to-Pattern Hamming Distances. | Timothy M. Chan, Ce Jin, Virginia Vassilevska Williams, Yinzhan Xu |
| 2023 | ICALP | An Efficient Algorithm for All-Pairs Bounded Edge Connectivity. | Shyan Akmal, Ce Jin |
| 2023 | SODA | Approximating Knapsack and Partition via Dense Subset Sums. | Mingyang Deng, Ce Jin, Xiao Mao |
| 2023 | SODA | Quantum Speed-ups for String Synchronizing Sets, Longest Common Substring, and | Ce Jin, Jakob Nogler |
| 2023 | STOC | Removing Additive Structure in 3SUM-Based Reductions. | Ce Jin, Yinzhan Xu |
| 2022 | FOCS | Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles. | Mina Dalirrooyfard, Ce Jin, Virginia Vassilevska Williams, Nicole Wein |
| 2022 | SODA | Near-Optimal Quantum Algorithms for String Problems. | Shyan Akmal, Ce Jin |
| 2022 | SODA | Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions. | Lijie Chen, Ce Jin, R. Ryan Williams, Hongxun Wu |
| 2022 | STOC | Tight dynamic problem lower bounds from generalized BMM and OMv. | Ce Jin, Yinzhan Xu |
| 2021 | FOCS | Constructive Separations and Their Consequences. | Lijie Chen, Ce Jin, Rahul Santhanam, R. Ryan Williams |
| 2021 | ICALP | Faster Algorithms for Bounded Tree Edit Distance. | Shyan Akmal, Ce Jin |
| 2021 | SODA | Fast Low-Space Algorithms for Subset Sum. | Ce Jin, Nikhil Vyas, Ryan Williams |
| 2021 | STACS | An Improved Sketching Algorithm for Edit Distance. | Ce Jin, Jelani Nelson, Kewen Wu |
| 2020 | STOC | Sharp threshold results for computational complexity. | Lijie Chen, Ce Jin, R. Ryan Williams |
| 2020 | SPAA | A Massively Parallel Algorithm for Minimum Weight Vertex Cover. | Mohsen Ghaffari, Ce Jin, Daan Nilis |
| 2019 | FOCS | Hardness Magnification for all Sparse NP Languages. | Lijie Chen, Ce Jin, R. Ryan Williams |
| 2019 | ICALP | Faster Algorithms for All Pairs Non-Decreasing Paths Problem. | Ran Duan, Ce Jin, Hongxun Wu |
| 2019 | ICALP | An Improved FPTAS for 0-1 Knapsack. | Ce Jin |
| 2019 | SODA | Fast Modular Subset Sum using Linear Sketching. | Kyriakos Axiotis, Arturs Backurs, Ce Jin, Christos Tzamos, Hongxun Wu |
| 2019 | SODA | A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset Sum. | Ce Jin, Hongxun Wu |