Ce Jin
Orcid: 0000-0001-5264-1772Affiliations:
- Massachusetts Institute of Technology (MIT), Electrical Engineering & Computer Science Department, Cambridge, MA, USA
- Tsinghua University, Institute for Interdisciplinary Information Sciences, Beijing, China (former)
According to our database1,
Ce Jin
authored at least 40 papers
between 2019 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
2019
2020
2021
2022
2023
2024
2025
0
1
2
3
4
5
6
7
8
9
10
2
4
1
2
2
1
3
7
3
3
4
2
6
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on github.com
-
on dl.acm.org
On csauthors.net:
Bibliography
2025
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025
2024
Quantum Speed-Ups for String Synchronizing Sets, Longest Common Substring, and <i>k</i>-mismatch Matching.
ACM Trans. Algorithms, October, 2024
Algorithmica, May, 2024
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024
Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024
Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024
2023
Electron. Colloquium Comput. Complex., 2023
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
2022
Quantum Speed-ups for String Synchronizing Sets, Longest Common Substring, and k-mismatch Matching.
CoRR, 2022
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022
Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022
2021
Electron. Colloquium Comput. Complex., 2021
Electron. Colloquium Comput. Complex., 2021
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021
Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021
2020
Electron. Colloquium Comput. Complex., 2020
Proceedings of the 34th International Symposium on Distributed Computing, 2020
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020
2019
Electron. Colloquium Comput. Complex., 2019
Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019