# Upper Bounds on Number of Steals in Rooted Trees

arXiv: https://arxiv.org/abs/1706.03184 · HTML: https://mlsanity.com/paper/1706.03184/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 10 Jun 2017.

## Built on by (most cited first, 1 of 1)

- [FaiREO: User Group Fairness for Equality of Opportunity in Course Recommendation](https://mlsanity.com/paper/2109.05931/) (2021)

## Abstract (arXiv)

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 computation can be modeled by rooted trees. In particular, we show that if the computation with n processors starts with one processor having a complete k-ary tree of height h (and the remaining n-1 processors having nothing), the maximum possible number of steals is sumi=1n(k-1)ibinomhi.