Hengjie Zhang

About Hengjie Zhang

Hengjie Zhang, With an exceptional h-index of 7 and a recent h-index of 7 (since 2020), a distinguished researcher at Columbia University in the City of New York, specializes in the field of Graph theory, approximation algorithm.

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

Generalizations of Matrix Multiplication can solve the Light Bulb Problem

Sub-quadratic (1+\eps)-approximate Euclidean Spanners, with Applications

A Dynamic Fast Gaussian Transform

Tight revenue gaps among multi-unit mechanisms

A faster algorithm for solving general lps

Near-optimal distributed triangle enumeration via expander decompositions

Space-efficient interior point method, with applications to linear programming and maximum weight bipartite matching

Faster dynamic matrix inverse for faster lps

Hengjie Zhang Information

University

Position

___

Citations(all)

260

Citations(since 2020)

259

Cited By

76

hIndex(all)

7

hIndex(since 2020)

7

i10Index(all)

7

i10Index(since 2020)

7

Email

University Profile Page

Google Scholar

Hengjie Zhang Skills & Research Interests

Graph theory

approximation algorithm

Top articles of Hengjie Zhang

Generalizations of Matrix Multiplication can solve the Light Bulb Problem

2023/11/6

Sub-quadratic (1+\eps)-approximate Euclidean Spanners, with Applications

arXiv preprint arXiv:2310.05315

2023/10/9

A Dynamic Fast Gaussian Transform

arXiv preprint arXiv:2202.12329

2022/2/24

A faster algorithm for solving general lps

2021/6/15

Near-optimal distributed triangle enumeration via expander decompositions

Journal of the ACM (JACM)

2021/5/13

Space-efficient interior point method, with applications to linear programming and maximum weight bipartite matching

2023

Faster dynamic matrix inverse for faster lps

arXiv preprint arXiv:2004.07470

2020/4/16

See List of Professors in Hengjie Zhang University(Columbia University in the City of New York)

Co-Authors

academic-engine