We consider the implementation of abstract data types for the static objects: binary tree, rooted ordered tree, and a balanced sequence of parentheses.Expand

We present an algorithm that deterministically finds (in particular) all categories having a frequency above 1/(m+1) using m counters, which we prove is best possible in the worst case.Expand

When selecting from, or sorting, a file stored on a read-only tape and the internal storage is rather limited, several passes of the input tape may be required.Expand

When selecting from, or sorting, a file stored on a read-only tape and the internal storage is rather limited, several passes of the input tape may be required to select the Kth highest of N inputs.Expand

We consider heuristics which attempt to maintain a binary search tree in a near optimal form, assuming that elements are requested with fixed, but unknown, independent probabilities.Expand

We consider the implementation of abstract data types for the static objects: binary tree, rooted ordered tree and balanced parenthesis expression.Expand

Thank you for downloading the computational complexity of algebraic and numeric problems elsevier computer science library theory of computation series 1, but end up in harmful downloads.Expand