This paper describes a machine model intended to be useful in deriving realistic complexity bounds for tasks requiring list processing. As an example of the use of the model, the paper shows that any such machine requires non-linear time in the worst case to compute unions of disjoint sets on-line. All set union algorithms known to the author are instances of the model and are thus subject to the derived bound. One of the known algorithms achieves the bound to within a constant factor.
|Number of pages
|Proceedings of the Annual ACM Symposium on Theory of Computing
|Published - May 4 1977
|9th Annual ACM Symposium on Theory of Computing, STOC 1977 - Boulder, United States
Duration: May 2 1977 → May 4 1977
All Science Journal Classification (ASJC) codes