Ce Jin

Ce Jin

Massachusetts Institute of Technology

H-index: 12

North America-United States

About Ce Jin

Ce Jin, With an exceptional h-index of 12 and a recent h-index of 12 (since 2020), a distinguished researcher at Massachusetts Institute of Technology, specializes in the field of Theoretical computer science, Fine-grained Complexity, algorithms and data structures.

His recent articles reflect a diverse array of research interests and contributions to the field:

A Faster Algorithm for Pigeonhole Equal Sums

Streaming Algorithms for Connectivity Augmentation

Constructive separations and their consequences

An efficient algorithm for all-pairs bounded edge connectivity

A VLSI circuit model accounting for wire delay

Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization

Improved Roundtrip Spanners, Emulators, and Directed Girth Approximation

Listing 6-Cycles

Ce Jin Information

University

Position

___

Citations(all)

333

Citations(since 2020)

333

Cited By

64

hIndex(all)

12

hIndex(since 2020)

12

i10Index(all)

13

i10Index(since 2020)

13

Email

University Profile Page

Google Scholar

Ce Jin Skills & Research Interests

Theoretical computer science

Fine-grained Complexity

algorithms and data structures

Top articles of Ce Jin

A Faster Algorithm for Pigeonhole Equal Sums

arXiv preprint arXiv:2403.19117

2024/3/28

Ce Jin
Ce Jin

H-Index: 5

Hongxun Wu
Hongxun Wu

H-Index: 3

Streaming Algorithms for Connectivity Augmentation

arXiv preprint arXiv:2402.10806

2024/2/16

Constructive separations and their consequences

TheoretiCS

2024/2/15

An efficient algorithm for all-pairs bounded edge connectivity

Algorithmica

2024/1/22

Ce Jin
Ce Jin

H-Index: 5

A VLSI circuit model accounting for wire delay

2024

Ce Jin
Ce Jin

H-Index: 5

Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization

2024

Improved Roundtrip Spanners, Emulators, and Directed Girth Approximation

2024

Listing 6-Cycles

2024

Faster Algorithms for Text-to-Pattern Hamming Distances

2023/11/6

0-1 Knapsack in Nearly Quadratic Time

arXiv preprint arXiv:2308.04093

2023/8/8

Ce Jin
Ce Jin

H-Index: 5

Removing Additive Structure in 3SUM-Based Reductions

2023/6/2

Ce Jin
Ce Jin

H-Index: 5

Approximating Knapsack and Partition via Dense Subset Sums

2023

Ce Jin
Ce Jin

H-Index: 5

Quantum Speed-ups for String Synchronizing Sets, Longest Common Substring, and k-mismatch Matching

2023

Ce Jin
Ce Jin

H-Index: 5

Approximation algorithms and hardness for n-pairs shortest paths and all-nodes shortest cycles

2022/10/31

Tight dynamic problem lower bounds from generalized bmm and omv

2022/6/9

Ce Jin
Ce Jin

H-Index: 5

Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity

2022

Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions∗

2022

Near-optimal quantum algorithms for string problems

2022

Ce Jin
Ce Jin

H-Index: 5

Faster Algorithms for Bounded Tree Edit Distance

arXiv preprint arXiv:2105.02428

2021/5/6

Ce Jin
Ce Jin

H-Index: 5

An Improved Sketching Algorithm for Edit Distance

2021

See List of Professors in Ce Jin University(Massachusetts Institute of Technology)

Co-Authors

academic-engine