Fast canonization of circular strings
From MaRDI portal
Publication:3910014
DOI10.1016/0196-6774(81)90013-4zbMath0459.68035MaRDI QIDQ3910014
Publication date: 1981
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(81)90013-4
68R99: Discrete mathematics in relation to computer science
Related Items
Fast parallel Lyndon factorization with applications, A fast average case algorithm for lyndon decomposition, Optimal canonization of all substrings of a string, Optimal algorithms for computing the canonical form of a circular string, Efficient CRCW-PRAM algorithms for universal substring searching, An efficient parallel algorithm for the single function coarsest partition problem, Sorting strings and constructing digital search trees in parallel