Timeline for Integer priority queue with distribution-sensitive deleteMin
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 11, 2014 at 0:11 | comment | added | jbapple | $w_x$ and $q_x$ can vary independently of $\delta_{\textrm{min}}$. | |
| Jun 10, 2014 at 14:13 | comment | added | A T | Technically it is dependent on those variables; meaning that the deleteMin is distribution sensitive, right? | |
| Jun 10, 2014 at 14:11 | history | edited | A T | CC BY-SA 3.0 |
Fixed lack of LaTeX when copy-pasting
|
| Jun 9, 2014 at 5:03 | comment | added | jbapple | This does not answer the question. I am asking for operations that take time proportional to the distance from the smallest to the second smallest key. This measure is incomparable with a measure based $w_x$ and $q_x$. | |
| Jun 9, 2014 at 4:58 | history | answered | A T | CC BY-SA 3.0 |