Follow
Ce Jin
Ce Jin
Verified email at mit.edu - Homepage
Title
Cited by
Cited by
Year
Hardness Magnification for all Sparse NP Languages
L Chen, C Jin, R Williams
Symposium on Foundations of Computer Science (FOCS), 2019
292019
An Improved FPTAS for 0-1 Knapsack
C Jin
ICALP 2019, 2019
262019
Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond
M Ghaffari, C Grunau, C Jin
DISC 2020, 2020
242020
Sharp threshold results for computational complexity
L Chen, C Jin, RR Williams
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
232020
A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset Sum
C Jin, H Wu
2nd Symposium on Simplicity in Algorithms (SOSA 2019), 2018
222018
Fast Modular Subset Sum using Linear Sketching
K Axiotis, A Backurs, C Jin, C Tzamos, H Wu
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
162019
Near-optimal quantum algorithms for string problems
S Akmal, C Jin
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
152022
Simulating Random Walks on Graphs in the Streaming Model
C Jin
10th Innovations in Theoretical Computer Science Conference (ITCS 2019), 2018
142018
A Massively Parallel Algorithm for Minimum Weight Vertex Cover
M Ghaffari, C Jin, D Nilis
SPAA 2020, 2020
132020
Fast Low-Space Algorithms for Subset Sum
C Jin, N Vyas, R Williams
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
122021
Faster Algorithms for All Pairs Non-decreasing Paths Problem
R Duan, C Jin, H Wu
ICALP 2019, 2019
92019
Fast and Simple Modular Subset Sum∗
K Axiotis, A Backurs, K Bringmann, C Jin, V Nakos, C Tzamos, H Wu
Symposium on Simplicity in Algorithms (SOSA), 57-67, 2021
82021
Tight dynamic problem lower bounds from generalized bmm and omv
C Jin, Y Xu
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
72022
Faster Algorithms for Bounded Tree Edit Distance
S Akmal, C Jin
arXiv preprint arXiv:2105.02428, 2021
62021
Cooperation via Codes in Restricted Hat Guessing Games
K Jin, C Jin, Z Gu
Proceedings of the 18th International Conference on Autonomous Agents and …, 2019
62019
An Improved Sketching Algorithm for Edit Distance
C Jin, J Nelson, K Wu
38th International Symposium on Theoretical Aspects of Computer Science …, 2021
52021
Approximating Knapsack and Partition via Dense Subset Sums
M Deng, C Jin, X Mao
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
42023
Approximation algorithms and hardness for n-pairs shortest paths and all-nodes shortest cycles
M Dalirrooyfard, C Jin, VV Williams, N Wein
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
42022
Constructive separations and their consequences
L Chen, C Jin, R Santhanam, RR Williams
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
32022
Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions∗
L Chen, C Jin, RR Williams, H Wu
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
32022
The system can't perform the operation now. Try again later.
Articles 1–20