Cooperation via Codes in Restricted Hat Guessing Games. - Kai Jin; Ce Jin 001; Zhaoquan Gu (AAMAS, 2019)

Faster Algorithms for All Pairs Non-Decreasing Paths Problem. - Ran Duan; Ce Jin 001; Hongxun Wu (ICALP, 2019)

An Improved FPTAS for 0-1 Knapsack. - Ce Jin 001 (ICALP, 2019)

Simulating Random Walks on Graphs in the Streaming Model. - Ce Jin 001 (ITCS, 2019)

Fast Modular Subset Sum using Linear Sketching. - Kyriakos Axiotis; Arturs Backurs; Ce Jin 001; Christos Tzamos; Hongxun Wu (SODA, 2019)

A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset Sum. - Ce Jin 001; Hongxun Wu (SOSA, 2019)

Hardness Magnification for all Sparse NP Languages. - Lijie Chen 001; Ce Jin 001; Ryan Williams 001 (Electron. Colloquium Comput. Complex., 2019)

A Massively Parallel Algorithm for Minimum Weight Vertex Cover. - Mohsen Ghaffari 001; Ce Jin 001; Daan Nilis (SPAA, 2020)

Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond. - Mohsen Ghaffari 001; Christoph Grunau; Ce Jin 001 (DISC, 2020)

An Improved Sketching Bound for Edit Distance. - Ce Jin 001; Jelani Nelson; Kewen Wu 001 (CoRR, 2020)

Sharp Threshold Results for Computational Complexity. - Lijie Chen 001; Ce Jin 001; R. Ryan Williams (Electron. Colloquium Comput. Complex., 2020)

Faster Algorithms for Bounded Tree Edit Distance. - Shyan Akmal; Ce Jin 001 (ICALP, 2021)

Fast Low-Space Algorithms for Subset Sum. - Ce Jin 001; Nikhil Vyas 001; Ryan Williams 001 (SODA, 2021)

Fast and Simple Modular Subset Sum. - Kyriakos Axiotis; Arturs Backurs; Karl Bringmann; Ce Jin 001; Vasileios Nakos; Christos Tzamos; Hongxun Wu (SOSA, 2021)

An Improved Sketching Algorithm for Edit Distance. - Ce Jin 001; Jelani Nelson; Kewen Wu 001 (STACS, 2021)

Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity. - Shyan Akmal; Lijie Chen 001; Ce Jin 001; Malvika Raj; Ryan Williams 001 (Electron. Colloquium Comput. Complex., 2021)

Constructive Separations and Their Consequences. - Lijie Chen 001; Ce Jin 001; Rahul Santhanam; Ryan Williams 001 (Electron. Colloquium Comput. Complex., 2021)

Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles. - Mina Dalirrooyfard; Ce Jin 001; Virginia Vassilevska Williams; Nicole Wein (FOCS, 2022)

Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions. - Lijie Chen 001; Ce Jin 001; R. Ryan Williams; Hongxun Wu (SODA, 2022)

Tight dynamic problem lower bounds from generalized BMM and OMv. - Ce Jin 001; Yinzhan Xu (STOC, 2022)

Quantum Speed-ups for String Synchronizing Sets, Longest Common Substring, and k-mismatch Matching. - Ce Jin 001; Jakob Nogler (CoRR, 2022)

Faster Algorithms for Text-to-Pattern Hamming Distances. - Timothy M. Chan; Ce Jin 001; Virginia Vassilevska Williams; Yinzhan Xu (FOCS, 2023)

Approximating Knapsack and Partition via Dense Subset Sums. - Mingyang Deng; Ce Jin 001; Xiao Mao (SODA, 2023)

Removing Additive Structure in 3SUM-Based Reductions. - Ce Jin 001; Yinzhan Xu (STOC, 2023)

Solving Knapsack with Small Items via L0-Proximity. - Ce Jin 001 (CoRR, 2023)

New Tools for Peak Memory Scheduling. - Ce Jin 001; Manish Purohit; Zoya Svitkina; Erik Vee; Joshua R. Wang (CoRR, 2023)

A VLSI Circuit Model Accounting For Wire Delay. - Ce Jin 001; Ryan Williams 001; Nathaniel Young (Electron. Colloquium Comput. Complex., 2023)

Near-Optimal Quantum Algorithms for String Problems. - Shyan Akmal; Ce Jin 001 (Algorithmica, 2023)

Streaming Algorithms for Connectivity Augmentation. - Ce Jin 001; Michael Kapralov; Sepideh Mahabadi; Ali Vakilian (ICALP, 2024)

A Faster Algorithm for Pigeonhole Equal Sums. - Ce Jin 001; Hongxun Wu (ICALP, 2024)

Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization. - Daniel Gibney; Ce Jin 001; Tomasz Kociumaka; Sharma V. Thankachan (SODA, 2024)

Improved Roundtrip Spanners, Emulators, and Directed Girth Approximation. - Alina Harbuzova; Ce Jin 001; Virginia Vassilevska Williams; Zixuan Xu (SODA, 2024)

Listing 6-Cycles. - Ce Jin 001; Virginia Vassilevska Williams; Renfei Zhou (SOSA, 2024)

Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More. - Ce Jin 001; Yinzhan Xu (STOC, 2024)

0-1 Knapsack in Nearly Quadratic Time. - Ce Jin 001 (STOC, 2024)

An Efficient Algorithm for All-Pairs Bounded Edge Connectivity. - Shyan Akmal; Ce Jin 001 (Algorithmica, 2024)

Quantum Speed-Ups for String Synchronizing Sets, Longest Common Substring, and k-mismatch Matching. - Ce Jin 001; Jakob Nogler (ACM Trans. Algorithms, 2024)

Approximately Counting Knapsack Solutions in Subquadratic Time. - Weiming Feng 001; Ce Jin 001 (SODA, 2025)

Beyond 2-Approximation for k-Center in Graphs. - Ce Jin 001; Yael Kirkpatrick; Virginia Vassilevska Williams; Nicole Wein (SODA, 2025)

New Applications of 3SUM-Counting in Fine-Grained Complexity and Pattern Matching. - Nick Fischer; Ce Jin 001; Yinzhan Xu (SODA, 2025)

All-Pairs Shortest Paths with Few Weights per Node. - Amir Abboud; Nick Fischer; Ce Jin 001; Virginia Vassilevska Williams; Zoe Xi (STOC, 2025)

Beyond 2-approximation for k-Center in Graphs. - Ce Jin 001; Yael Kirkpatrick; Virginia Vassilevska Williams; Nicole Wein (CoRR, 2025)