Reference machines require non-linear time to maintain disjoint sets

Authors:
Robert E Tarjan
Affiliations:
-
Venue:
Reference machines require non-linear time to maintain disjoint sets
Year:
1977

Citing 0
Cited 3

From reaction-diffusion to Physarum computing

Natural Computing: an international journal
Programmable reconfiguration of Physarum machines

Natural Computing: an international journal
Encapsulating reaction-diffusion computers

MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality

Quantified Score

Hi-index	0.00

Visualization

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 me 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.