This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
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...
Charles E. Leiserson, Tao B. Schardl, Warut Suksom...
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...
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...