Gabriele Farina

activity

20152026

most citedNear-Optimal No-Regret Learning for Correlated Equilibria in Multi-Player General-Sum Games

17 citations · 187 across the 55 of their papers we have counts for

collaborators

Showing cs.DSShow all

3 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.DS2015★ 1 cited

A linear time algorithm to compute the impact of all the articulation points

Gabriele Farina

The articulation points of an undirected connected graphs are those vertices whose removal increases the number of connected components of the graph, i.e. the vertices whose remova…

cs.DS2015

Dynamic subtrees queries revisited: the Depth First Tour Tree

Gabriele Farina, Luigi Laura

In the dynamic tree problem the goal is the maintenance of an arbitrary n-vertex forest, where the trees are subject to joining and splitting by, respectively, adding and removing…

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

A linear time algorithm to compute the impact of all the articulation points

Dynamic subtrees queries revisited: the Depth First Tour Tree

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