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

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 1992-October, Issue , 1992, Pages 40-49

  Buchsbaum, Adam L ^a   Sundar, Rajamani ^b   Tarjan, Robert E ^c  

^a PRINCETON UNIVERSITY   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c NEC LABORATORIES AMERICA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

CONSTANT AMORTIZED TIME; EFFICIENT IMPLEMENTATION; LINEAR BOUNDS; ORDER PRESERVING; PATH COMPRESSION;

DATA STRUCTURES;

EID: 85030055285     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.1992.267820     Document Type: Conference Paper

References (25)

1. P. K. Agarwal, A. Aggarwal, B. Aronov, S. R. Kosaraju, B. Schieber, and S. Suri. Computing external farthest neighbors for a simple polygon. Disc. Appl. Math., 31(2):97-111, 1991.
2. C. R. Aragon and R. G. Seidel. Randomized search trees. In Proc. 30th IEEE FOCS, pages 540-5, 1989.
3. H. Booth and J. Westbrook. Linear algorithms for analysis of minimum spanning and shortest path trees in planar graphs. Technical Report YALEU/DCS/TR-763, Yale U. Dept. of Comp. Sci., February 1990. To appear in Algorithmica.
4. A. L. Buchsbaum and R. E. Tarjan. Confluently persistent deques via data structural bootstrapping. Manuscript; submitted, 1992.
5. R. Cole and A. Siegel. River routing every which way, but loose. In Proc. 25th IEEE FOCS, pages 65-73, 1984.
6. G. Diehr and B. Faaland. Optimal pagination of B-trees with variable-length items. C. ACM, 27(3):241-7, 1984.
7. J. R. Driscoll, D. D. K. Sleator, and R. E. Tarjan. Fully persistent lists with catenation. In Proc. 2nd ACM-SIAM SODA, pages 89-99, 1991.
8. J. Francpn, G. Viennot, and J. Vuillemin. Description and analysis of an efficient priority queue representation. In Proc. 19th IEEE FOCS, pages 1-7, 1978.
9. G. N. Frederickson. Planar graph decomposition and all pairs shortest paths. J. ACM, 38(1):162-204, 1991.
10. H. Gajewska and R. E. Tarjan. Deques with heap order. IPL, 22(4):197-200, April 1986.
11. S. Hart and M. Sharir. Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes. Combinatorica, 6(2):151-77, 1986.
12. D. S. Hirschberg and L. L. Larmore. New applications of failure functions. J. ACM, 34(3):616-25, 1987.
13. S. R. Kosaraju. Real-time simulation of concatenate double-ended queues by double-ended queues. In Proc. 11th ACM STOC, pages 346-51, 1979.
14. L. L. Larmore and D. S. Hirschberg. Efficient optimal pagination of scrolls. C. ACM, 28(8):854-6, 1985.
15. M. Loebl and J. Nesetfil. Linearity and unprovability of set union problem strategies. In Proc. 20th ACM STOC, pages 360-6, 1988.
16. M. Loebl and J. Nesetfil. Postorder hierarchy for path compressions and set union. In Proc. 5th Ini'l. Mtg. of Young Computer Scientists, volume 381 of LNCS, pages 146-51. Springer-Verlag, 1988.
17. M. Loebl and J. Nesetfil. Linearity and unprovability of set union problem strategies I. Linearity of on line postorder. Technical Report 89-04, U. Chicago Dept. of Comp. Sci., April 1989.
18. J. M. Lucas. Postorder disjoint set union is linear. SIAM J. Comp., 19(5):868-82, October 1990.
19. E. M. McCreight. Pagination of B∗-trees with variable-length records. C. ACM, 20(9):670-4, 1977.
20. R. Sundar. Worst-case data structures for the priority queue with attrition. IPL, 31(2):69-75, 1989.
21. R. E. Tarjan. Data Structures and Network Algorithms. SIAM, Philadelphia, PA, 1983.
22. R. E. Tarjan. Amortized computational complexity. SIAM J. Alg. Disc. Meth., 6(2):306-18, 1985.
23. R. E. Tarjan and J. van Leeuwen. Worst-case analysis of set union algorithms. J. ACM, 31(2):245-81, 1984.
24. J. Vuillemin. A data structure for manipulating priority queues. C. ACM, 21(4):309-15, 1978.
25. J. Vuillemin. A unifying look at data structures. C. ACM, 23(4):229-39, 1980.