The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
The intrinsically exponential complexity of the circularity problem for attribute grammars
Communications of the ACM
An improved equivalence algorithm
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
On the average behavior of set merging algorithms (Extended Abstract)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
A generalization and proof of the Aanderaa-Rosenberg conjecture
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
REAL-TIME SIMULATION OF MULTIDIMENSIONAL TURING MACHINES BY STORAGE MODIFICATION MACHINES
REAL-TIME SIMULATION OF MULTIDIMENSIONAL TURING MACHINES BY STORAGE MODIFICATION MACHINES
SUPER-EXPONENTIAL COMPLEXITY OF PRESBURGER ARITHMETIC
SUPER-EXPONENTIAL COMPLEXITY OF PRESBURGER ARITHMETIC
Applications of path compression on balanced trees.
Applications of path compression on balanced trees.
Solving path problems on directed graphs.
Solving path problems on directed graphs.
Complexity of monotone networks for computing conjunctions
Complexity of monotone networks for computing conjunctions
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Straight-line program length as a parameter for complexity measures
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
A near optimal data structure for a type of range query problem
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Evolving graph-structures and their implicit computational complexity
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
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.