advanced data structures and implementation jones"an empirical comparison of priority-queue and event-set implementations,communications of the acm ( ) - karkkainen and sanders"simple linear work suffix array construction,proceedings of the thirtieth international colloquium on automatalanguages and programming ( ) - kasaig leeh arimuras arikawaand park"linear-time longest commonprefix computation in suffix arrays and its applications,proceedings of the twelfth annual symposium on combinatorial pattern matching ( ) - ko and aluru"space efficient linear time construction of suffix arrays,proceedings of the fourteenth annual symposium on combinatorial pattern matching ( ) - lee and wong"worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees,acta informatica ( ) - manber and myers"suffix arraysa new method for on-line string searches,siam journal on computing ( ) - martin and ness"optimizing binary trees grown with sorting algorithm,communications of the acm ( ) - mccreight"priority search trees,siam journal of computing ( ) - mccreight" space-economical suffix tree construction algorithm,journal of the acm ( ) - moret and shapiro"an empirical analysis of algorithms for constructing minimum spanning tree,proceedings of the second workshop on algorithms and data structures ( ) - nievergelt and reingold"binary search trees of bounded balance,siam journal on computing ( ) - overmars and van leeuwen"dynamic multidimensional data structures based on quad and - trees,acta informatica ( ) - pettie"towards final analysis of pairing heaps,proceedings of the forty-sixth annual ieee symposium on foundations of computer science ( ) - puglisiw smythand turpin" taxonomy of suffix array construction algorithms,acm computing surveys ( ) - samet"the quadtree and related hierarchical data structures,computing surveys ( ) - sedgewick and waynealgorithms th ed addison-wesley professionalbostonmass sleator and tarjan"self-adjusting binary search trees,journal of the acm ( ) - stasko and vitter"pairing heapsexperiments and analysis,communications of the acm ( ) - stephenson" method for constructing binary search trees by making insertions at the root,international journal of computer and information science ( ) - ukkonen"on-line construction of suffix trees,algorithmica ( ) - vuillemin" unifying look at data structures,communications of the acm ( ) - weiner"linear pattern matching algorithm,proceedings of the fourteenth annual ieee symposium on switching and automata theory( ) -