FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W1985704385> ?p ?o ?g. }

• W1985704385 endingPage "20" @default.
• W1985704385 startingPage "1" @default.
• W1985704385 abstract "We present a simple linear work and space, and polylogarithmic time parallel algorithm for generating multiway Cartesian trees. We show that bottom-up traversals of the multiway Cartesian tree on the interleaved suffix array and longest common prefix array of a string can be used to answer certain string queries. By adding downward pointers in the tree (e.g. using a hash table), we can also generate suffix trees from suffix arrays on arbitrary alphabets in the same bounds. In conjunction with parallel suffix array algorithms, such as the skew algorithm, this gives a rather simple linear work parallel, O ( n ε ) time (0< ε <1), algorithm for generating suffix trees over an integer alphabet Σ {1, ..., n }, where n is the length of the input string. It also gives a linear work parallel algorithm requiring O (log2 n ) time with high probability for constant-sized alphabets. More generally, given a sorted sequence of strings and the longest common prefix lengths between adjacent elements, the algorithm will generate a patricia tree (compacted trie) over the strings. Of independent interest, we describe a work-efficient parallel algorithm for solving the all nearest smaller values problem using Cartesian trees, which is much simpler than the work-efficient parallel algorithm described in previous work. We also present experimental results comparing the performance of the algorithm to existing sequential implementations and a second parallel algorithm that we implement. We present comparisons for the Cartesian tree algorithm on its own and for constructing a suffix tree. The results show that on a variety of strings our algorithm is competitive with the sequential version on a single processor and achieves good speedup on multiple processors. We present experiments for three applications that require only the Cartesian tree, and also for searching using the suffix tree." @default.
• W1985704385 created "2016-06-24" @default.
• W1985704385 creator A5033930662 @default.
• W1985704385 creator A5051583907 @default.
• W1985704385 date "2014-10-03" @default.
• W1985704385 modified "2023-10-01" @default.
• W1985704385 title "A simple parallel cartesian tree algorithm and its application to parallel suffix tree construction" @default.
• W1985704385 cites W1966318226 @default.
• W1985704385 cites W1966473320 @default.
• W1985704385 cites W1974956214 @default.
• W1985704385 cites W1976682045 @default.
• W1985704385 cites W1979109797 @default.
• W1985704385 cites W1986324942 @default.
• W1985704385 cites W1996887196 @default.
• W1985704385 cites W2000788935 @default.
• W1985704385 cites W2003200876 @default.
• W1985704385 cites W2023186784 @default.
• W1985704385 cites W2023518480 @default.
• W1985704385 cites W2032574053 @default.
• W1985704385 cites W2047662881 @default.
• W1985704385 cites W2048952423 @default.
• W1985704385 cites W2054977714 @default.
• W1985704385 cites W2059245171 @default.
• W1985704385 cites W2059513841 @default.
• W1985704385 cites W2062679636 @default.
• W1985704385 cites W2067974452 @default.
• W1985704385 cites W2073921136 @default.
• W1985704385 cites W2085809150 @default.
• W1985704385 cites W2088386938 @default.
• W1985704385 cites W2090875625 @default.
• W1985704385 cites W2095685450 @default.
• W1985704385 cites W2098297530 @default.
• W1985704385 cites W2103913570 @default.
• W1985704385 cites W2107745473 @default.
• W1985704385 cites W2116628377 @default.
• W1985704385 cites W2121252285 @default.
• W1985704385 cites W2134283755 @default.
• W1985704385 cites W2135063076 @default.
• W1985704385 cites W2149098716 @default.
• W1985704385 cites W2155512447 @default.
• W1985704385 cites W2158874082 @default.
• W1985704385 cites W2160962794 @default.
• W1985704385 cites W2533248932 @default.
• W1985704385 cites W2973518926 @default.
• W1985704385 doi "https://doi.org/10.1145/2661653" @default.
• W1985704385 hasPublicationYear "2014" @default.
• W1985704385 type Work @default.
• W1985704385 sameAs 1985704385 @default.
• W1985704385 citedByCount "31" @default.
• W1985704385 countsByYear W19857043852014 @default.
• W1985704385 countsByYear W19857043852015 @default.
• W1985704385 countsByYear W19857043852017 @default.
• W1985704385 countsByYear W19857043852018 @default.
• W1985704385 countsByYear W19857043852019 @default.
• W1985704385 countsByYear W19857043852020 @default.
• W1985704385 countsByYear W19857043852021 @default.
• W1985704385 countsByYear W19857043852023 @default.
• W1985704385 crossrefType "journal-article" @default.
• W1985704385 hasAuthorship W1985704385A5033930662 @default.
• W1985704385 hasAuthorship W1985704385A5051583907 @default.
• W1985704385 hasConcept C113174947 @default.
• W1985704385 hasConcept C11413529 @default.
• W1985704385 hasConcept C114614502 @default.
• W1985704385 hasConcept C118146561 @default.
• W1985704385 hasConcept C120373497 @default.
• W1985704385 hasConcept C138885662 @default.
• W1985704385 hasConcept C141603448 @default.
• W1985704385 hasConcept C157486923 @default.
• W1985704385 hasConcept C162319229 @default.
• W1985704385 hasConcept C190290938 @default.
• W1985704385 hasConcept C199360897 @default.
• W1985704385 hasConcept C2779259728 @default.
• W1985704385 hasConcept C2779804580 @default.
• W1985704385 hasConcept C2781166958 @default.
• W1985704385 hasConcept C311688 @default.
• W1985704385 hasConcept C33923547 @default.
• W1985704385 hasConcept C37914503 @default.
• W1985704385 hasConcept C38652104 @default.
• W1985704385 hasConcept C41008148 @default.
• W1985704385 hasConcept C41895202 @default.
• W1985704385 hasConcept C67388219 @default.
• W1985704385 hasConcept C7757238 @default.
• W1985704385 hasConcept C87431388 @default.
• W1985704385 hasConcept C99138194 @default.
• W1985704385 hasConceptScore W1985704385C113174947 @default.
• W1985704385 hasConceptScore W1985704385C11413529 @default.
• W1985704385 hasConceptScore W1985704385C114614502 @default.
• W1985704385 hasConceptScore W1985704385C118146561 @default.
• W1985704385 hasConceptScore W1985704385C120373497 @default.
• W1985704385 hasConceptScore W1985704385C138885662 @default.
• W1985704385 hasConceptScore W1985704385C141603448 @default.
• W1985704385 hasConceptScore W1985704385C157486923 @default.
• W1985704385 hasConceptScore W1985704385C162319229 @default.
• W1985704385 hasConceptScore W1985704385C190290938 @default.
• W1985704385 hasConceptScore W1985704385C199360897 @default.
• W1985704385 hasConceptScore W1985704385C2779259728 @default.
• W1985704385 hasConceptScore W1985704385C2779804580 @default.
• W1985704385 hasConceptScore W1985704385C2781166958 @default.

• next