1 / 4

Λίστα Εργασιών

Explore fast algorithms for finding nearest common ancestors, dynamic tree manipulations, and persistent data structures. Learn about linear-time pointer algorithms, dynamic sequence maintenance, and simplifying tree pattern matching.

njustin
Download Presentation

Λίστα Εργασιών

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Λίστα Εργασιών Data Structures for Tree Manipulation D. Harel and R.E. Tarjan. Fast Algorithms for finding nearest common ancestors. SIAM J. Computing , 13(2):338-355, 1984. A.K. Tsakalidis. The Nearest Common Ancestor in a Dynamic Tree, Acta Informatica 25, 37-54 (1988). S. Alstrup and M. Thorup, Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees, Journal of Algorithms, 35(2): 169-188 (2000) A.L. Buchsbaum, H. Kaplan, A. Rogers and J.R. Westbrook, Linear-time pointer machine algorithms for lca's, mst verification, and dominators, In Annual ACM Symposium on the Theory of Computing (STOC), 30, 1998. R. Cole and R. Hariharan, Dynamic lca queries on trees, In Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 10, 1999. Rajamani Sundar, Robert Endre Tarjan: Unique Binary Search Tree Representations and Equality-testing of Sets and Sequences STOC 1990: 18-25 Kurt Mehlhorn, R. Sundar, Christian Uhrig: Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time. Algorithmica 17(2): 183-198 (1997). Richard Cole, Ramesh Hariharan: Tree Pattern Matching to Subset Matching in Linear Time. SIAM J. Comput. 32(4): 1056-1066 (2003)

  2. Persistence J. R. Driscoll, N. Sarnak, D. Sleator, and R. Tarjan. Making data structures persistent. J. of Computer and System Science, 38:86-124, 1989. J. Driscoll, D. Sleator, and R. Tarjan. Fully persistent lists with catenation. Journal of the ACM , 41(5):943-959, 1994. L. Buchsbaum and R. E. Tarjan. Confluently persistent deques via data structural bootstrapping. J. of Algorithms , 18:513-547, 1995. R. Sundar A. L. Buchsbaum and R. E. Tarjan. Data structural bootstrapping, linear path compression, and catenable heap ordered double ended queues. SIAM J. Computing , 24(6):1190-1206, 1995. H. Kaplan and R. E. Tarjan. Persistent lists with catenation via recursive slow-down. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing , pages 93-102. ACM Press, 1995. H. Kaplan and R. E. Tarjan. Purely functional representations of catenable sorted lists. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing , pages 202-211. ACM Press , 1996. A. Fiat, H. Kaplan, Making Data Structures Confluently Persistent, ACM SODA 2001.

  3. Search Trees and Priority Queues A.K. Tsakalidis, AVL-trees for localized search. Information and Control , 67:173-194, 1985. R. Fleischer, A simple balanced search tree with O(1) worst-case update time. International Journal of Foundations of Computer Science, 7:137-149, 1996 G. S. Brodal. Finger Search Trees with Constant Insertion Time. In Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 540-549, 1998.  M. A. Bender and M. Farach-Colton. The Level Ancestor Problem Simplified. LATIN, pages 508-515, 2002. M. A. Bender, R. Cole, E. Demaine, M. Farach-Colton, and J. Zito. Two Simplified Algorithms for Maintaining Order in a List. Proceedings of the 10th European Symposium on Algorithms (ESA), pages 152-164, 2002. Daniel Dominic Sleator and Robert Endre Tarjan. Self-adjusting binary search trees. Journal of the ACM , 32(3):652-686, July 1985. John Iacono, Alternatives to Splay Trees with O(logn) Worst-Case Access Times, ACM/SIAM SODA 2001, 516-522. Mihai Bădoiu and Erik D. Demaine, A Simplified and Dynamic Unified Structure,  in Proceedings of the 6th Latin American Symposium on Theoretical Informatics (LATIN 2004), Lecture Notes in Computer Science, volume 2976, Buenos Aires, Argentina, April 5-8, 2004, pages 466-473. D.E. Demaine, D. Harmon, J. Iacono, M. Pătraşcu, (2004), Dynamic Optimality— Almost, IEEE Symp. on the Foundations of Computer Science, 45th, Rome, Italy, Oct. 17–19, pp. 484–490.

  4. RAM Algorithms M.L. Fredman and D.E. Willard. Surpassing the information theoretic bound with fusion trees. Journal of Computer and System Sciences ,  47:424-436, 1993. M.L. Fredman and D.E. Willard. Trans-dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths, Journal of Computer and System Sciences , 48:533-551, 1994. H. Gabow, R. Tarjan A Linear-Time Algorithm for a Special Case of Disjoint Set Union Journal of Computer and System Sciences 30(209-220) 1985 . Arne Andersson, Mikkel Thorup, Dynamic Ordered Sets with Exponential Search Tree, ACM STOC 2000, pp.335-342. A. Andersson. Faster deterministic sorting and searching in linear space, Proc. 37th FOCS, pages 135–141, 1996. Yijie Han: Improved fast integer sorting in linear space. SODA 2001: 793-796 Yijie Han: Deterministic sorting in O(nloglogn) time and linear space. J. Algorithms 50(1): 96-105 (2004) Ran Mendelson, Mikkel Thorup, Uri Zwick: Meldable RAM priority queues and minimum directed spanning trees. SODA 2004: 40-48 Ran Mendelson, Robert Endre Tarjan, Mikkel Thorup, Uri Zwick: Melding Priority Queues. SWAT 2004: 223-235

More Related