Timeline for Succinct data structure to return occurences of letters until an index
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 12, 2016 at 22:25 | comment | added | Ori Refael | hi, thats for replying. as it seems, people said that there is efficient way to get the number of occurences than Lg(n). the main problem is when the string contains unknown number of occurences of each letter and thats what Im trying to solve. | |
| Dec 12, 2016 at 21:53 | history | answered | Gilles 'SO- stop being evil' | CC BY-SA 3.0 |