Huacheng Yu

From MaRDI portal
Person:369428

Available identifiers

zbMath Open yu.huachengMaRDI QIDQ369428

List of research outcomes





PublicationDate of PublicationType
On constructing spanners from random Gaussian projections2025-01-14Paper
Dynamic dictionary with subconstant wasted bits per key2024-11-28Paper
Characterizing the multi-pass streaming complexity for solving Boolean CSPs exactly2024-09-25Paper
Towards multi-pass streaming lower bounds for optimal approximation of \textsf{Max-Cut}2024-05-14Paper
https://portal.mardi4nfdi.de/entity/Q61473672024-01-15Paper
Almost optimal super-constant-pass streaming lower bounds for reachability2023-11-14Paper
Nearly Optimal Static Las Vegas Succinct Dictionary2022-05-31Paper
How to Store a Random Walk2021-02-02Paper
Faster Update Time for Turnstile Streaming Algorithms2021-02-02Paper
Lower bound for succinct range minimum query2021-01-19Paper
Nearly optimal static Las Vegas succinct dictionary2021-01-19Paper
Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds2020-10-29Paper
Optimal succinct rank data structure via approximate nonnegative tensor decomposition2020-01-30Paper
Nearly Optimal Static Las Vegas Succinct Dictionary2019-11-04Paper
Optimal Lower Bounds for Distributed and Streaming Spanning Forest Computation2019-10-15Paper
Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds2019-08-22Paper
Cell-probe lower bounds from online communication complexity2019-08-22Paper
Finding orthogonal vectors in discrete structures2019-06-20Paper
Beating Brute Force for Systems of Polynomial Equations over Finite Fields2018-07-16Paper
Matching Triangles and Basing Hardness on an Extremely Popular Conjecture2018-07-04Paper
An improved combinatorial algorithm for Boolean matrix multiplication2018-06-14Paper
Pruning based Distance Sketches with Provable Guarantees on Random Graphs2017-12-22Paper
More Applications of the Polynomial Method to Algorithm Design2017-10-05Paper
Finding Four-Node Subgraphs in Triangle Time2017-10-05Paper
Cell-probe lower bounds for dynamic problems via a new communication model2017-09-29Paper
DecreaseKeys are expensive for external memory priority queues2017-08-17Paper
An improved combinatorial algorithm for Boolean matrix multiplication2015-10-27Paper
Matching Triangles and Basing Hardness on an Extremely Popular Conjecture2015-08-21Paper
On a conjecture of Butler and Graham2013-09-24Paper
A New Variation of Hat Guessing Games2011-08-17Paper

Research outcomes over time

This page was built for person: Huacheng Yu