default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHuacheng Yu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Elena Gribelyuk
, Pachara Sawettamalya, Hongxun Wu, Huacheng Yu:
Simple & Optimal Quantile Sketch: Combining Greenwald-Khanna with Khanna-Greenwald. Proc. ACM Manag. Data 2(2): 109 (2024)- [c38]Ishaq Aden-Ali, Yanjun Han, Jelani Nelson, Huacheng Yu:
On the Amortized Complexity of Approximate Counting. APPROX/RANDOM 2024: 33:1-33:17 - [c37]Huacheng Yu, Wei Zhan:
Randomized vs. Deterministic Separation in Time-Space Tradeoffs of Multi-Output Functions. ITCS 2024: 99:1-99:15 - [c36]Huacheng Yu, Wei Zhan:
Sampling, Flowers and Communication. ITCS 2024: 100:1-100:11 - [c35]Tianxiao Li, Jingxun Liang, Huacheng Yu, Renfei Zhou:
Dynamic Dictionary with Subconstant Wasted Bits per Key. SODA 2024: 171-207 - [i41]Elena Gribelyuk, Honghao Lin, David P. Woodruff, Huacheng Yu, Samson Zhou:
A Strong Separation for Adversarially Robust ℓ0 Estimation for Linear Sketches. CoRR abs/2409.16153 (2024) - 2023
- [c34]Sepehr Assadi, Michael Kapralov, Huacheng Yu:
On Constructing Spanners from Random Gaussian Projections. APPROX/RANDOM 2023: 57:1-57:18 - [c33]Kasper Green Larsen, Huacheng Yu:
Super-Logarithmic Lower Bounds for Dynamic Graph Problems. FOCS 2023: 1589-1604 - [c32]Tianxiao Li, Jingxun Liang, Huacheng Yu, Renfei Zhou:
Dynamic "Succincter". FOCS 2023: 1715-1733 - [c31]Tianxiao Li, Jingxun Liang, Huacheng Yu, Renfei Zhou:
Tight Cell-Probe Lower Bounds for Dynamic Succinct Dictionaries. FOCS 2023: 1842-1862 - [c30]Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Huacheng Yu:
Characterizing the Multi-Pass Streaming Complexity for Solving Boolean CSPs Exactly. ITCS 2023: 80:1-80:15 - [c29]Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu:
Towards Multi-Pass Streaming Lower Bounds for Optimal Approximation of Max-Cut. SODA 2023: 878-924 - [i40]Yufei Zheng, Huacheng Yu, Jennifer Rexford:
Detecting TCP Packet Reordering in the Data Plane. CoRR abs/2301.00058 (2023) - [i39]Kasper Green Larsen, Huacheng Yu:
Super-Logarithmic Lower Bounds for Dynamic Graph Problems. CoRR abs/2304.08745 (2023) - [i38]Tianxiao Li, Jingxun Liang, Huacheng Yu, Renfei Zhou:
Tight Cell-Probe Lower Bounds for Dynamic Succinct Dictionaries. CoRR abs/2306.02253 (2023) - [i37]Huacheng Yu, Wei Zhan:
Randomized vs. Deterministic Separation in Time-Space Tradeoffs of Multi-Output Functions. CoRR abs/2306.15817 (2023) - [i36]Tianxiao Li, Jingxun Liang, Huacheng Yu, Renfei Zhou:
Dynamic "Succincter". CoRR abs/2309.12950 (2023) - [i35]Tianxiao Li, Jingxun Liang, Huacheng Yu, Renfei Zhou:
Dynamic Dictionary with Subconstant Wasted Bits per Key. CoRR abs/2310.20536 (2023) - [i34]Huacheng Yu, Wei Zhan:
Randomized vs. Deterministic Separation in Time-Space Tradeoffs of Multi-Output Functions. Electron. Colloquium Comput. Complex. TR23 (2023) - [i33]Huacheng Yu, Wei Zhan:
Sampling, Flowers and Communication. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j5]Huacheng Yu:
Nearly Optimal Static Las Vegas Succinct Dictionary. SIAM J. Comput. 51(3): 20-174 (2022) - [c28]Huacheng Yu:
Strong XOR Lemma for Communication with Bounded Rounds : (extended abstract). FOCS 2022: 1186-1192 - [c27]Jelani Nelson, Huacheng Yu:
Optimal Bounds for Approximate Counting. PODS 2022: 119-127 - [i32]Huacheng Yu:
Strong XOR Lemma for Communication with Bounded Rounds. CoRR abs/2208.11152 (2022) - [i31]Sepehr Assadi, Michael Kapralov, Huacheng Yu:
On Constructing Spanners from Random Gaussian Projections. CoRR abs/2209.14775 (2022) - [i30]Ishaq Aden-Ali, Yanjun Han, Jelani Nelson, Huacheng Yu:
On the amortized complexity of approximate counting. CoRR abs/2211.03917 (2022) - [i29]Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena, Zhao Song, Huacheng Yu:
Towards Multi-Pass Streaming Lower Bounds for Optimal Approximation of Max-Cut. Electron. Colloquium Comput. Complex. TR22 (2022) - [i28]Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena, Huacheng Yu:
Characterizing the Multi-Pass Streaming Complexity for Solving Boolean CSPs Exactly. Electron. Colloquium Comput. Complex. TR22 (2022) - [i27]Huacheng Yu:
Strong XOR Lemma for Communication with Bounded Rounds. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c26]Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu:
Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs. ICALP 2021: 52:1-52:19 - [c25]Huacheng Yu:
Tight Distributed Sketching Lower Bound for Connectivity. SODA 2021: 1856-1873 - [c24]Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena, Zhao Song, Huacheng Yu:
Almost optimal super-constant-pass streaming lower bounds for reachability. STOC 2021: 570-583 - [i26]Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena, Zhao Song, Huacheng Yu:
Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs. CoRR abs/2102.11251 (2021) - [i25]Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena, Zhao Song, Huacheng Yu:
Almost Optimal Super-Constant-Pass Streaming Lower Bounds for Reachability. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j4]Kasper Green Larsen, Omri Weinstein, Huacheng Yu:
Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds. SIAM J. Comput. 49(5) (2020) - [c23]Sepehr Assadi, Gillat Kol, Raghuvansh R. Saxena, Huacheng Yu:
Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems. FOCS 2020: 354-364 - [c22]Mingmou Liu, Yitong Yin, Huacheng Yu:
Succinct Filters for Sets of Unknown Sizes. ICALP 2020: 79:1-79:19 - [c21]Emanuele Viola, Omri Weinstein, Huacheng Yu:
How to Store a Random Walk. SODA 2020: 426-445 - [c20]Josh Alman, Huacheng Yu:
Faster Update Time for Turnstile Streaming Algorithms. SODA 2020: 1803-1813 - [c19]Huacheng Yu:
Nearly optimal static Las Vegas succinct dictionary. STOC 2020: 1389-1401 - [c18]Mingmou Liu, Huacheng Yu:
Lower bound for succinct range minimum query. STOC 2020: 1402-1415 - [c17]Dong Zhou, Huacheng Yu, Michael Kaminsky, David G. Andersen:
Fast Software Cache Design for Network Appliances. USENIX ATC 2020: 657-671 - [i24]Mingmou Liu, Huacheng Yu:
Lower Bound for Succinct Range Minimum Query. CoRR abs/2004.05738 (2020) - [i23]Mingmou Liu, Yitong Yin, Huacheng Yu:
Succinct Filters for Sets of Unknown Sizes. CoRR abs/2004.12465 (2020) - [i22]Huacheng Yu:
Tight Distributed Sketching Lower Bound for Connectivity. CoRR abs/2007.12323 (2020) - [i21]Sepehr Assadi, Gillat Kol, Raghuvansh R. Saxena, Huacheng Yu:
Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems. CoRR abs/2009.03038 (2020) - [i20]Jelani Nelson, Huacheng Yu:
Optimal bounds for approximate counting. CoRR abs/2010.02116 (2020)
2010 – 2019
- 2019
- [c16]Jelani Nelson, Huacheng Yu:
Optimal Lower Bounds for Distributed and Streaming Spanning Forest Computation. SODA 2019: 1844-1860 - [c15]Huacheng Yu:
Optimal succinct rank data structure via approximate nonnegative tensor decomposition. STOC 2019: 955-966 - [c14]Hongyang Zhang, Huacheng Yu, Ashish Goel:
Pruning based Distance Sketches with Provable Guarantees on Random Graphs. WWW 2019: 2301-2311 - [i19]Emanuele Viola, Omri Weinstein, Huacheng Yu:
How to Store a Random Walk. CoRR abs/1907.10874 (2019) - [i18]Huacheng Yu:
Nearly Optimal Static Las Vegas Succinct Dictionary. CoRR abs/1911.01348 (2019) - [i17]Josh Alman, Huacheng Yu:
Faster Update Time for Turnstile Streaming Algorithms. CoRR abs/1911.01351 (2019) - 2018
- [j3]Huacheng Yu:
An improved combinatorial algorithm for Boolean matrix multiplication. Inf. Comput. 261: 240-247 (2018) - [j2]Amir Abboud, Virginia Vassilevska Williams, Huacheng Yu:
Matching Triangles and Basing Hardness on an Extremely Popular Conjecture. SIAM J. Comput. 47(3): 1098-1122 (2018) - [c13]Kasper Green Larsen, Omri Weinstein, Huacheng Yu:
Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds. ITA 2018: 1-40 - [c12]Kasper Green Larsen, Omri Weinstein, Huacheng Yu:
Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds. STOC 2018: 978-989 - [c11]Josh Alman, Joshua R. Wang, Huacheng Yu:
Cell-probe lower bounds from online communication complexity. STOC 2018: 1003-1012 - [i16]Jelani Nelson, Huacheng Yu:
Optimal Lower Bounds for Distributed and Streaming Spanning Forest Computation. CoRR abs/1807.05135 (2018) - [i15]Huacheng Yu:
Optimal Succinct Rank Data Structure via Approximate Nonnegative Tensor Decomposition. CoRR abs/1811.02078 (2018) - [i14]Jelani Nelson, Huacheng Yu:
Optimal Lower Bounds for Distributed and Streaming Spanning Forest Computation. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [b1]Huacheng Yu:
Techniques for proving data structure lower bounds. Stanford University, USA, 2017 - [c10]Daniel Lokshtanov, Ramamohan Paturi, Suguru Tamaki, R. Ryan Williams, Huacheng Yu:
Beating Brute Force for Systems of Polynomial Equations over Finite Fields. SODA 2017: 2190-2202 - [c9]Kasper Eenberg, Kasper Green Larsen, Huacheng Yu:
DecreaseKeys are expensive for external memory priority queues. STOC 2017: 1081-1093 - [i13]Kasper Green Larsen, Omri Weinstein, Huacheng Yu:
Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds. CoRR abs/1703.03575 (2017) - [i12]Josh Alman, Joshua R. Wang, Huacheng Yu:
Cell-Probe Lower Bounds from Online Communication Complexity. CoRR abs/1704.06185 (2017) - [i11]Jacob Teo Por Loong, Jelani Nelson, Huacheng Yu:
Fillable arrays with constant time operations and a single bit of redundancy. CoRR abs/1709.09574 (2017) - [i10]Huacheng Yu, Hongyang Zhang:
Distance Labelings on Random Power Law Graphs. CoRR abs/1712.08709 (2017) - [i9]Josh Alman, Joshua R. Wang, Huacheng Yu:
Cell-Probe Lower Bounds from Online Communication Complexity. Electron. Colloquium Comput. Complex. TR17 (2017) - [i8]Kasper Green Larsen, Omri Weinstein, Huacheng Yu:
Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c8]Omri Weinstein, Huacheng Yu:
Amortized Dynamic Cell-Probe Lower Bounds from Four-Party Communication. FOCS 2016: 305-314 - [c7]Huacheng Yu:
Cell-probe lower bounds for dynamic problems via a new communication model. STOC 2016: 362-374 - [i7]Omri Weinstein, Huacheng Yu:
Amortized Dynamic Cell-Probe Lower Bounds from Four-Party Communication. CoRR abs/1604.03030 (2016) - [i6]Kasper Eenberg, Kasper Green Larsen, Huacheng Yu:
DecreaseKeys are Expensive for External Memory Priority Queues. CoRR abs/1611.00911 (2016) - [i5]Omri Weinstein, Huacheng Yu:
Amortized Dynamic Cell-Probe Lower Bounds from Four-Party Communication. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c6]Huacheng Yu:
An Improved Combinatorial Algorithm for Boolean Matrix Multiplication. ICALP (1) 2015: 1094-1105 - [c5]Amir Abboud, Richard Ryan Williams, Huacheng Yu:
More Applications of the Polynomial Method to Algorithm Design. SODA 2015: 218-230 - [c4]Virginia Vassilevska Williams, Joshua R. Wang, Richard Ryan Williams, Huacheng Yu:
Finding Four-Node Subgraphs in Triangle Time. SODA 2015: 1671-1680 - [c3]Amir Abboud, Virginia Vassilevska Williams, Huacheng Yu:
Matching Triangles and Basing Hardness on an Extremely Popular Conjecture. STOC 2015: 41-50 - [i4]Huacheng Yu:
An Improved Combinatorial Algorithm for Boolean Matrix Multiplication. CoRR abs/1505.06811 (2015) - [i3]Huacheng Yu:
Cell-probe Lower Bounds for Dynamic Problems via a New Communication Model. CoRR abs/1512.01293 (2015) - 2014
- [c2]Ryan Williams, Huacheng Yu:
Finding orthogonal vectors in discrete structures. SODA 2014: 1867-1877 - 2013
- [j1]Tengyu Ma, Xiaoming Sun, Huacheng Yu:
On a conjecture of Butler and Graham. Des. Codes Cryptogr. 69(3): 265-274 (2013) - 2011
- [c1]Tengyu Ma, Xiaoming Sun, Huacheng Yu:
A New Variation of Hat Guessing Games. COCOON 2011: 616-626 - [i2]Tengyu Ma, Xiaoming Sun, Huacheng Yu:
A New Variation of Hat Guessing Games. CoRR abs/1101.0869 (2011) - [i1]Tengyu Ma, Xiaoming Sun, Huacheng Yu:
On a Conjecture of Butler and Graham. CoRR abs/1107.2027 (2011)
Coauthor Index
aka: Raghuvansh Saxena
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-10-17 20:25 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:
