Lexicographically least circular substrings (Q1144948): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(80)90149-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1995300673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4773298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Pattern Matching in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast equivalence-checking algorithm for circular lists / rank
 
Normal rank

Latest revision as of 09:28, 13 June 2024

scientific article
Language Label Description Also known as
English
Lexicographically least circular substrings
scientific article

    Statements

    Identifiers