Huacheng Yu
where else to find them
what they talk about
where they keep going back
no series more than once — all 3 in the filters
on a stage with
- David G. Andersenonce
- Dmitry Paramonovonce
- Dong Zhouonce
all 6 in the filters
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Characterizing the Multi-Pass Streaming Complexity for Solving Boolean CSPs Exactly | ITCS 2023 | 2023-01-10 |
Claim: p pass streaming algorithms need space Theta(n^{deg(f)}) to compute Max‑CSPf exactly where deg(f) is f's multilinear polynomial degree and p is… | ||
| Fast Software Cache Design for Network Appliances | USENIX ATC '20 | 2020-07-15 |
Replaces Open vSwitch’s microflow table with a new table layout and eviction policy: Bounded Linear Probing lets keys spill into the next bucket to boost… | ||
| Optimal Lower Bounds for Distributed and Streaming Spanning Forest Computation | Interactive Complexity 2018 | 2018-10-15 |
Fully dynamic streaming and simultaneous-distributed spanning forest problems get tight space and communication lower bounds: randomized linear AGM sketch… | ||
| nothing matches | ||