What people are saying - Write a review
We haven't found any reviews in the usual places.
Priority Search Trees Edward M McCreight
On the Complexity of Maintaining Partial Sums Andrew C Yao
8 other sections not shown
Other editions - View all
algorithm applied assume begin bound called cell circle column communication complexity components computation condition connected consider consists constant construction contains corresponding data structure defined definition denote determine directed edge elements equal example execution exists fact factor finite fixed function give given graph Hence holds implies initial input insertion integer intersection interval least Lemma length linear lower bound machine Mathematics node Note O(log obtain operations optimal pair parallel path performance polygon polynomial position possible present problem procedure processors Proof prove query reduced relation represent result root satisfies schedule Science segment sequence shown SIAM simple simulation single space step strings structure Suppose Theorem Theory tree University vertex vertices weight