1 citations · 1 across the 6 of their papers we have counts for
2 papers
cs.CC2022
Strong XOR Lemma for Communication with Bounded Rounds
Huacheng Yu
In this paper, we prove a strong XOR lemma for bounded-round two-player randomized communication. For a function , the -fold X…
cs.DS2016
DecreaseKeys are Expensive for External Memory Priority Queues
Kasper Eenberg, Kasper Green Larsen, Huacheng Yu
One of the biggest open problems in external memory data structures is the priority queue problem with DecreaseKey operations. If only Insert and ExtractMin operations need to be s…