Reference Machines Require Non-linear Time to Maintain Disjoint Sets

Abstract

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… (More)
DOI: 10.1145/800105.803392

Topics

4 Figures and Tables

Cite this paper

@inproceedings{Tarjan1977ReferenceMR, title={Reference Machines Require Non-linear Time to Maintain Disjoint Sets}, author={Robert E. Tarjan}, booktitle={STOC}, year={1977} }