Huacheng Yu

According to our database, Huacheng Yu authored at least 43 papers between 2011 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Dynamic Dictionary with Subconstant Wasted Bits per Key.

Tianxiao Li, Jingxun Liang, Huacheng Yu, Renfei Zhou

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Sampling, Flowers and Communication.

Huacheng Yu, Wei Zhan

Electron. Colloquium Comput. Complex., 2023

Randomized vs. Deterministic Separation in Time-Space Tradeoffs of Multi-Output Functions.

Huacheng Yu, Wei Zhan

Electron. Colloquium Comput. Complex., 2023

Detecting TCP Packet Reordering in the Data Plane.

Yufei Zheng, Huacheng Yu, Jennifer Rexford

CoRR, 2023

Tight Cell-Probe Lower Bounds for Dynamic Succinct Dictionaries.

Tianxiao Li, Jingxun Liang, Huacheng Yu, Renfei Zhou

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Dynamic "Succincter".

Tianxiao Li, Jingxun Liang, Huacheng Yu, Renfei Zhou

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Super-Logarithmic Lower Bounds for Dynamic Graph Problems.

Kasper Green Larsen, Huacheng Yu

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

On Constructing Spanners from Random Gaussian Projections.

Sepehr Assadi, Michael Kapralov, Huacheng Yu

Proceedings of the Approximation, 2023

2022

Nearly Optimal Static Las Vegas Succinct Dictionary.

Huacheng Yu

SIAM J. Comput., June, 2022

Strong XOR Lemma for Communication with Bounded Rounds.

Huacheng Yu

Electron. Colloquium Comput. Complex., 2022

Characterizing the Multi-Pass Streaming Complexity for Solving Boolean CSPs Exactly.

Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena, Huacheng Yu

Electron. Colloquium Comput. Complex., 2022

Towards Multi-Pass Streaming Lower Bounds for Optimal Approximation of Max-Cut.

Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena, Zhao Song, Huacheng Yu

Electron. Colloquium Comput. Complex., 2022

On the amortized complexity of approximate counting.

Ishaq Aden-Ali, Yanjun Han, Jelani Nelson, Huacheng Yu

CoRR, 2022

Optimal Bounds for Approximate Counting.

Jelani Nelson, Huacheng Yu

Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Strong XOR Lemma for Communication with Bounded Rounds : (extended abstract).

Huacheng Yu

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021

Almost Optimal Super-Constant-Pass Streaming Lower Bounds for Reachability.

Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena, Zhao Song, Huacheng Yu

Electron. Colloquium Comput. Complex., 2021

Tight Distributed Sketching Lower Bound for Connectivity.

Huacheng Yu

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs.

Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Fast Software Cache Design for Network Appliances.

Dong Zhou, Huacheng Yu, Michael Kaminsky, David G. Andersen

Proceedings of the 2020 USENIX Annual Technical Conference, 2020

Lower bound for succinct range minimum query.

Mingmou Liu, Huacheng Yu

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

How to Store a Random Walk.

Emanuele Viola, Omri Weinstein, Huacheng Yu

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Faster Update Time for Turnstile Streaming Algorithms.

Josh Alman, Huacheng Yu

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Succinct Filters for Sets of Unknown Sizes.

Mingmou Liu, Yitong Yin, Huacheng Yu

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems.

Sepehr Assadi, Gillat Kol, Raghuvansh R. Saxena, Huacheng Yu

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

Pruning based Distance Sketches with Provable Guarantees on Random Graphs.

Hongyang Zhang, Huacheng Yu, Ashish Goel

Proceedings of the World Wide Web Conference, 2019

Optimal succinct rank data structure via approximate nonnegative tensor decomposition.

Huacheng Yu

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

2018

Matching Triangles and Basing Hardness on an Extremely Popular Conjecture.

Amir Abboud, Virginia Vassilevska Williams, Huacheng Yu

SIAM J. Comput., 2018

An improved combinatorial algorithm for Boolean matrix multiplication.

Huacheng Yu

Inf. Comput., 2018

Optimal Lower Bounds for Distributed and Streaming Spanning Forest Computation.

Jelani Nelson, Huacheng Yu

Electron. Colloquium Comput. Complex., 2018

2017

Techniques for proving data structure lower bounds.

Huacheng Yu

PhD thesis, 2017

Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds.

Kasper Green Larsen, Omri Weinstein, Huacheng Yu

Electron. Colloquium Comput. Complex., 2017

Cell-Probe Lower Bounds from Online Communication Complexity.

Josh Alman, Joshua R. Wang, Huacheng Yu

Electron. Colloquium Comput. Complex., 2017

Distance Labelings on Random Power Law Graphs.

Huacheng Yu, Hongyang Zhang

CoRR, 2017

Fillable arrays with constant time operations and a single bit of redundancy.

Jacob Teo Por Loong, Jelani Nelson, Huacheng Yu

CoRR, 2017

DecreaseKeys are expensive for external memory priority queues.

Kasper Eenberg, Kasper Green Larsen, Huacheng Yu

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Beating Brute Force for Systems of Polynomial Equations over Finite Fields.

Daniel Lokshtanov, Ramamohan Paturi, Suguru Tamaki, R. Ryan Williams, Huacheng Yu

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

Amortized Dynamic Cell-Probe Lower Bounds from Four-Party Communication.

Omri Weinstein, Huacheng Yu

Electron. Colloquium Comput. Complex., 2016

Cell-probe lower bounds for dynamic problems via a new communication model.

Huacheng Yu

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

2015

Finding Four-Node Subgraphs in Triangle Time.

Virginia Vassilevska Williams, Joshua R. Wang, Richard Ryan Williams, Huacheng Yu

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

More Applications of the Polynomial Method to Algorithm Design.

Amir Abboud, Richard Ryan Williams, Huacheng Yu

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

Finding orthogonal vectors in discrete structures.

Ryan Williams, Huacheng Yu

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

2013

On a conjecture of Butler and Graham.

Tengyu Ma, Xiaoming Sun, Huacheng Yu

Des. Codes Cryptogr., 2013

2011

A New Variation of Hat Guessing Games.

Tengyu Ma, Xiaoming Sun, Huacheng Yu

Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011