29 citations · 45 across the 10 of their papers we have counts for
4 papers · 1 filter
Policy Regret in Repeated Games
Raman Arora, Michael Dinitz, Teodor V. Marinov +1
The notion of \emph{policy regret} in online learning is a well defined? performance measure for the common scenario of adaptive adversaries, which more traditional quantities such…
Massively Parallel Approximate Distance Sketches
Michael Dinitz, Yasamin Nazari
Data structures that allow efficient distance estimation (distance oracles, distance sketches, etc.) have been extensively studied, and are particularly well studied in centralized…
Distributed Algorithms for Minimum Degree Spanning Trees
Michael Dinitz, Magnús M. Halldórsson, Calvin Newport
The minimum degree spanning tree (MDST) problem requires the construction of a spanning tree for graph with vertices, such that the maximum degree of is t…
Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network
Amy Babay, Michael Dinitz, Zeyu Zhang
We consider the Shallow-Light Steiner Network problem from a fixed-parameter perspective. Given a graph , a distance bound , and pairs of vertices $(s_1,t_1),\cdots,(s_p,…