@inproceedings{391ebfa293ea41f9a93bf7dcd2344eeb,
title = "Data structural bootstrapping, linear path compression, and catenable heap ordered double ended queues",
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.",
author = "Buchsbaum, {Adam L.} and Rajamani Sundar and Tarjan, {Robert E.}",
note = "Publisher Copyright: {\textcopyright} 1992 IEEE.; 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992 ; Conference date: 24-10-1992 Through 27-10-1992",
year = "1992",
doi = "10.1109/SFCS.1992.267820",
language = "English (US)",
series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",
publisher = "IEEE Computer Society",
pages = "40--49",
booktitle = "Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992",
address = "United States",
}