论文信息 - A Faster CREW PRAM Algorithm for Computing Cartesian Trees

A Faster CREW PRAM Algorithm for Computing Cartesian Trees

Cartesian tree is a fundamental data structure with many applications in the areas of data structures and string processing. In this paper, we study the construction of a Cartesian tree on a parallel computation model. We present a CREW PRAM algorithm that runs in O(logn) parallel time and has linear work and space. This improves upon the best previous result of Blelloch and Shun which takes O(log2 n) time and linear work/space.

Hao Yuan | Chung Keung Poon

[1] Robert E. Tarjan,et al. Scaling and related techniques for geometry problems , 1984, STOC '84.

[2] Prabhakar Ragde,et al. The Parallel Simplicity of Compaction and Chaining , 1990, J. Algorithms.

[3] Dan Gusfield,et al. Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .

[4] Jean Vuillemin,et al. A unifying look at data structures , 1980, CACM.

[5] Uzi Vishkin,et al. Finding the maximum, merging and sorting in a parallel computation model , 1981, CONPAR.

[6] Uzi Vishkin,et al. Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values , 1993, J. Algorithms.

[7] Gad M. Landau,et al. On Cartesian Trees and Range Minimum Queries , 2009, Algorithmica.

[8] Guy E. Blelloch,et al. A Simple Parallel Cartesian Tree Algorithm and its Application to Suffix Tree Construction , 2011, ALENEX.

[9] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.

[10] Joseph JáJá,et al. An Introduction to Parallel Algorithms , 1992 .

[11] Mikhail J. Atallah,et al. Data structures for range minimum queries in multidimensional arrays , 2010, SODA '10.