Lexicographically least circular substrings (Q1144948): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| 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 10:28, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lexicographically least circular substrings |
scientific article |
Statements
Lexicographically least circular substrings (English)
0 references
1980
0 references
lexicographically least circular substrings
0 references
