What people are saying - Write a review
We haven't found any reviews in the usual places.
Least Cost Paths in Networks
A High Level Programming Language
18 other sections not shown
Other editions - View all
0(n log amortized analysis amortized cost analysis arity array average balanced trees BB[a]-trees behaviour binary search tree binary tree bucket coin tosses computation Concatenate constant construct-tree D-trees data structure decision tree defined denote depth discuss double rotation dynamic edge element example executed extendible hashing fact function h fusing goto hash table Heapsort height-balanced trees hence i-th induction initial input insertions and deletions instruction integer interpolation search j-th keys labelled leaf lemma linear lists Llog log log lower bounds matrix mb(T Mergesort method Note number of leaves number of nodes O(log obtain operation Access perfect hash function permutation pointer polynomial problem proof of theorem pushdown store queue Quicksort randomized algorithm rebalancing operations red-black trees root root balance S[next splay trees split step storage locations subproblems subtree tion tree for set union-find unit cost measure weighted path length worst