Timeline for Bit complexity of O(1) time range query in a $k$-ary array
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 28, 2013 at 17:12 | history | edited | Bojan Serafimov | CC BY-SA 3.0 |
deleted 5 characters in body
|
| Jan 17, 2013 at 9:10 | comment | added | Raphael | I think this can be a good answer, if you just edited it to be correct and maybe a tad more elaborate on what these trees look like and how you build them. | |
| Jan 15, 2013 at 19:02 | comment | added | Juho | @BojanSerafimov You should update the answer then :) Comments might be deleted. | |
| Jan 15, 2013 at 14:25 | comment | added | Bojan Serafimov | sorry, its built in linear time | |
| Jan 14, 2013 at 22:30 | comment | added | Raphael | Can you outline how the tree is built in logarithmic time? | |
| Jan 11, 2013 at 11:55 | history | answered | Bojan Serafimov | CC BY-SA 3.0 |