MST
2016
8 years 7 months ago
2016
MST
2016
8 years 7 months ago
2016
MST
2016
8 years 7 months ago
2016
Inspired by applications in parallel computing, we analyze the setting of work stealing in multithreaded computations. We obtain tight upper bounds on the number of steals when the...
MST
2016
8 years 7 months ago
2016
MST
2016
8 years 7 months ago
2016
MST
2016
8 years 7 months ago
2016
An orientation of an undirected graph G is a directed graph obtained by replacing each edge {u, v} of G by exactly one of the arcs (u, v) or (v, u). In the min-sum k-paths orienta...
MST
2016
8 years 7 months ago
2016
Abstract Some measures of randomness have been introduced for MartinL¨of randomness such as K-reducibility, C-reducibility and vL-reducibility. In this paper we study Schnorr-rand...