default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCe Jin 0001
Person information
- affiliation: Massachusetts Institute of Technology (MIT), Electrical Engineering & Computer Science Department, Cambridge, MA, USA
- affiliation (former): Tsinghua University, Institute for Interdisciplinary Information Sciences, Beijing, China
Other persons with the same name
- Ce Jin 0002 — Xi'an University of Science and Technology, Xi'an, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Shyan Akmal
, Ce Jin:
An Efficient Algorithm for All-Pairs Bounded Edge Connectivity. Algorithmica 86(5): 1623-1656 (2024)- [j3]Lijie Chen, Ce Jin, Rahul Santhanam, Ryan Williams:
Constructive Separations and Their Consequences. TheoretiCS 3 (2024) - [c33]Ce Jin, Michael Kapralov, Sepideh Mahabadi, Ali Vakilian:
Streaming Algorithms for Connectivity Augmentation. ICALP 2024: 93:1-93:20 - [c32]Ce Jin, Hongxun Wu:
A Faster Algorithm for Pigeonhole Equal Sums. ICALP 2024: 94:1-94:11 - [c31]Ce Jin, R. Ryan Williams, Nathaniel Young:
A VLSI Circuit Model Accounting for Wire Delay. ITCS 2024: 66:1-66:22 - [c30]Daniel Gibney, Ce Jin, Tomasz Kociumaka, Sharma V. Thankachan:
Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization. SODA 2024: 3302-3332 - [c29]Alina Harbuzova, Ce Jin, Virginia Vassilevska Williams, Zixuan Xu:
Improved Roundtrip Spanners, Emulators, and Directed Girth Approximation. SODA 2024: 4641-4669 - [c28]Ce Jin, Virginia Vassilevska Williams, Renfei Zhou:
Listing 6-Cycles. SOSA 2024: 19-27 - [c27]Ce Jin:
0-1 Knapsack in Nearly Quadratic Time. STOC 2024: 271-282 - [c26]Ce Jin, Yinzhan Xu:
Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More. STOC 2024: 1573-1584 - [i34]Ce Jin, Michael Kapralov, Sepideh Mahabadi, Ali Vakilian:
Streaming Algorithms for Connectivity Augmentation. CoRR abs/2402.10806 (2024) - [i33]Ce Jin, Hongxun Wu:
A Faster Algorithm for Pigeonhole Equal Sums. CoRR abs/2403.19117 (2024) - [i32]Ce Jin, Yinzhan Xu:
Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More. CoRR abs/2403.20326 (2024) - 2023
- [j2]Shyan Akmal, Ce Jin:
Near-Optimal Quantum Algorithms for String Problems. Algorithmica 85(8): 2260-2317 (2023) - [j1]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): 2395-2426 (2023) - [c25]Timothy M. Chan, Ce Jin, Virginia Vassilevska Williams, Yinzhan Xu:
Faster Algorithms for Text-to-Pattern Hamming Distances. FOCS 2023: 2188-2203 - [c24]Shyan Akmal, Ce Jin:
An Efficient Algorithm for All-Pairs Bounded Edge Connectivity. ICALP 2023: 11:1-11:20 - [c23]Mingyang Deng, Ce Jin, Xiao Mao:
Approximating Knapsack and Partition via Dense Subset Sums. SODA 2023: 2961-2979 - [c22]Ce Jin, Jakob Nogler:
Quantum Speed-ups for String Synchronizing Sets, Longest Common Substring, and k-mismatch Matching. SODA 2023: 5090-5121 - [c21]Ce Jin, Yinzhan Xu:
Removing Additive Structure in 3SUM-Based Reductions. STOC 2023: 405-418 - [i31]Mingyang Deng, Ce Jin, Xiao Mao:
Approximating Knapsack and Partition via Dense Subset Sums. CoRR abs/2301.09333 (2023) - [i30]Shyan Akmal, Ce Jin:
An Efficient Algorithm for All-Pairs Bounded Edge Connectivity. CoRR abs/2305.02132 (2023) - [i29]Ce Jin:
Solving Knapsack with Small Items via L0-Proximity. CoRR abs/2307.09454 (2023) - [i28]Ce Jin:
0-1 Knapsack in Nearly Quadratic Time. CoRR abs/2308.04093 (2023) - [i27]Timothy M. Chan, Ce Jin, Virginia Vassilevska Williams, Yinzhan Xu:
Faster Algorithms for Text-to-Pattern Hamming Distances. CoRR abs/2310.13174 (2023) - [i26]Ce Jin, Virginia Vassilevska Williams, Renfei Zhou:
Listing 6-Cycles. CoRR abs/2310.14575 (2023) - [i25]Alina Harbuzova, Ce Jin, Virginia Vassilevska Williams, Zixuan Xu:
Improved Roundtrip Spanners, Emulators, and Directed Girth Approximation. CoRR abs/2310.20473 (2023) - [i24]Daniel Gibney, Ce Jin, Tomasz Kociumaka, Sharma V. Thankachan:
Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization. CoRR abs/2311.01793 (2023) - [i23]Ce Jin, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang:
New Tools for Peak Memory Scheduling. CoRR abs/2312.13526 (2023) - [i22]Ce Jin, Ryan Williams, Nathaniel Young:
A VLSI Circuit Model Accounting For Wire Delay. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c20]Mina Dalirrooyfard, Ce Jin, Virginia Vassilevska Williams, Nicole Wein:
Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles. FOCS 2022: 290-300 - [c19]Shyan Akmal, Lijie Chen, Ce Jin, Malvika Raj, Ryan Williams:
Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity. ITCS 2022: 3:1-3:25 - [c18]Lijie Chen, Ce Jin, R. Ryan Williams, Hongxun Wu:
Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions. SODA 2022: 1661-1678 - [c17]Shyan Akmal, Ce Jin:
Near-Optimal Quantum Algorithms for String Problems. SODA 2022: 2791-2832 - [c16]Ce Jin, Yinzhan Xu:
Tight dynamic problem lower bounds from generalized BMM and OMv. STOC 2022: 1515-1528 - [i21]Ce Jin, Yinzhan Xu:
Tight Dynamic Problem Lower Bounds from Generalized BMM and OMv. CoRR abs/2202.11250 (2022) - [i20]Lijie Chen, Ce Jin, Rahul Santhanam, R. Ryan Williams:
Constructive Separations and Their Consequences. CoRR abs/2203.14379 (2022) - [i19]Mina Dalirrooyfard, Ce Jin, Virginia Vassilevska Williams, Nicole Wein:
Approximation Algorithms and Hardness for n-Pairs Shortest Paths and All-Nodes Shortest Cycles. CoRR abs/2204.03076 (2022) - [i18]Ce Jin, Yinzhan Xu:
Removing Additive Structure in 3SUM-Based Reductions. CoRR abs/2211.07048 (2022) - [i17]Ce Jin, Jakob Nogler:
Quantum Speed-ups for String Synchronizing Sets, Longest Common Substring, and k-mismatch Matching. CoRR abs/2211.15945 (2022) - 2021
- [c15]Lijie Chen, Ce Jin, Rahul Santhanam, R. Ryan Williams:
Constructive Separations and Their Consequences. FOCS 2021: 646-657 - [c14]Shyan Akmal, Ce Jin:
Faster Algorithms for Bounded Tree Edit Distance. ICALP 2021: 12:1-12:15 - [c13]Ce Jin, Nikhil Vyas, Ryan Williams:
Fast Low-Space Algorithms for Subset Sum. SODA 2021: 1757-1776 - [c12]Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu:
Fast and Simple Modular Subset Sum. SOSA 2021: 57-67 - [c11]Ce Jin, Jelani Nelson, Kewen Wu:
An Improved Sketching Algorithm for Edit Distance. STACS 2021: 45:1-45:16 - [i16]Shyan Akmal, Ce Jin:
Faster Algorithms for Bounded Tree Edit Distance. CoRR abs/2105.02428 (2021) - [i15]Shyan Akmal, Ce Jin:
Near-Optimal Quantum Algorithms for String Problems. CoRR abs/2110.09696 (2021) - [i14]Lijie Chen, Ce Jin, R. Ryan Williams, Hongxun Wu:
Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions. CoRR abs/2111.01759 (2021) - [i13]Shyan Akmal, Lijie Chen, Ce Jin, Malvika Raj, Ryan Williams:
Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity. Electron. Colloquium Comput. Complex. TR21 (2021) - [i12]Lijie Chen, Ce Jin, Rahul Santhanam, Ryan Williams:
Constructive Separations and Their Consequences. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c10]Mohsen Ghaffari, Ce Jin, Daan Nilis:
A Massively Parallel Algorithm for Minimum Weight Vertex Cover. SPAA 2020: 259-268 - [c9]Lijie Chen, Ce Jin, R. Ryan Williams:
Sharp threshold results for computational complexity. STOC 2020: 1335-1348 - [c8]Mohsen Ghaffari, Christoph Grunau, Ce Jin:
Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond. DISC 2020: 34:1-34:18 - [i11]Mohsen Ghaffari, Christoph Grunau, Ce Jin:
Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond. CoRR abs/2002.09610 (2020) - [i10]Mohsen Ghaffari, Ce Jin, Daan Nilis:
A Massively Parallel Algorithm for Minimum Weight Vertex Cover. CoRR abs/2005.10566 (2020) - [i9]Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu:
Fast and Simple Modular Subset Sum. CoRR abs/2008.10577 (2020) - [i8]Ce Jin, Jelani Nelson, Kewen Wu:
An Improved Sketching Bound for Edit Distance. CoRR abs/2010.13170 (2020) - [i7]Ce Jin, Nikhil Vyas, Ryan Williams:
Fast Low-Space Algorithms for Subset Sum. CoRR abs/2011.03819 (2020) - [i6]Lijie Chen, Ce Jin, R. Ryan Williams:
Sharp Threshold Results for Computational Complexity. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c7]Kai Jin, Ce Jin, Zhaoquan Gu:
Cooperation via Codes in Restricted Hat Guessing Games. AAMAS 2019: 547-555 - [c6]Lijie Chen, Ce Jin, R. Ryan Williams:
Hardness Magnification for all Sparse NP Languages. FOCS 2019: 1240-1255 - [c5]Ran Duan, Ce Jin, Hongxun Wu:
Faster Algorithms for All Pairs Non-Decreasing Paths Problem. ICALP 2019: 48:1-48:13 - [c4]Ce Jin:
An Improved FPTAS for 0-1 Knapsack. ICALP 2019: 76:1-76:14 - [c3]Ce Jin:
Simulating Random Walks on Graphs in the Streaming Model. ITCS 2019: 46:1-46:15 - [c2]Ce Jin, Hongxun Wu:
A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset Sum. SOSA 2019: 17:1-17:6 - [c1]Kyriakos Axiotis, Arturs Backurs, Ce Jin, Christos Tzamos, Hongxun Wu:
Fast Modular Subset Sum using Linear Sketching. SODA 2019: 58-69 - [i5]Ce Jin:
An Improved FPTAS for 0-1 Knapsack. CoRR abs/1904.09562 (2019) - [i4]Ran Duan, Ce Jin, Hongxun Wu:
Faster Algorithms for All Pairs Non-decreasing Paths Problem. CoRR abs/1904.10701 (2019) - [i3]Lijie Chen, Ce Jin, Ryan Williams:
Hardness Magnification for all Sparse NP Languages. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [i2]Ce Jin, Hongxun Wu:
A Simple Near-Linear Pseudopolynomial Time Randomized Algorithm for Subset Sum. CoRR abs/1807.11597 (2018) - [i1]Ce Jin:
Simulating Random Walks on Graphs in the Streaming Model. CoRR abs/1811.08205 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
