A fast equivalence-checking algorithm for circular lists
From MaRDI portal
Publication:1255323
DOI10.1016/0020-0190(79)90114-5zbMath0401.68045OpenAlexW2062330453MaRDI QIDQ1255323
Publication date: 1979
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(79)90114-5
Related Items (6)
Canonical representations of partial 2-and 3-trees ⋮ A randomized algorithm for checking equivalence of circular lists ⋮ A note on a simple computation of the maximal suffix of a string ⋮ Lexicographically least circular substrings ⋮ Quantum algorithm for lexicographically minimal string rotation ⋮ Canonical representations of partial 2- and 3-trees
Cites Work
This page was built for publication: A fast equivalence-checking algorithm for circular lists