operation     binary   binomial  fibonacci    pairing     brodal strict fibonacci heap
0      find - min      θ (1)      θ (1)      θ (1)      θ (1)      θ (1)                 θ (1)
1    delete - min  θ (log n)  θ (log n)  o (log n)  o (log n)  o (log n)             o (log n)
2          insert  θ (log n)  o (log n)      θ (1)      θ (1)      θ (1)                 θ (1)
3  decrease - key  θ (log n)  θ (log n)      θ (1)  o (log n)      θ (1)                 θ (1)
4           merge      θ (n)  o (log n)      θ (1)      θ (1)      θ (1)                 θ (1)

Table as JSON:
{"operation":{"0":"find - min","1":"delete - min","2":"insert","3":"decrease - key","4":"merge"},"binary":{"0":"θ (1)","1":"θ (log n)","2":"θ (log n)","3":"θ (log n)","4":"θ (n)"},"binomial":{"0":"θ (1)","1":"θ (log n)","2":"o (log n)","3":"θ (log n)","4":"o (log n)"},"fibonacci":{"0":"θ (1)","1":"o (log n)","2":"θ (1)","3":"θ (1)","4":"θ (1)"},"pairing":{"0":"θ (1)","1":"o (log n)","2":"θ (1)","3":"o (log n)","4":"θ (1)"},"brodal":{"0":"θ (1)","1":"o (log n)","2":"θ (1)","3":"θ (1)","4":"θ (1)"},"strict fibonacci heap":{"0":"θ (1)","1":"o (log n)","2":"θ (1)","3":"θ (1)","4":"θ (1)"}}