Related changes
Enter a page name to see changes on pages linked to or from that page. (To see members of a category, enter Category:Name of category). Changes to pages on your Watchlist are shown in bold with a green bullet. See more at Help:Related changes.
List of abbreviations (help):
- D
- Edit made at Wikidata
- r
- Edit flagged by ORES
- N
- New page
- m
- Minor edit
- b
- Bot edit
- (±123)
- Page byte size change
- Temporarily watched page
23 April 2025
- diffhist Suffix array 11:06 +9 ExplodingCabbage talk contribs (Clarify definition of "sparse suffix array")
- diffhist m Suffix array 11:03 +2 ExplodingCabbage talk contribs (grammar/typo fix)
- diffhist Suffix array 11:02 −612 ExplodingCabbage talk contribs (Removed Gawrychowski & Kociumaka cite. I don't see how their algorithms - all with worse than O(n) time complexity and limited to integer alphabets - can *possibly* be "optimal" as claimed here, since in the preceding paragraph we noted a COMPLETE suffix array can be computed in O(n) time and it's obviously only a further O(n) operation to filter that result down to a sparse suffix array. I have not studied the papers closely but surely the optimality claim just trivially cannot be true?)