B. Zhang

activity

20182026

most citedSparsified Linear Programming for Zero-Sum Equilibrium Finding

3 citations · 4 across the 3 of their papers we have counts for

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2026

Polynomial-time computation of $ℓ_{p}$ -contraction fixed points for even $p$

Constantinos Daskalakis, Gabriele Farina, Brian Hu Zhang

We give a $poly (d, p, lo g (1/ ε))$ -time algorithm that computes an $ε$ -approximate fixed point of any $ℓ_{p}$ -nonexpansive map $f : X \to X$ , where $\mat…

cs.DS2019★ 1 cited

Cache-Friendly Search Trees; or, In Which Everything Beats std::set

Jeffrey Barratt, Brian Zhang

While a lot of work in theoretical computer science has gone into optimizing the runtime and space usage of data structures, such work very often neglects a very important componen…

Polynomial-time computation of ℓp​-contraction fixed points for even p

Cache-Friendly Search Trees; or, In Which Everything Beats std::set

Polynomial-time computation of $ℓ_{p}$ -contraction fixed points for even $p$