A Simple Parallel Cartesian Tree Algorithm and its Application to Suffix Tree Construction

From MaRDI portal

Revision as of 18:39, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5233696

Jump to:navigation, search

DOI10.1137/1.9781611972917.5zbMath1429.68047OpenAlexW2287432258MaRDI QIDQ5233696

Julian Shun, Guy E. Blelloch

Publication date: 12 September 2019

Published in: 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611972917.5

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Parallel algorithms in computer science (68W10) Data structures (68P05)

Related Items (2)

Sliding suffix tree ⋮ Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies

This page was built for publication: A Simple Parallel Cartesian Tree Algorithm and its Application to Suffix Tree Construction

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5233696&oldid=19849735"