Timeline for Solve a Diagonal Burrows-Wheeler transform
Current License: CC BY-SA 3.0
19 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 29, 2021 at 2:37 | answer | added | emanresu A | timeline score: 0 | |
| Apr 16, 2021 at 6:25 | answer | added | Razetime | timeline score: 1 | |
| Mar 24, 2021 at 18:08 | answer | added | l4m2 | timeline score: 1 | |
| Mar 24, 2021 at 17:49 | answer | added | xigoi | timeline score: 0 | |
| Mar 24, 2021 at 12:37 | answer | added | SegFaultPlus4 | timeline score: 1 | |
| Jun 17, 2020 at 9:04 | history | edited | CommunityBot |
Commonmark migration
|
|
| Oct 24, 2015 at 15:30 | vote | accept | GamrCorps | ||
| Feb 28, 2015 at 8:48 | history | tweeted | twitter.com/#!/StackCodeGolf/status/571592687780036609 | ||
| Feb 27, 2015 at 14:46 | comment | added | GamrCorps | @Optimizer it is not necessary. | |
| Feb 27, 2015 at 13:06 | comment | added | FUZxxl | A Burrows-Wheeler transformation is different in that the array of all rotations is sorted lexicographically before you take the last items. | |
| Feb 27, 2015 at 13:05 | comment | added | FUZxxl | This is not a Burrows-Wheeler transoformation. | |
| Feb 27, 2015 at 5:58 | answer | added | Optimizer | timeline score: 12 | |
| Feb 27, 2015 at 5:37 | answer | added | Digital Trauma | timeline score: 2 | |
| Feb 27, 2015 at 5:23 | comment | added | Optimizer | Do we have to convert even length input string to odd length ? | |
| Feb 27, 2015 at 4:43 | answer | added | xnor | timeline score: 7 | |
| Feb 27, 2015 at 4:22 | answer | added | NinjaBearMonkey | timeline score: 2 | |
| Feb 27, 2015 at 4:02 | answer | added | Maltysen | timeline score: 3 | |
| Feb 27, 2015 at 2:59 | answer | added | randomra | timeline score: 4 | |
| Feb 27, 2015 at 2:28 | history | asked | GamrCorps | CC BY-SA 3.0 |