Λίστα Εργασιών Data Structures for Tree Manipulation D. Harel and R.E. Tarjan. Fast Algorithms for finding nearest common ancestors. SIAM J. Computing,

Slides:

Advertisements

Similar presentations

Turning Amortized to Worst-Case Data Structures: Techniques and Results Tsichlas Kostas.

Advertisements

List Order Maintenance

Gerth Stølting Brodal University of Aarhus Monday June 9, 2008, IT University of Copenhagen, Denmark International PhD School in Algorithms for Advanced.

Dynamic Graph Algorithms - I

Tight Bounds for Dynamic Convex Hull Queries (Again) Erik DemaineMihai Pătraşcu.

Priority Queues  MakeQueuecreate new empty queue  Insert(Q,k,p)insert key k with priority p  Delete(Q,k)delete key k (given a pointer)  DeleteMin(Q)delete.

An Optimal Dynamic Interval Stabbing-Max Data Structure? Pankaj K. Agarwal, Lars Arge and Ke Yi Department of Computer Science Duke University.

1 Functional Data Structures Purely functional car cdr never modify only create new pairs only DAGs [C. Okasaki, Simple and efficient purely functional.

D. D. Sleator and R. E. Tarjan | AT&T Bell Laboratories Journal of the ACM | Volume 32 | Issue 3 | Pages | 1985 Presented By: James A. Fowler,

Msb(x) in O(1) steps using 5 multiplications Word size n = g∙g, g a power of 2 [M.L. Fredman, D.E. Willard, Surpassing the information-theoretic bound.

1 A Faster Approximation Algorithm For The Steiner Problem In Graphs Kurt Mehlhorn. Information Processing Letters, 27(3):125–128, 高等演算法二

Rank-Pairing Heaps Robert Tarjan, Princeton University & HP Labs Joint work with Bernhard Haeupler and Siddhartha Sen, ESA

EECS 4101/5101 Prof. Andy Mirzaian. Lists Move-to-Front Search Trees Binary Search Trees Multi-Way Search Trees B-trees Splay Trees Trees Red-Black.

Time O(log d) Exponential-search(13) Finger Search Searching in a sorted array time O(log n) Binary-search(13)

1 Hashing, randomness and dictionaries Rasmus Pagh PhD defense October 11, 2002.

1 Self-Adjusting Data Structures. 2 Lists [D.D. Sleator, R.E. Tarjan, Amortized Efficiency of List Update Rules, Proc. 16 th Annual ACM Symposium on Theory.

Unified Access Bound 1 [M. B ă doiu, R. Cole, E.D. Demaine, J. Iacono, A unified access bound on comparison- based dynamic dictionaries, Theoretical Computer.

Data Structures: Range Queries - Space Efficiency Pooya Davoodi Aarhus University PhD Defense July 4, 2011.

Dynamic Planar Range Maxima Queries (presented at ICALP 2011) Gerth Stølting Brodal Aarhus University Kostas Tsakalidis LIAFA, Université Paris Diderot,

O(log n) bits or atomic elements

Update Persistent Data Structures (Version Control) v0v0 v1v1 v2v2 v3v3 v4v4 v5v5 v6v6 Ephemeral query v0v0 v1v1 v2v2 v3v3 v4v4 v5v5 v6v6 Partial persistence.

Update 1 Persistent Data Structures (Version Control) v0v0 v1v1 v2v2 v3v3 v4v4 v5v5 v6v6 Ephemeral query v0v0 v1v1 v2v2 v3v3 v4v4 v5v5 v6v6 Partial persistence.

Rank-Pairing Heaps Bernhard Haeupler, Siddhartha Sen, and Robert Tarjan, ESA

Fully Persistent B-Trees 23 rd Annual ACM-SIAM Symposium on Discrete Algorithms, Kyoto, Japan, January 18, 2012 Gerth Stølting Brodal Konstantinos Tsakalidis.

The restriction mapping problem revisited Gopal Pandurangan and H. Ramesh Journal of Computer and System Sciences 526~544(2002)

DART! Time Assigner By: Matt Ivers and Ray Kilway.

MIKKEL THORUP 1999 Journal of the ACM Undirected Single-Source Shortest Paths with Positive Integer Weights in Linear Time.

Melding Priority Queues Ran Mendelson Robert E. Tarjan Mikkel Thorup Uri Zwick SWAT 2004.

Fractional Cascading and Its Applications G. S. Lueker. A data structure for orthogonal range queries. In Proc. 19 th annu. IEEE Sympos. Found. Comput.

UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2001 Lecture 11 Tuesday, 12/4/01 Advanced Data Structures Chapters.

0 Course Outline n Introduction and Algorithm Analysis (Ch. 2) n Hash Tables: dictionary data structure (Ch. 5) n Heaps: priority queue data structures.

Improved Randomized Algorithms for Path Problems in Graphs PhD Thesis Surender Baswana Department of Computer Science & Engineering, I.I.T. Delhi Research.

Nirmalya Roy School of Electrical Engineering and Computer Science Washington State University Cpt S 223 – Advanced Data Structures Graph Algorithms: Minimum.

Strict Fibonacci Heaps Gerth Stølting Brodal Aarhus University George Lagogiannis Robert Endre Tarjan Agricultural University of Athens Princeton University.

Algorithms and Data Structures Gerth Stølting Brodal Computer Science Day, Department of Computer Science, Aarhus University, May 25, 2012.

Time O(log d) Exponential-search(13) Finger Search Searching in a sorted array time O(log n) Binary-search(13)

Path Minima on Dynamic Weighted Trees Pooya Davoodi Aarhus University Aarhus University, November 17, 2010 Joint work with Gerth Stølting Brodal and S.

A Worst Case, Constant Time Priority Queue: Beating a Lower Bound Ian Munro University of Waterloo Joint work with Andrej Brodnik (Ljubljana & Luleå) Svante.

Algorithms and Data Structures Gerth Stølting Brodal Computer Science Day, Department of Computer Science, Aarhus University, May 25, 2012.

Kinetic data structures. Goal Maintain a configuration of moving objects Each object has a posted flight plan (this is essentially a well behaved function.

Λίστα Εργασιών External Memory Data Structures Vitter, J. S. and Shriver, E. 1994a. Algorithms for parallel memory I: Two-level memories. Algorithmica.

Open Problem: Dynamic Planar Nearest Neighbors CSCE 620 Problem 63 from the Open Problems Project

CSS446 Spring 2014 Nan Wang.  to study trees and binary trees  to understand how binary search trees can implement sets  to learn how red-black trees.

Gerth stølting Brodal 1 Closing a Classical Data Structure Problem Gerth Stølting Brodal : Strict Fibonacci Heaps joint work with George Lagogiannis Robert.

Kinetic Heaps K, Tarjan, and Tsioutsiouliklis. Broadcast Scheduling Parametric and Kinetic Heaps Broadcast Scheduling Using a Kinetic Heap The Computational.

MotivationLocating the k largest subsequences: Main ideasResults Problem definitions Problem instance ( k=5 ) Bibliography

Internal Memory Pointer MachineRandom Access MachineStatic Setting Data resides in records (nodes) that can be accessed via pointers (links). The priority.

Memory Hierarchies [FLPR12] Matteo Frigo, Charles E. Leiserson, Harald Prokop, Sridhar Ramachandran. Cache- Oblivious Algorithms. ACM Transactions on Algorithms,

(A Survey on) Priority Queues IanFest, University of Waterloo, Waterloo, Ontario, Canada, August 14-15, 2013 Gerth Stølting Brodal Aarhus Universty.

Confluently Persistent Tries Eric Price, MIT joint work with Erik Demaine, MIT Stefan Langerman, Université Libre de Bruxelles.

Succinct Data Structures

Self-Adjusting Data Structures

lsb(x) = Least Significant Bit ?

Succinct Data Structures

A Worst Case, Constant Time Priority Queue

List Order Maintenance

Persistent Data Structures (Version Control)

Searching in Trees Gerth Stølting Brodal Aarhus University

Priority Queues MakeQueue create new empty queue

Minimum Spanning Tree Verification

Selection in heaps and row-sorted matrices

Course Outline Introduction and Algorithm Analysis (Ch. 2)

A simpler implementation and analysis of Chazelle’s

Discrete Methods in Mathematical Informatics

Closing a Classical Data Structure Problem Gerth Stølting Brodal

Strict Fibonacci Heaps

String Data Structures and Algorithms

Melding Priority Queues

Union-Find with Constant Time Deletions

Department of Computer Science & Engineering

Presentation transcript:

Λίστα Εργασιών Data Structures for Tree Manipulation D. Harel and R.E. Tarjan. Fast Algorithms for finding nearest common ancestors. SIAM J. Computing, 13(2): , A.K. Tsakalidis. The Nearest Common Ancestor in a Dynamic Tree, Acta Informatica 25, (1988). S. Alstrup and M. Thorup, Optimal Pointer Algorithms for Finding Nearest Common Ancestors in Dynamic Trees, Journal of Algorithms, 35(2): (2000)35 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, R. Cole and R. Hariharan, Dynamic lca queries on trees, In Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 10, Rajamani SundarRajamani Sundar, Robert Endre Tarjan: Unique Binary Search Tree Representations and Equality-testing of Sets and Sequences STOC 1990: 18-25STOC 1990 Kurt MehlhornKurt Mehlhorn, R. Sundar, Christian Uhrig: Maintaining Dynamic Sequences under Equality Tests in Polylogarithmic Time. Algorithmica 17(2): (1997).R. SundarAlgorithmica 17 Richard Cole, Ramesh Hariharan: Tree Pattern Matching to Subset Matching in Linear Time. SIAM J. Comput. 32(4): (2003 )Ramesh HariharanSIAM J. Comput. 32

Persistence J. R. Driscoll, N. Sarnak, D. Sleator, and R. Tarjan. Making data structures persistent. J. of Computer and System Science, 38:86-124, J. Driscoll, D. Sleator, and R. Tarjan. Fully persistent lists with catenation. Journal of the ACM, 41(5): , L. Buchsbaum and R. E. Tarjan. Confluently persistent deques via data structural bootstrapping. J. of Algorithms, 18: , 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): , 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 ACM Press, 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 ACM Press, A. Fiat, H. Kaplan, Making Data Structures Confluently Persistent, ACM SODA 2001.

Search Trees and Priority Queues A.K. Tsakalidis, AVL-trees for localized search. Information and Control, 67: , R. Fleischer, A simple balanced search tree with O(1) worst-case update time. International Journal of Foundations of Computer Science, 7: , 1996 G. S. Brodal. Finger Search Trees with Constant Insertion Time. In Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages , M. A. Bender and M. Farach-Colton. The Level Ancestor Problem Simplified. LATIN, pages , 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 , Daniel Dominic Sleator and Robert Endre Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32(3): , July John Iacono, Alternatives to Splay Trees with O(logn) Worst-Case Access Times, ACM/SIAM SODA 2001, 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 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. 1719, pp. 484490.

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