Data structural bootstrapping, linear path compression, and catenable heap ordered double ended queues

Authors:
A. L. Buchsbaum;R. Sundar;R. E. Tarjan
Affiliations:
Dept. of Comput. Sci., Princeton Univ., NC, USA;Dept. of Comput. Sci., Princeton Univ., NC, USA;Dept. of Comput. Sci., Princeton Univ., NC, USA
Venue:
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Year:
1992

Citing 0
Cited 1

De-amortization of Algorithms

COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The authors provide an efficient implementation of catenable mindeques. To prove that the resulting data structure achieves constant amortized time per operation, they consider order preserving path compression. They prove a linear bound on deque ordered spine-only path compression, a case of order persevering path compression employed by the data structure.