Timeline for Parallel prefix sum/scan on trees
Current License: CC BY-SA 4.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 22 at 19:35 | comment | added | Patrick Nicodemus | Thank you very much for your answer! Upon reflection, for my purposes I am interested in an algorithm which behaves well even on unbalanced trees, and will perform in sublinear time even when the tree is simply a linked list. I have edited the question to add this as a requirement, because I am interested in algorithms that behave well on arbitrary input and are always able to make some use of parallelization. | |
| Feb 22 at 5:14 | history | answered | Gaslight Deceive Subvert | CC BY-SA 4.0 |