Pages that link to "Item:Q1245010"
From MaRDI portal
The following pages link to An improved algorithm to check for polygon similarity (Q1245010):
Displayed 11 items.
- An algorithm to find polygon similarity (Q582069) (← links)
- On similarity of polynomial configurations (Q688225) (← links)
- Optimal canonization of all substrings of a string (Q1183603) (← links)
- Optimal algorithms for computing the canonical form of a circular string (Q1190455) (← links)
- Addendum to ``An improved algorithm to check for polygon similarity'' (Q1253938) (← links)
- A fast equivalence-checking algorithm for circular lists (Q1255323) (← links)
- On polygon similarity (Q1256866) (← links)
- Fast parallel Lyndon factorization with applications (Q4327381) (← links)
- A fast average case algorithm for lyndon decomposition (Q4876360) (← links)
- On geometric shape construction via growth operations (Q6111993) (← links)
- On geometric shape construction via growth operations (Q6140359) (← links)