Browsing Department of Computer and Information Science by Subject "average dilation"

Navigation

Display Options

Results

  • Lo, V.; Rajopadhye, S. V.; Gupta, S.; Keldsen, D.; Mohamed, M.; Telle, J. (University of Oregon, 1990-01-19)
    In this paper, we identify the binomial tree as an ideal computation structure for parallel divide-and-conquer algorithms. We show its superiority to the classic full binary tree structure with respect to speedup and ...

Search Scholars' Bank


Advanced Search

Browse

My Account

Statistics