Upper Bounds on Number of Steals in Rooted Trees. Leiserson, C. E., Schardl, T. B., & Suksompong, W. Theory of Computing Systems, 58(2):223–240, February, 2016.
bibtex   
@article{LeisersonScSu16,
    author = {Charles E. Leiserson and Tao B. Schardl and Warut Suksompong},
    title = {Upper Bounds on Number of Steals in Rooted Trees},
    journal = {Theory of Computing Systems},
    year = {2016},
    volume = {58},
    number = {2},
    pages = {223--240},
    month = {February},
    group = {Supertech},
    localfile = {LeisersonScSu16},
}

Downloads: 0