| 
|
Quote: constant-time insertion and find-min for priority queues; black box trades delete time for insert time
Topic:
search algorithms
Quotation Skeleton
We present a simple black box that … transforms [a priority queue] Q into a priority queue Q* … [where x is "worst-case", "expected", or "amortized"]. … [p. 103] The essential result of this note is … in scenarios where we have more insert than … Google-1 Google-2
Copyright clearance needed for quotation.
Topic: search algorithms (40 items)