A fast equivalence-checking algorithm for circular lists (Q1255323): 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(79)90114-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2062330453 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An improved algorithm to check for polygon similarity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast Pattern Matching in Strings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An application of pattern matching to a problem in geometrical complexity / rank | |||
Normal rank | |||
Latest revision as of 00:38, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast equivalence-checking algorithm for circular lists |
scientific article |
Statements
A fast equivalence-checking algorithm for circular lists (English)
0 references
1979
0 references
Equivalence-Checking Algorithm
0 references
Circular Lists
0 references
